[Paper Review] Failure Trace Semantics for a Process Algebra with Time-outs

Rob van Glabbeek|arXiv (Cornell University)|Feb 25, 2020

Formal Methods in Verification22 references4 citations

TL;DR

This paper extends untimed process algebras with a time-out operator to model finite, unquantified delays in system states, using a new time-out transition that is unobservable and instantaneous. It shows that failure trace semantics is the coarsest congruence for this extension, preserving safety properties and refining may testing semantics.

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.

Motivation & Objective

• To resolve the philosophical and technical ambiguity in untimed process algebras about how time progresses during system execution.
• To model finite, unquantified delays in system states as time-out transitions, distinct from internal (τ) actions.
• To establish a semantic equivalence that is a precongruence for all static CCSP operators and respects basic safety properties.
• To characterize the coarsest such equivalence as partial failure trace preorder, and its converse as the may-testing preorder.
• To lay the foundation for future work on recursion, complete axiomatizations, and liveness properties in the extended model.

Proposed method

• Introduces a new time-out transition (t) that is unobservable and occurs after a finite, unquantified delay in a state.
• Models time-consuming activities as a two-state construction: a state s₁ where work is done, followed by a t-transition to s₂, where visible actions occur.
• Extends standard CCSP with a time-out prefixing operator t.−, allowing processes to express waiting for a time-out.
• Defines failure trace semantics as the combination of traces and failures, where failures capture unobservable choices.
• Proves that the partial failure trace preorder is the coarsest precongruence that respects safety properties and is closed under static operators.
• Uses duality with may testing: the converse of the failure trace preorder corresponds to the may-testing preorder.

Experimental results

Research questions

• RQ1 How can finite, unquantified delays in system states be formally modeled within untimed process algebras?
• RQ2 What semantic equivalence is a precongruence for the extended CCSP with time-out operators and preserves safety properties?
• RQ3 How does the addition of time-out transitions affect the congruence properties of standard preorders like trace and failures equivalence?
• RQ4 Can failure trace semantics serve as the canonical equivalence for the extended model, and how does it relate to may testing?
• RQ5 Is the time-out extension sufficient to explain the shift from failures semantics to failure trace semantics in Timed CSP, independent of time quantification?

Key findings

• The addition of time-out transitions breaks the precongruence property of weak partial trace inclusion, necessitating a stronger equivalence.
• Failure trace semantics is the coarsest preorder that is a precongruence for static CCSP operators and respects basic safety properties.
• The converse of the partial failure trace preorder corresponds exactly to the may-testing preorder, establishing a duality between safety and liveness in the extended model.
• The time-out transition t is unobservable and instantaneous, modeling the end of an abstracted, time-consuming activity without quantifying time.
• The model remains within untimed process algebra, with time progress abstracted as nondeterministic choice over unquantified delays.
• The work provides a foundation for extending the theory to recursion, complete failure traces, and full abstraction, with potential connections to Timed CSP.