On cool congruence formats for weak bisimulations
From MaRDI portal
Publication:549196
DOI10.1016/j.tcs.2011.02.036zbMath1216.68199MaRDI QIDQ549196
Publication date: 7 July 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.02.036
structural operational semantics; CSP; concurrency; weak bisimulation; CCS; branching bisimulation; delay bisimulation; \(\eta \)-bisimulation
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity, A general account of coinduction up-to, SOS formats and meta-theory: 20 years after, Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity, Probabilistic divide \& congruence: branching bisimilarity, Ensuring liveness properties of distributed systems: open problems, Characteristic invariants in Hennessy-Milner logic, On constructibility and unconstructibility of LTS operators from other LTS operators, Notes on Generative Probabilistic Bisimulation, Weak Bisimulation as a Congruence in MSOS, Up-to Techniques for Branching Bisimilarity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Structural operational semantics for weak bisimulations
- Specification-oriented semantics for communicating processes
- Algebra of communicating processes with abstraction
- Higher-level synchronising devices in Meije-SCCS
- Turning SOS rules into equations
- Branching bisimilarity is an equivalence indeed!
- Ordered SOS process languages for branching and eager bisimulations
- A structural approach to operational semantics
- Rooted branching bisimulation as a congruence
- Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
- A Theory of Communicating Sequential Processes
- Bisimulation can't be traced
- Branching time and abstraction in bisimulation semantics
- Processes, Terms and Cycles: Steps on the Road to Infinity