Deciding orthogonal bisimulation

DOI10.1007/s00165-007-0023-xzbMath1131.68068OpenAlexW2061726621MaRDI QIDQ2461535

Thuy Duong Vu

Publication date: 28 November 2007

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-007-0023-x

zbMATH Keywords

Concurrency theorySilent stepBranching bisimulation equivalenceLabeled transition systemOrthogonal bisimulation equivalence

Mathematics Subject Classification ID

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

Related Items (2)

An O ( m log n ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The compression structure of a process
• Characterizing finite Kripke structures in propositional temporal logic
• A calculus of communicating systems
• Branching time and orthogonal bisimulation equivalence
• Algebraic laws for nondeterminism and concurrency
• Three Partition Refinement Algorithms
• Branching time and abstraction in bisimulation semantics

This page was built for publication: Deciding orthogonal bisimulation