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.
- Publication:
-
arXiv e-prints
- Pub Date:
- August 2020
- DOI:
- 10.48550/arXiv.2008.11499
- arXiv:
- arXiv:2008.11499
- Bibcode:
- 2020arXiv200811499V
- Keywords:
-
- Computer Science - Logic in Computer Science;
- F.1.2
- E-Print:
- An extended abstract of this paper appears in the proceedings of CONCUR 2020