Essential transitions to bisimulation equivalences

DOI10.1016/S0304-3975(96)00281-2zbMath0901.68140MaRDI QIDQ1391753

Martti Tienari, Antti Valmari, Jaana Eloranta

Publication date: 22 July 1998

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

zbMATH Keywords

labelled transition system

Mathematics Subject Classification ID

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

Related Items

Bisimulations of Probabilistic Boolean Networks, The quest for minimal quotients for probabilistic and Markov automata, Towards a unified view of bisimulation: A comparative study

Uses Software

• LOTOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bisimulation and divergence
• An implementation of an efficient algorithm for bisimulation equivalence
• Algebra of communicating processes with abstraction
• Minimizing the number of transitions with respect to observation equivalence
• Minimal state graph generation
• Branching bisimilarity is an equivalence indeed!
• A Theory of Communicating Sequential Processes