An efficient simulation algorithm on Kripke structures
From MaRDI portal
Publication:2453984
DOI10.1007/s00236-014-0195-9zbMath1301.68189arXiv1212.1089OpenAlexW2003029339MaRDI QIDQ2453984
Publication date: 12 June 2014
Published in: Acta Informatica, Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.1089
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
A space-efficient simulation algorithm on probabilistic automata, An efficient simulation algorithm on Kripke structures, An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bisimulation minimization and symbolic model checking
- An efficient simulation algorithm based on abstract interpretation
- From bisimulation to simulation: Coarsest partition problems
- Transformational design and implementation of a new efficient solution to the ready simulation problem
- An efficient simulation algorithm on Kripke structures
- Saving Space in a Time Efficient Simulation Algorithm
- Incremental graph pattern matching
- Rank and simulation: the well-founded case
- Correcting a Space-Efficient Simulation Algorithm
- Simulation-based minimization
- Computing Simulations over Tree Automata
