scientific article; zbMATH DE number 7453959
From MaRDI portal
Publication:5020941
Publication date: 7 January 2022
Full work available at URL: https://arxiv.org/abs/2008.13355
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reactive Turing machines
- Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity
- Using branching time temporal logic to synthesize synchronization skeletons
- A calculus of communicating systems
- A complete axiomatisation for observational congruence of finite-state behaviours
- When is partial trace equivalence adequate?
- Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
- Axiomatising divergence
- Up-to Techniques for Branching Bisimilarity
- Branching Bisimilarity with Explicit Divergence
- Computation Tree Logic with Deadlock Detection
- “Sometimes” and “not never” revisited
- Three logics for branching bisimulation
- Branching time and abstraction in bisimulation semantics
- An O ( m log n ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation
- Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity
