Branching Bisimilarity with Explicit Divergence

DOI10.3233/FI-2009-109MaRDI QIDQ3398965zbMATH OpenOpenAlexFDO

Authors Bas Luttik, Nikola Trčka, Rob van Glabbeek

Publication date 29 September 2009

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2009-109

zbMATH Keywords

divergencebranching bisimulation

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Temporal logic (03B44) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Logics for bisimulation and divergence
• Branching bisimulation games
• Branching bisimilarity is an equivalence indeed!
• Three logics for branching bisimulation
• Branching time and abstraction in bisimulation semantics

Cited in

(33)

• Reactive Turing machines
• Reactive Turing machines
• scientific article; zbMATH DE number 7449994 (Why is no real title available?)
• To compose, or not to compose, that is the question: an analysis of compositional state space generation
• Decomposing monolithic processes in a process algebra with multi-actions
• scientific article; zbMATH DE number 7327941 (Why is no real title available?)
• Folk Theorems on the Correspondence between State-Based and Event-Based Systems
• Probabilistic may/must testing: retaining probabilities by restricted schedulers
• Off-the-shelf automated analysis of liveness properties for just paths
• On the executability of interactive computation
• scientific article; zbMATH DE number 7243676 (Why is no real title available?)
• scientific article; zbMATH DE number 7269247 (Why is no real title available?)
• Sharp congruences adequate with temporal logics combining weak and strong modalities
• Logics for bisimulation and divergence
• Sequential composition in the presence of intermediate termination (extended abstract)
• Branching bisimulation games
• Correct and efficient antichain algorithms for refinement checking
• Characteristic invariants in Hennessy-Milner logic
• The \(\pi\)-calculus is behaviourally complete and orbit-finitely executable
• A thesis for interaction
• Counting nondeterministic computations
• Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
• Divide and congruence. III: Stability \& divergence
• On the probabilistic bisimulation spectrum with silent moves
• Distinguishing and relating higher-order and first-order processes by expressiveness
• Decomposing monolithic processes in a process algebra with multi-actions
• scientific article; zbMATH DE number 7453959 (Why is no real title available?)
• Rooted divergence-preserving branching bisimilarity is a congruence: a simpler proof
• A defense of branching quantification
• Ensuring liveness properties of distributed systems: open problems
• Cartesian difference categories
• Theory of interaction
• Next-preserving branching bisimulation

This page was built for publication: Branching Bisimilarity with Explicit Divergence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3398965)