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.

An extended abstract of this paper appears in the proceedings of CONCUR 2020

References in corpus (4)

• Progress, Justness and Fairness
• CCS: It's not Fair! Fair Schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions
• Analysing Mutual Exclusion using Process Algebra with Signals
• Ensuring Liveness Properties of Distributed Systems: Open Problems

Cited by in corpus (1)

• Modelling Mutual Exclusion in a Process Algebra with Time-outs