A fast bisimulation algorithm
From MaRDI portal
Recommendations
- An efficient algorithm for computing bisimulation equivalence
- An implementation of an efficient algorithm for bisimulation equivalence
- Simulation as coarsest partition problem
- From bisimulation to simulation: Coarsest partition problems
- An efficient fully symbolic bisimulation algorithm for non-deterministic systems
Cited in
(17)- Bisimulation and effectiveness
- Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice
- An efficient algorithm for computing bisimulation equivalence
- Verifying persistent security properties
- An efficient fully symbolic bisimulation algorithm for non-deterministic systems
- DEL planning and some tractable cases
- A fully symbolic bisimulation algorithm
- On the Minimisation of Acyclic Models
- Rank-based symbolic bisimulation: (and model checking)
- Computing maximal weak and other bisimulations
- scientific article; zbMATH DE number 7301461 (Why is no real title available?)
- An Incremental Bisimulation Algorithm
- Computing crisp bisimulations for fuzzy structures
- Lowerbounds for Bisimulation by Partition Refinement
- Equivalence checking 40 years after: a review of bisimulation tools
- Model completeness for rational trees
- An implementation of an efficient algorithm for bisimulation equivalence
This page was built for publication: A fast bisimulation algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4551136)
