Reactive bisimulation semantics for a process algebra with timeouts

Rob van Glabbeek

doi:10.1007/s00236-022-00417-1

Reactive bisimulation semantics for a process algebra with timeouts

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

Abstract

This paper introduces the counterpart of strong bisimilarity for labelled transition systems extended with timeout transitions. It supports this concept through a modal characterisation, congruence results for a standard process algebra with recursion, and a complete axiomatisation.

Original language	English
Number of pages	47
Journal	Acta Informatica
Early online date	8 Apr 2022
DOIs	https://doi.org/10.1007/s00236-022-00417-1
Publication status	E-pub ahead of print - 8 Apr 2022

Access to Document

10.1007/s00236-022-00417-1Licence: Creative Commons: Attribution (CC-BY)

Reactive Bisimulation_VAN GLABBEEK_VOR_CC-BYFinal published version, 879 KBLicence: Creative Commons: Attribution (CC-BY)

https://link.springer.com/article/10.1007/s00236-022-00417-1Licence: Creative Commons: Attribution (CC-BY)

Cite this

@article{10490eb516834dfcad5c2667e0d3f37a,

title = "Reactive bisimulation semantics for a process algebra with timeouts",

abstract = "This paper introduces the counterpart of strong bisimilarity for labelled transition systems extended with timeout transitions. It supports this concept through a modal characterisation, congruence results for a standard process algebra with recursion, and a complete axiomatisation.",

author = "{van Glabbeek}, Rob",

note = "Publisher Copyright: {\textcopyright} 2022, The Author(s).",

year = "2022",

month = apr,

day = "8",

doi = "10.1007/s00236-022-00417-1",

language = "English",

journal = "Acta Informatica",

issn = "0001-5903",

publisher = "Springer New York",

}

TY - JOUR

T1 - Reactive bisimulation semantics for a process algebra with timeouts

AU - van Glabbeek, Rob

PY - 2022/4/8

Y1 - 2022/4/8

N2 - This paper introduces the counterpart of strong bisimilarity for labelled transition systems extended with timeout transitions. It supports this concept through a modal characterisation, congruence results for a standard process algebra with recursion, and a complete axiomatisation.

AB - This paper introduces the counterpart of strong bisimilarity for labelled transition systems extended with timeout transitions. It supports this concept through a modal characterisation, congruence results for a standard process algebra with recursion, and a complete axiomatisation.

U2 - 10.1007/s00236-022-00417-1

DO - 10.1007/s00236-022-00417-1

M3 - Article

JO - Acta Informatica

JF - Acta Informatica

SN - 0001-5903

ER -

Reactive bisimulation semantics for a process algebra with timeouts

Abstract

Access to Document

Fingerprint

Cite this