Equivalence and preorder checking for finite-state systems
From MaRDI portal
Recommendations
- Testing equivalence as a bisimulation equivalence
- Equivalence-checking with infinite-state systems: techniques and results
- Computing Behavioral Relations for Probabilistic Concurrent Systems
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines
- A general approach to comparing infinite-state systems with their finite-state specifications
Cited in
(15)- An efficient simulation algorithm based on abstract interpretation
- Constructive logical characterizations of bisimilarity for reactive probabilistic systems
- Program algebra with unit instruction operators
- An efficient algorithm for computing bisimulation equivalence
- Ensuring liveness properties of distributed systems: open problems
- Testing equivalence as a bisimulation equivalence
- Selected Ideas Used for Decidability and Undecidability of Bisimilarity
- scientific article; zbMATH DE number 1333608 (Why is no real title available?)
- scientific article; zbMATH DE number 6970796 (Why is no real title available?)
- Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application
- An invariant-based approach to the verification of asynchronous parameterized networks
- A Simpler Alternative: Minimizing Transition Systems Modulo Alternating Simulation Equivalence
- Equivalence checking 40 years after: a review of bisimulation tools
- Approximating Markovian testing equivalence
- Conjunction on processes: Full abstraction via ready-tree semantics
This page was built for publication: Equivalence and preorder checking for finite-state systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2760243)
