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
Pages (from-to)	11-57
Number of pages	47
Journal	Acta Informatica
Volume	60
Issue number	1
Early online date	8 Apr 2022
DOIs	https://doi.org/10.1007/s00236-022-00417-1
Publication status	Published - 1 Mar 2023

Access to Document

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

Reactive bisimulation_VAN GLABBEEK_DOA06022022_VOR_CC-BYFinal published version, 867 KBLicence: Creative Commons: Attribution (CC-BY)

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

1 Conference contribution

Reactive bisimulation semantics for a process algebra with time-outs
van Glabbeek, R. J., 26 Aug 2020, Proceedings 31st International Conference on Concurrency Theory (CONCUR '20). Konnov, I. & Kovács, L. (eds.). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 171. p. 6:1-6:23 23 p. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 171).
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Open Access
File

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 = "2023",

month = mar,

day = "1",

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

language = "English",

volume = "60",

pages = "11--57",

journal = "Acta Informatica",

issn = "1432-0525",

publisher = "Springer",

number = "1",

}

TY - JOUR

T1 - Reactive bisimulation semantics for a process algebra with timeouts

AU - van Glabbeek, Rob

PY - 2023/3/1

Y1 - 2023/3/1

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

SN - 1432-0525

VL - 60

SP - 11

EP - 57

JO - Acta Informatica

JF - Acta Informatica

IS - 1

ER -

Reactive bisimulation semantics for a process algebra with timeouts

Abstract

Access to Document

Fingerprint

Research output

Reactive bisimulation semantics for a process algebra with time-outs

Cite this