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

branching bisimulationdivergence

Mathematics Subject Classification ID

Temporal logic (03B44) Modal logic (including the logic of norms) (03B45) 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

(38)

• A defense of branching quantification
• Branching bisimilarity is an equivalence indeed!
• Logics for bisimulation and divergence
• Distinguishing and relating higher-order and first-order processes by expressiveness
• Probabilistic may/must testing: retaining probabilities by restricted schedulers
• Ensuring liveness properties of distributed systems: open problems
• To compose, or not to compose, that is the question: an analysis of compositional state space generation
• Counting nondeterministic computations
• A thesis for interaction
• On the probabilistic bisimulation spectrum with silent moves
• Off-the-shelf automated analysis of liveness properties for just paths
• Characteristic invariants in Hennessy-Milner logic
• Cartesian difference categories
• Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
• Next-preserving branching bisimulation
• Decomposing monolithic processes in a process algebra with multi-actions
• Branching bisimulation games
• Folk Theorems on the Correspondence between State-Based and Event-Based Systems
• Reactive Turing machines
• On the executability of interactive computation
• Distribution of behaviour into parallel communicating subsystems
• Reactive Turing machines
• Sequential composition in the presence of intermediate termination (extended abstract)
• scientific article; zbMATH DE number 7453959 (Why is no real title available?)
• Divide and congruence. III: Stability \& divergence
• 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
• scientific article; zbMATH DE number 7327941 (Why is no real title available?)
• The \(\pi\)-calculus is behaviourally complete and orbit-finitely executable
• Rooted divergence-preserving branching bisimilarity is a congruence: a simpler proof
• Correct and efficient antichain algorithms for refinement checking
• Decomposing monolithic processes in a process algebra with multi-actions
• Positive Hennessy-Milner logic for branching bisimulation
• Parallel pushdown automata and commutative context-free grammars in bisimulation semantics (extended abstract)
• Rooted divergence-preserving branching bisimilarity is a congruence for guarded CCS
• Unified bisimulation applied to incremental abstraction of Petri nets
• Theory of interaction

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)