An efficient algorithm for branching bisimulation and stuttering equivalence
From MaRDI portal
Recommendations
- An \(O(m\log n)\) algorithm for stuttering equivalence and branching bisimulation
- An O(m n) algorithm for computing stuttering equivalence and branching bisimulation
- An implementation of an efficient algorithm for bisimulation equivalence
- An efficient algorithm for computing bisimulation equivalence
- An O(m n) algorithm for branching bisimilarity on labelled transition systems
Cited in
(71)- A direct branching algorithm for checking the equivalence of two deterministic pushdown transducers, one of which is real-time strict
- Experimenting with process equivalence
- Proving finiteness of CCS processes by non-standard semantics
- Deciding true concurrency equivalences on safe, finite nets
- Complexity of equivalence problems for concurrent systems of finite agents
- Essential transitions to bisimulation equivalences
- Parity game reductions
- A partial order approach to branching time logic model checking.
- Branching time and orthogonal bisimulation equivalence
- Timing and causality in process algebra
- Deciding bisimilarity and similarity for probabilistic processes.
- On the semantics of polychronous polytimed specifications
- On the probabilistic bisimulation spectrum with silent moves
- A complete axiomatization of weighted branching bisimulation
- Team equivalences for finite-state machines with silent moves
- Investigating single-type structural elements of a component Petri net during component modeling and analysis of a complex system with parallelism
- An \(O(m\log n)\) algorithm for stuttering equivalence and branching bisimulation
- Compositional verification of asynchronous concurrent systems using CADP
- Next-preserving branching bisimulation
- Generating BDDs for symbolic model checking in CCS
- Deciding orthogonal bisimulation
- Branching bisimulation for probabilistic systems: characteristics and decidability
- Divergent stutter bisimulation abstraction for controller synthesis with linear temporal logic specifications
- Branching bisimulation games
- Distributed branching bisimulation reduction of state spaces
- Folk Theorems on the Correspondence between State-Based and Event-Based Systems
- Computing Stuttering Simulations
- On the Minimisation of Acyclic Models
- On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems
- Thread algebra for noninterference
- Compositionality in state space verification methods
- Polynomial time decision algorithms for probabilistic automata
- Confluence reduction for Markov automata
- scientific article; zbMATH DE number 7559464 (Why is no real title available?)
- Computing maximal weak and other bisimulations
- scientific article; zbMATH DE number 7243676 (Why is no real title available?)
- Relating apartness and bisimulation
- An O(m n) algorithm for branching bisimilarity on labelled transition systems
- Causal Semantics for BPP Nets with Silent Moves
- Smaller Abstractions for ∀CTL* without Next
- Checking equivalences between concurrent systems of finite agents (extended abstract)
- An O(m n) algorithm for computing stuttering equivalence and branching bisimulation
- CONCUR 2005 – Concurrency Theory
- Inheritance of behavior
- Inheritance of workflows: An approach to tackling problems related to change
- Rooted divergence-preserving branching bisimilarity is a congruence: a simpler proof
- Translating FSP into LOTOS and networks of automata
- Back-and-forth in space: on logics and bisimilarity in closure spaces
- Equivalence checking 40 years after: a review of bisimulation tools
- Apartness and distinguishing formulas in Hennessy-Milner logic
- Characterization and verification of stuttering equivalence
- Computing distinguishing formulas for branching bisimulation
- A proof assistant for PSF
- Generating BDDs for symbolic model checking in CCS
- A semantic driven method to check the fineteness of CCS processes
- Branching bisimulation semantics enables noninterference analysis of reversible systems
- Compositional verification of priority systems using sharp bisimulation
- Positive Hennessy-Milner logic for branching bisimulation
- A cancellation law for probabilistic processes
- Compositional reasoning in model checking
- Noninterference analysis of reversible systems: an approach based on branching bisimilarity
- Verification of reactive systems via instantiation of parameterised Boolean equation systems
- Unified bisimulation applied to incremental abstraction of Petri nets
- A state-based O(m n) partitioning algorithm for branching bisimilarity
- A Formal Development of a Polychronous Polytimed Coordination Language
- Game-theoretic simulation checking tool
- Branching bisimulation congruence for probabilistic systems
- Raiders of the lost equivalence: probabilistic branching bisimilarity
- Cones and foci: A mechanical framework for protocol verification
- Generalizing the Paige-Tarjan algorithm by abstract interpretation
- Automatic verification of distributed systems: the process algebra approach.
This page was built for publication: An efficient algorithm for branching bisimulation and stuttering equivalence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4038723)
