Towards a unified view of bisimulation: A comparative study

DOI10.1016/S0304-3975(99)00303-5zbMath0944.68136WikidataQ127628855 ScholiaQ127628855MaRDI QIDQ1575240

Mila E. Majster-Cederbaum, Markus Roggenbach

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

bisimulationsemanticsconcurrencyevent structures

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (13)

Transition systems from event structures revisited ⋮ Fuzzy approximations of fuzzy relational structures ⋮ Characterization and computation of approximate bisimulations for fuzzy automata ⋮ On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations ⋮ Bisimulations for fuzzy automata ⋮ Nondeterministic automata: equivalence, bisimulations, and uniform relations ⋮ Tree-functors, determinacy and bisimulations ⋮ Computation of the greatest simulations and bisimulations between fuzzy automata ⋮ A coalgebraic presentation of structured transition systems ⋮ Fuzzy relation equations and reduction of fuzzy automata ⋮ Reduction of fuzzy automata by means of fuzzy quasi-orders ⋮ Computation of the greatest right and left invariant fuzzy quasi-orders and fuzzy equivalences ⋮ Bisimulation of type 2 for BL-general fuzzy automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transition systems from event structures revisited
• Petri nets and bisimulation
• Structural operational semantics for weak bisimulations
• Studying equivalences of transition systems with algebraic tools
• Bisimulation and action refinement
• Universal axioms for bisimulations
• Refinement of actions in event structures and causal trees
• Characterizing finite Kripke structures in propositional temporal logic
• A calculus of communicating systems
• Domain theory in logical form
• Maximality preserving bisimulation
• Essential transitions to bisimulation equivalences
• Bisimulation from open maps
• Concurrent bisimulations in Petri nets
• A domain equation for bisimulation
• Three logics for branching bisimulation
• A final coalgebra theorem

This page was built for publication: Towards a unified view of bisimulation: A comparative study