Divide and congruence. III: Stability \& divergence

DOI10.4230/LIPICS.CONCUR.2017.15zbMATH Open1442.68139OpenAlexW2757084655MaRDI QIDQ5111628FDOQ5111628

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

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 \(\eta \)-bisimilarity
• Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation

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)

Cites Work

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

Cited In (6)

• Probabilistic divide \& congruence: branching bisimilarity
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

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)