Branching time and orthogonal bisimulation equivalence

DOI10.1016/S0304-3975(03)00277-9zbMath1070.68100OpenAlexW4212967532MaRDI QIDQ1884905

Alban Ponse, Mark B. van der Zwaag, Jan A. Bergstra

Publication date: 27 October 2004

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00277-9

zbMATH Keywords

Process algebraBranching timeLabelled transition systemOrthogonal bisimulationSilent step

Mathematics Subject Classification ID

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

Related Items (8)

Preferential choice and coordination conditions ⋮ Equivalence checking 40 years after: a review of bisimulation tools ⋮ Deciding orthogonal bisimulation ⋮ Branching Bisimulation Congruence for Probabilistic Systems ⋮ Branching bisimulation congruence for probabilistic systems ⋮ The compression structure of a process ⋮ Raiders of the lost equivalence: probabilistic branching bisimilarity ⋮ Next-preserving branching bisimulation

Cites Work

• Calculi for synchrony and asynchrony
• Algebra of communicating processes with abstraction
• On the consistency of Koomen's fair abstraction rule
• A calculus of communicating systems
• Register-machine based processes
• Process algebra for synchronous communication
• Algebraic laws for nondeterminism and concurrency
• Process Algebra
• Applications of Process Algebra
• Three logics for branching bisimulation
• Branching time and abstraction in bisimulation semantics
• The meaning of negative premises in transition system specifications
• Non-regular iterators in process algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Branching time and orthogonal bisimulation equivalence