Failure Trace Semantics for a Process Algebra with Time-outs

Research output: Contribution to journalArticlepeer-review

Abstract / Description of output

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.

Original languageEnglish
Article number11
Number of pages40
JournalLogical Methods in Computer Science
Volume17
Issue number2
DOIs
Publication statusPublished - 23 Apr 2021

Keywords / Materials (for Non-textual outputs)

  • Concurrency
  • process algebra
  • time-outs
  • priority
  • CCSP
  • labelled transition systems
  • semantic equivalences
  • linear time
  • branching time
  • failure trace semantics
  • absolute expressiveness
  • full abstraction
  • safety properties
  • may testing

Fingerprint

Dive into the research topics of 'Failure Trace Semantics for a Process Algebra with Time-outs'. Together they form a unique fingerprint.

Cite this