Divide and congruence III: Stability & divergence
From MaRDI portal
Publication:5111628
DOI10.4230/LIPIcs.CONCUR.2017.15zbMath1442.68139OpenAlexW2757084655MaRDI QIDQ5111628
Bas Luttik, Robert J. van Glabbeek, W. J. Fokkink
Publication date: 27 May 2020
Full work available at URL: https://doi.org/10.4230/lipics.concur.2017.15
Modal logic (including the logic of norms) (03B45) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity, Unnamed Item, Unnamed Item, Probabilistic divide \& congruence: branching bisimilarity, Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence, Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity
- Transition system specifications with negative premises
- Bisimulation and divergence
- Branching bisimilarity is an equivalence indeed!
- Ordered SOS process languages for branching and eager bisimulations
- The meaning of negative premises in transition system specifications. II
- Rooted branching bisimulation as a congruence
- Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
- Branching Bisimilarity with Explicit Divergence
- Computation Tree Logic with Deadlock Detection
- Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
- Algebraic laws for nondeterminism and concurrency
- Bisimulation can't be traced
- Branching time and abstraction in bisimulation semantics
- The meaning of negative premises in transition system specifications
- Divide and Congruence II
- Precongruence formats for decorated trace semantics
