Branching Bisimilarity for Processes with Time-outs
Logic in Computer Science
2024-08-20 v1
Abstract
This paper provides an adaptation of branching bisimilarity to reactive systems with time-outs. Multiple equivalent definitions are procured, along with a modal characterisation and a proof of its congruence property for a standard process algebra with recursion. The last section presents a complete axiomatisation for guarded processes without infinite sequences of unobservable actions.
Keywords
Cite
@article{arxiv.2408.10117,
title = {Branching Bisimilarity for Processes with Time-outs},
author = {Gaspard Reghem and Rob van Glabbeek},
journal= {arXiv preprint arXiv:2408.10117},
year = {2024}
}
Comments
An extended abstract of this paper appears in Proc. CONCUR'24, see https://doi.org/10.4230/LIPIcs.CONCUR.2024.36