Divide and Congruence Applied to \it eta-Bisimulation

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

doi:10.1016/j.entcs.2005.10.029

Divide and Congruence Applied to \it eta-Bisimulation

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

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

Abstract

We present congruence formats for η- and rooted η-bisimulation equivalence. These formats are derived using a method for decomposing modal formulas in process algebra. 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. © 2006 Elsevier B.V. All rights reserved.

Original language	English
Pages (from-to)	97-113
Journal	Electronic Notes in Theoretical Computer Science
Volume	156
DOIs	https://doi.org/10.1016/j.entcs.2005.10.029
Publication status	Published - 2006

Bibliographical note

DBLP:journals/entcs/FokkinkGW06
Proceedings title: Proceedings of the Second Workshop on Structural Operational Semantics (SOS 2005)
Publisher: Elsevier

UN SDGs

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

Access to Document

10.1016/j.entcs.2005.10.029

Persistent URL (handle)

Copy link address

Cite this

@article{cb424cff6ca545afa4c31c01d2aadfe7,

title = "Divide and Congruence Applied to \it eta-Bisimulation",

abstract = "We present congruence formats for η- and rooted η-bisimulation equivalence. These formats are derived using a method for decomposing modal formulas in process algebra. 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. {\textcopyright} 2006 Elsevier B.V. All rights reserved.",

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

note = "DBLP:journals/entcs/FokkinkGW06 Proceedings title: Proceedings of the Second Workshop on Structural Operational Semantics (SOS 2005) Publisher: Elsevier",

year = "2006",

doi = "10.1016/j.entcs.2005.10.029",

language = "English",

volume = "156",

pages = "97--113",

journal = "Electronic Notes in Theoretical Computer Science",

issn = "1571-0661",

publisher = "Elsevier",

}

TY - JOUR

T1 - Divide and Congruence Applied to \it eta-Bisimulation

AU - Fokkink, W.J.

AU - van Glabbeek, R.J.

AU - de Wind, P.

N1 - DBLP:journals/entcs/FokkinkGW06 Proceedings title: Proceedings of the Second Workshop on Structural Operational Semantics (SOS 2005) Publisher: Elsevier

PY - 2006

Y1 - 2006

N2 - We present congruence formats for η- and rooted η-bisimulation equivalence. These formats are derived using a method for decomposing modal formulas in process algebra. 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. © 2006 Elsevier B.V. All rights reserved.

AB - We present congruence formats for η- and rooted η-bisimulation equivalence. These formats are derived using a method for decomposing modal formulas in process algebra. 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. © 2006 Elsevier B.V. All rights reserved.

U2 - 10.1016/j.entcs.2005.10.029

DO - 10.1016/j.entcs.2005.10.029

M3 - Article

SN - 1571-0661

VL - 156

SP - 97

EP - 113

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

ER -

Divide and Congruence Applied to \it eta-Bisimulation

Abstract

Bibliographical note

UN SDGs

Access to Document

Persistent URL (handle)

Fingerprint

Cite this