Trustworthy Systems

Divide and congruence II: From decomposition of modal formulas to preservation of delay and weak bisimilarity

Authors

Rob van Glabbeek and Wan Fokkink

DATA61

Vrije Universiteit Amsterdam

UNSW Sydney

Abstract

Earlier we presented a method to decompose modal formulas for processes with the internal action τ, and congruence formats for branching and η-bisimilarity were derived on the basis of this decomposition method. 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. In this follow-up paper the decomposition method is enhanced to deal with modal characterisations that contain a modality <τ*a>φ, to derive congruence formats for delay and weak bisimilarity.

BibTeX Entry

  @article{vanGlabbeek_Fokkink_17,
    address          = {Berlin, Germany},
    author           = {van Glabbeek, Robert and Fokkink, Wan},
    date             = {2017-12-19},
    doi              = {https://doi.org/10.1016/j.ic.2017.10.003},
    editor           = {{Meyer, Roland \& Nestmann, Uwe}},
    issn             = {0890-5401},
    journal          = {Information and Computation},
    keywords         = {Structural Operational Semantics Congruence formats Modal logic Weak bisimilarity},
    month            = dec,
    pages            = {79-113},
    paperurl         = {https://trustworthy.systems/publications/full_text/vanGlabbeek_Fokkink_17.pdf},
    publisher        = {Elsevier},
    series           = {Leibniz International Proceedings in Informatics (LIPIcs)},
    title            = {Divide and Congruence {II}: From Decomposition of Modal Formulas to Preservation of Delay and Weak
                        Bisimilarity},
    volume           = {257},
    year             = {2017}
  }

Download