scientific article; zbMATH DE number 177532
From MaRDI portal
Publication:4037401
zbMATH Open0765.68118MaRDI QIDQ4037401FDOQ4037401
Authors: Rance Cleaveland 
Publication date: 18 May 1993
Title of this publication is not available (Why is that?)
Recommendations
- An implementation of an efficient algorithm for bisimulation equivalence
- scientific article; zbMATH DE number 2020181
- Deciding bisimulation equivalences for a class of non-finite-state programs
- Deciding bisimulation equivalences for a class of non-finite-state programs
- On the proof method for bisimulation
- An efficient algorithm for computing bisimulation equivalence
- Tools and Algorithms for the Construction and Analysis of Systems
- On the bisimulation proof method
- Deriving bisimulation relations from path based equivalence checkers
Hennessy-Milner logicbisimulation equivalenceKanellakis-Smolka bisimulation algorithmverifying finite-state systems
Cited In (13)
- Process algebra and model checking
- Fixpoint Theory -- Upside Down
- Constructive logical characterizations of bisimilarity for reactive probabilistic systems
- Title not available (Why is that?)
- Generating diagnostic information for behavioral preorders
- Exploring probabilistic bisimulations. I
- Equivalence checking 40 years after: a review of bisimulation tools
- Fixpoint theory -- upside down
- A game for linear-time-branching-time spectroscopy
- Bisimulation for labelled Markov processes
- Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
- Title not available (Why is that?)
- Bisimulation and Hennessy-Milner logic for generalized synchronization trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037401)
