Rooted Divergence-Preserving Branching Bisimilarity is a Congruence

Rob van Glabbeek; Bas Luttik; Linda Spaninks

doi:10.23638/LMCS-16(3:14)2020

Rooted Divergence-Preserving Branching Bisimilarity is a Congruence

Rob van Glabbeek, Bas Luttik, Linda Spaninks

Research output: Contribution to journal › Article › peer-review

Abstract

We prove that rooted divergence-preserving branching bisimilarity is a congruence for the process specification language consisting of nil, action prefix, choice, and the recursion construct.

Original language	English
Article number	14
Number of pages	16
Journal	Logical Methods in Computer Science
Volume	16
Issue number	3
DOIs	https://doi.org/10.23638/LMCS-16(3:14)2020
Publication status	Published - 31 Aug 2020

Keywords / Materials (for Non-textual outputs)

Process algebra
Recursion
Branching bisimulation
Divergence
Congruence

Access to Document

10.23638/LMCS-16(3:14)2020Licence: Creative Commons: Attribution (CC-BY)

Rooted Divergence_VAN GLABBEEK_DOA15072020_VOR_CC-BYFinal published version, 385 KBLicence: Creative Commons: Attribution (CC-BY)

https://lmcs.episciences.org/6741Licence: Creative Commons: Attribution (CC-BY)

Cite this

@article{b47d92942db542d99b9783ecc129e8a4,

title = "Rooted Divergence-Preserving Branching Bisimilarity is a Congruence",

abstract = "We prove that rooted divergence-preserving branching bisimilarity is a congruence for the process specification language consisting of nil, action prefix, choice, and the recursion construct.",

keywords = "Process algebra, Recursion, Branching bisimulation, Divergence, Congruence",

author = "{van Glabbeek}, Rob and Bas Luttik and Linda Spaninks",

year = "2020",

month = aug,

day = "31",

doi = "10.23638/LMCS-16(3:14)2020",

language = "English",

volume = "16",

journal = "Logical Methods in Computer Science",

issn = "1860-5974",

publisher = "Technischen Universitat Braunschweig",

number = "3",

}

TY - JOUR

T1 - Rooted Divergence-Preserving Branching Bisimilarity is a Congruence

AU - van Glabbeek, Rob

AU - Luttik, Bas

AU - Spaninks, Linda

PY - 2020/8/31

Y1 - 2020/8/31

N2 - We prove that rooted divergence-preserving branching bisimilarity is a congruence for the process specification language consisting of nil, action prefix, choice, and the recursion construct.

AB - We prove that rooted divergence-preserving branching bisimilarity is a congruence for the process specification language consisting of nil, action prefix, choice, and the recursion construct.

KW - Process algebra

KW - Recursion

KW - Branching bisimulation

KW - Divergence

KW - Congruence

U2 - 10.23638/LMCS-16(3:14)2020

DO - 10.23638/LMCS-16(3:14)2020

M3 - Article

SN - 1860-5974

VL - 16

JO - Logical Methods in Computer Science

JF - Logical Methods in Computer Science

IS - 3

M1 - 14

ER -

Rooted Divergence-Preserving Branching Bisimilarity is a Congruence

Abstract

Keywords / Materials (for Non-textual outputs)

Access to Document

Fingerprint

Cite this