From Causal Semantics To Duration Timed Models

The interleaving semantics is not compatible with both action refinement and durational actions. Since many true concurrency semantics are congruent w.r.t. action refinement, notably the causality and the maximality ones, this has challenged us to study the dense time behavior - where the actions are of arbitrary fixed duration - within the causality semantics of Da Costa. We extend the causal transition systems with the clocks and the timed constraints, and thus we obtain an over class of timed automata where the actions need not to be atomic. We define a real time extension of the formal description technique CSP, called duration-CSP, by attributing the duration to actions. We give the operational timed causal semantics of duration-CSP as well as its denotational semantics over the class of timed causal transition systems. Afterwards, we prove that the two semantics are equivalent. Finally we extend the duration-CSP language with a refinement operator $\rho$ - that allows to replace an action with a process - and prove that it preserves the timed causal bisimulation.

💡 Research Summary

The paper addresses a fundamental mismatch between traditional interleaving semantics and the needs of modern concurrent system design, namely the ability to refine actions and to model actions that have non‑zero, fixed durations. While interleaving semantics treats actions as instantaneous and therefore cannot naturally accommodate both refinement and durational behavior, several true‑concurrency semantics—particularly causality‑based and maximality‑based semantics—are known to be congruent with respect to action refinement. This observation motivates the authors to explore a dense‑time setting where actions may last for an arbitrary but fixed amount of time, while preserving the causal relationships among events.

To achieve this, the authors extend Da Costa’s causal transition systems (CTS) by adding a set of clocks and linear timed constraints to each transition. A transition is now labelled with a quadruple (a, d, ρ, φ) where a is the action name, d is its prescribed duration, ρ is the set of clocks to be reset when the transition fires, and φ is a conjunction of clock inequalities that must hold for the transition to be enabled. The state of the system therefore consists of a CTS control location together with a valuation of all clocks. The operational effect of a transition is to reset the designated clocks, let time elapse while the constraints remain satisfied, and finally move to the target location when the elapsed time equals the specified duration. This construction yields a class of timed automata that relaxes the usual atomicity assumption: several durational actions may overlap, and their mutual causality is captured explicitly.

On top of this timed CTS foundation the authors define a real‑time extension of CSP called duration‑CSP. The syntax augments every basic action a with an explicit duration annotation ⟨d⟩, yielding constructs such as a⟨d⟩ → P. All standard CSP operators (choice, parallel composition, hiding, recursion, etc.) are retained, but their semantics now respect the duration information. For example, the parallel operator ‖ combines the clock sets of its operands and requires that the time constraints of both components be satisfied simultaneously; the choice operator □ allows the system to follow whichever branch becomes enabled first, taking into account the elapsed time of each pending action.

The paper provides two complementary semantics for duration‑CSP. The operational semantics is given directly on the extended CTS: each syntactic construct is translated into a set of timed causal transitions, with precise rules for clock resetting, constraint propagation, and time advancement. The denotational semantics maps a duration‑CSP term to a timed causal transition system that records, for every possible execution, the sequence of actions together with their start and end timestamps, preserving the causal partial order. To relate the two, the authors introduce a notion of timed causal bisimulation, a relation that matches states of the operational CTS with states of the denotational CTS while respecting both the causal ordering and the clock constraints. By a structural induction on process terms they prove that the operational and denotational semantics are equivalent under this bisimulation.

A further contribution is the refinement operator ρ. The construct ρ(P, a, Q) replaces every occurrence of action a in process P with the process Q, where Q itself may contain durational actions and its own clock constraints. The authors show that this operator is a congruence for the timed causal bisimulation: after applying ρ, the resulting system remains bisimilar to the original one with the action a abstractly represented, provided Q respects the same duration and timing constraints as a. This result guarantees that designers can safely replace high‑level actions by more detailed implementations without breaking the established timed causal equivalence.

In summary, the paper makes three major technical advances: (1) it enriches causal transition systems with clocks and timed constraints, thereby defining a new class of non‑atomic timed automata; (2) it introduces duration‑CSP, a CSP‑like language where actions carry explicit durations, and establishes the equivalence of its operational and denotational semantics via timed causal bisimulation; and (3) it adds a refinement operator that preserves this bisimulation, enabling hierarchical design and stepwise refinement in a real‑time, true‑concurrency setting. The work thus provides a solid theoretical foundation for modeling, analyzing, and refining real‑time concurrent systems where both causality and action duration are first‑class concerns.