Failure Trace Semantics for a Process Algebra with Time-outs

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 thi...

Full description

Saved in:
Bibliographic Details
Published inLogical methods in computer science Vol. 17, Issue 2
Main Author Rob van Glabbeek
Format Journal Article
LanguageEnglish
Published Logical Methods in Computer Science e.V 01.01.2021
Subjects
computer science - logic in computer science
f.1.2
f.3.2
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:1860-5974
DOI:10.23638/LMCS-17(2:11)2021