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

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

doi:10.1016/j.ic.2011.10.011

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

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

Research output: Contribution to Journal › Article › Academic › peer-review

Abstract

We present a method for decomposing modal formulas for processes with the internal action τ. 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. © 2012 Elsevier Inc. All rights reserved.

Original language	English
Pages (from-to)	59-85
Journal	Information and Computation
Volume	214
DOIs	https://doi.org/10.1016/j.ic.2011.10.011
Publication status	Published - 2012

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 16 Peace, Justice and Strong Institutions

Access to Document

10.1016/j.ic.2011.10.011

Persistent URL (handle)

Persistent link

Cite this

@article{827e0488e5fa4be7944b30ff9e4c0a70,

title = "Divide and congruence: From decomposition of modal formulas to preservation of branching and eta-bisimilarity",

abstract = "We present a method for decomposing modal formulas for processes with the internal action τ. 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. {\textcopyright} 2012 Elsevier Inc. All rights reserved.",

author = "W.J. Fokkink and \{van Glabbeek\}, R.J. and \{de Wind\}, P.",

year = "2012",

doi = "10.1016/j.ic.2011.10.011",

language = "English",

volume = "214",

pages = "59--85",

journal = "Information and Computation",

issn = "0890-5401",

publisher = "Elsevier Inc.",

}

TY - JOUR

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

AU - Fokkink, W.J.

AU - van Glabbeek, R.J.

AU - de Wind, P.

PY - 2012

Y1 - 2012

N2 - We present a method for decomposing modal formulas for processes with the internal action τ. 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. © 2012 Elsevier Inc. All rights reserved.

AB - We present a method for decomposing modal formulas for processes with the internal action τ. 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. © 2012 Elsevier Inc. All rights reserved.

UR - https://www.scopus.com/pages/publications/84857420395

UR - https://www.scopus.com/pages/publications/84857420395#tab=citedBy

U2 - 10.1016/j.ic.2011.10.011

DO - 10.1016/j.ic.2011.10.011

M3 - Article

SN - 0890-5401

VL - 214

SP - 59

EP - 85

JO - Information and Computation

JF - Information and Computation

ER -

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

Abstract

UN SDGs

Access to Document

Persistent URL (handle)

Other files and links

Fingerprint

Cite this