DATA61
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.
@article{vanGlabbeek_20_2, month = aug, numpages = {40}, keywords = {Concurrency; process algebra; time-outs; {CCSP}; labelled transition systems; reactive bisimulation semantics; modal characterisations; congruence; recursion; complete axiomatisations.}, publisher = {CSIRO}, paperurl = {https://trustworthy.systems/publications/csiro_full_text/vanGlabbeek_20_2.pdf}, author = {van Glabbeek, Rob}, title = {Reactive Bisimulation Semantics for a Process Algebra with Time-Outs}, year = {2020}, date = {2020-8-26} }