Trustworthy Systems

Reactive bisimulation semantics for a process algebra with time-outs


Rob van Glabbeek


UNSW Sydney


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

    address          = {Online},
    author           = {van Glabbeek, Robert},
    booktitle        = {31st International Conference on Concurrency Theory (CONCUR 20)},
    date             = {2020-8-27},
    doi              = {},
    editor           = {{Igor Konnov and Laura Kov\'{a}cs}},
    keywords         = {Concurrency; process algebra; time-outs; {CCSP}; labelled transition systems; reactive bisimulation
                        semantics; modal characterisations; congruence; recursion; complete axiomatisations.},
    month            = aug,
    pages            = {6:1-6:23},
    paperurl         = {},
    publisher        = {Schloss Dagstuhl---Leibniz-Zentrum f\"{u}r Informatik},
    series           = {Leibniz International Proceedings in Informatics (LIPIcs) 171},
    title            = {Reactive Bisimulation Semantics for a Process Algebra with Time-Outs},
    volume           = {171},
    year             = {2020}