Divide and congruence. III: Stability \& divergence

DOI10.4230/LIPICS.CONCUR.2017.15MaRDI QIDQ5111628zbMATH OpenOpenAlexFDO

Authors Bas Luttik, Wan Fokkink, Rob van Glabbeek

Publication date 27 May 2020

Full work available at URL https://doi.org/10.4230/lipics.concur.2017.15

zbMATH Keywords

modal logicstructural operational semanticsweak semantics

Mathematics Subject Classification ID

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)

Recommendations

• Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
• Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity
• Divide and congruence. II: Delay and weak bisimilarity
• Divide and congruence: from decomposition of modal formulas to preservation of branching and -bisimilarity
• Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation

Cites work

• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1759617 (Why is no real title available?)
• scientific article; zbMATH DE number 4001464 (Why is no real title available?)
• Algebraic laws for nondeterminism and concurrency
• Bisimulation and divergence
• Bisimulation can't be traced
• Branching Bisimilarity with Explicit Divergence
• Branching bisimilarity is an equivalence indeed!
• Branching time and abstraction in bisimulation semantics
• Computation tree logic with deadlock detection
• Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
• Divide and congruence. II: Delay and weak bisimilarity
• Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
• Divide and congruence: from decomposition of modal formulas to preservation of branching and -bisimilarity
• Ordered SOS process languages for branching and eager bisimulations
• Precongruence formats for decorated trace semantics
• Rooted branching bisimulation as a congruence
• The meaning of negative premises in transition system specifications
• The meaning of negative premises in transition system specifications. II
• Transition system specifications with negative premises

Cited in

(7)

• Probabilistic divide \& congruence: branching bisimilarity
• SOS-based modal decomposition on nondeterministic probabilistic processes
• Sequential composition in the presence of intermediate termination (extended abstract)
• Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
• Divide and congruence. II: From decomposition of modal formulas to preservation of delay and weak bisimilarity
• Divide and congruence. II: Delay and weak bisimilarity
• scientific article; zbMATH DE number 7449995 (Why is no real title available?)

This page was built for publication: Divide and congruence. III: Stability \& divergence

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