Correcting a Space-Efficient Simulation Algorithm

DOI10.1007/978-3-540-70545-1_49zbMath1155.68450OpenAlexW1737886586MaRDI QIDQ3512514

B. Ploeger, Robert J. van Glabbeek

Publication date: 15 July 2008

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70545-1_49

Mathematics Subject Classification ID

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

Modal logic and the approximation induction principle, An Algorithm for Probabilistic Alternating Simulation, A space-efficient simulation algorithm on probabilistic automata, Minimal consistent DFA from sample strings, Correcting a Space-Efficient Simulation Algorithm, A Space-Efficient Probabilistic Simulation Algorithm, An efficient simulation algorithm on Kripke structures, Five Determinisation Algorithms, An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation, An efficient simulation algorithm based on abstract interpretation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• Structured operational semantics and bisimulation as a congruence
• Property preserving abstractions for the verification of concurrent systems
• From bisimulation to simulation: Coarsest partition problems
• Transformational design and implementation of a new efficient solution to the ready simulation problem
• Correcting a Space-Efficient Simulation Algorithm
• “Sometimes” and “not never” revisited
• Bisimulation can't be traced
• Simulation-based minimization
• Model Checking Software
• Equivalence-checking on infinite-state systems: Techniques and results