Divide and Congruence III: Stability & Divergence

Wan Fokkink, Rob van Glabbeek, Bas Luttik

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

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 tau-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 tau-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)
EditorsRoland Meyer, Uwe Nestmann
Place of PublicationDagstuhl, Germany
PublisherSchloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany
Number of pages16
ISBN (Electronic)978-3-95977-048-4
Publication statusPublished - 1 Sept 2017

Publication series

NameLeibniz International Proceedings in Informatics (LIPIcs)
PublisherSchloss Dagstuhl--Leibniz-Zentrum fuer Informatik
ISSN (Electronic)1868-8969

Keywords / Materials (for Non-textual outputs)

  • Structural Operational Semantics
  • Weak Semantics
  • Modal Logic


Dive into the research topics of 'Divide and Congruence III: Stability & Divergence'. Together they form a unique fingerprint.

Cite this