License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2020.6
URN: urn:nbn:de:0030-drops-128181
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/12818/
van Glabbeek, Rob
Reactive Bisimulation Semantics for a Process Algebra with Time-Outs
Abstract
This paper introduces the counterpart of strong bisimilarity for labelled transition systems extended with time-out transitions. It supports this concept through a modal characterisation, congruence results for a standard process algebra with recursion, and a complete axiomatisation.
BibTeX - Entry
@InProceedings{vanglabbeek:LIPIcs:2020:12818,
author = {Rob van Glabbeek},
title = {{Reactive Bisimulation Semantics for a Process Algebra with Time-Outs}},
booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)},
pages = {6:1--6:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-160-3},
ISSN = {1868-8969},
year = {2020},
volume = {171},
editor = {Igor Konnov and Laura Kov{\'a}cs},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12818},
URN = {urn:nbn:de:0030-drops-128181},
doi = {10.4230/LIPIcs.CONCUR.2020.6},
annote = {Keywords: Process algebra, time-outs, labelled transition systems, reactive bisimulation semantics, Hennessy-Milner logic, modal characterisations, recursion, complete axiomatisations}
}
|
Keywords: |
|
Process algebra, time-outs, labelled transition systems, reactive bisimulation semantics, Hennessy-Milner logic, modal characterisations, recursion, complete axiomatisations |
|
Collection: |
|
31st International Conference on Concurrency Theory (CONCUR 2020) |
|
Issue Date: |
|
2020 |
|
Date of publication: |
|
26.08.2020 |
