Divide and congruence III: stability & divergence

W. Fokkink, R. van Glabbeek, B. Luttik

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

8 Citations (Scopus)
32 Downloads (Pure)


In two earlier papers we derived congruence formats for weak semantics on the basis of a decomposition method for modal formulas. The idea is that a congruence format for a semantics must ensure that the formulas in the modal characterisation of this semantics are always decomposed into formulas that are again in this modal characterisation. Here this work is extended with important stability and divergence requirements. Stability refers to the absence of a τ - transition. We show, using the decomposition method, how congruence formats can be relaxed for weak semantics that are stability-respecting. Divergence, which refers to the presence of an infinite sequence of τ -transitions, escapes the inductive decomposition method. We circumvent this problem by proving that a congruence format for a stability-respecting weak semantics is also a congruence format for its divergence-preserving counterpart.

Original languageEnglish
Title of host publication28th International Conference on Concurrency Theory, CONCUR 2017
Place of PublicationDagstuhl
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Number of pages16
ISBN (Electronic)978-3-95977-048-4
Publication statusPublished - 1 Aug 2017
Event28th International Conference on Concurrency Theory, CONCUR 2017 - Berlin, Germany
Duration: 5 Sep 20178 Sep 2017


Conference28th International Conference on Concurrency Theory, CONCUR 2017


  • Modal Logic
  • Structural Operational Semantics
  • Weak Semantics


Dive into the research topics of 'Divide and congruence III: stability & divergence'. Together they form a unique fingerprint.

Cite this