Computing reachable simulations on transition systems
From MaRDI portal
Cites work
- A more efficient simulation algorithm on Kripke structures
- 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
- 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?)
- 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
- Tools and algorithms for the construction and analysis of systems. 7th international conference, TACAS 2001, held as part of the joint European conferences on theory and practice of software, ETAPS 2001, Genova, Italy, April 2--6, 2001. Proceedings
- Transformational design and implementation of a new efficient solution to the ready simulation problem
This page was built for publication: Computing reachable simulations on transition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7405567)
