Skip to main content

Precongruence formats with lookahead through modal decomposition


Wan Fokkink and Rob van Glabbeek


Vrije Universiteit Amsterdam

UNSW Sydney


Bloom, Fokkink & van Glabbeek (2004) presented a method to decompose formulas from Hennessy-Milner logic with regard to a structural operational semantics specification. A term in the corresponding process algebra satisfies a Hennessy-Milner formula if and only if its subterms satisfy certain formulas, obtained by decomposing the original formula. They used this decomposition method to derive congruence formats in the realm of structural operational semantics. In this paper it is shown how this framework can be extended to specifications that include bounded lookahead in their premises. This extension is used in the derivation of a congruence format for the partial trace preorder.

BibTeX Entry

    author           = {Fokkink, Wan and van Glabbeek, Rob},
    doi              = {},
    month            = aug,
    date             = {2017-8-17},
    year             = {2017},
    keywords         = {Structural Operational Semantics Congruence formats Modal Decomposition Bounded lookahead Trace
    title            = {Precongruence Formats with Lookahead through Modal Decomposition},
    series           = {Leibniz International Proceedings in Informatics (LIPIcs)},
    numpages         = {20 p.},
    volume           = {82},
    address          = {Stockholm, Sweden},
    booktitle        = {26th EACSL Annual Conference on Computer Science Logic (CSL'17)},
    paperurl         = {},
    publisher        = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}