Failure Trace Semantics for a Process Algebra with Time-outs
Logic in Computer Science
2023-06-22 v5
Abstract
This paper extends a standard process algebra with a time-out operator, thereby increasing its absolute expressiveness, while remaining within the realm of untimed process algebra, in the sense that the progress of time is not quantified. Trace and failures equivalence fail to be congruences for this operator; their congruence closure is characterised as failure trace equivalence.
Keywords
Cite
@article{arxiv.2002.10814,
title = {Failure Trace Semantics for a Process Algebra with Time-outs},
author = {Rob van Glabbeek},
journal= {arXiv preprint arXiv:2002.10814},
year = {2023}
}