The reachable simulation problem
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1705168 (Why is no real title available?)
- scientific article; zbMATH DE number 177515 (Why is no real title available?)
- scientific article; zbMATH DE number 1306878 (Why is no real title available?)
- scientific article; zbMATH DE number 1927588 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- A classification of symbolic transition systems
- A more efficient simulation algorithm on Kripke structures
- An \(O(m \log n)\) algorithm for branching bisimilarity on labelled transition systems
- An O(m n) algorithm for computing stuttering equivalence and branching bisimulation
- An efficient simulation algorithm based on abstract interpretation
- An efficient simulation algorithm on Kripke structures
- Bisimulation minimization and symbolic model checking
- Computer Aided Verification
- Correcting a Space-Efficient Simulation Algorithm
- Equivalence-checking on infinite-state systems: Techniques and results
- Five Determinisation Algorithms
- Foundation for a series of efficient simulation algorithms
- From bisimulation to simulation: Coarsest partition problems
- Handbook of model checking
- Lattice Theory: Foundation
- Minimal state graph generation
- On abstraction-based controller design with output feedback
- Property preserving abstractions for the verification of concurrent systems
- Saving space in a time efficient simulation algorithm
- Simulation preorder over simple process algebras
- Simulation problems over one-counter nets
- Simulation-based minimization
- Three Partition Refinement Algorithms
- Transformational design and implementation of a new efficient solution to the ready simulation problem
This page was built for publication: The reachable simulation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6939167)
