Reactive Bisimulation Semantics for a Process Algebra with Time-Outs
Logic in Computer Science
2023-01-25 v2
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.
Cite
@article{arxiv.2008.11499,
title = {Reactive Bisimulation Semantics for a Process Algebra with Time-Outs},
author = {Rob van Glabbeek},
journal= {arXiv preprint arXiv:2008.11499},
year = {2023}
}
Comments
An extended abstract of this paper appears in the proceedings of CONCUR 2020