Divide and congruence : from decomposition of modal formulas to preservation of branching and eta-bisimilarity

W.J. Fokkink, R.J. Glabbeek, van, P. Wind, de

    Research output: Contribution to journalArticleAcademicpeer-review

    21 Citations (Scopus)

    Abstract

    We present a method for decomposing modal formulas for processes with the internal action t. To decide whether a process algebra term satisfies a modal formula, one can check whether its subterms satisfy formulas that are obtained by decomposing the original formula. The decomposition uses the structural operational semantics that underlies the process algebra. We use this decomposition method to derive congruence formats for two weak and rooted weak semantics: branching and ¿-bisimilarity.
    Original languageEnglish
    Pages (from-to)59-85
    JournalInformation and Computation
    Volume214
    DOIs
    Publication statusPublished - 2012

    Fingerprint Dive into the research topics of 'Divide and congruence : from decomposition of modal formulas to preservation of branching and eta-bisimilarity'. Together they form a unique fingerprint.

    Cite this