A New Time Extension to π-Calculus Based on Time Consuming Transition Semantics

Asynchronous Timed Session Types

“…The work in [32] extends the π-calculus with time primitives inspired in CTA and is closer, in principle, to our types than our processes. Another timed extension of the π-calculus with time-consuming actions has been applied to the analysis the active times of processes [18]. Some works focus on specific aspects of timed behaviour, such as timeouts [9], transactions [24,27], and services [25].…”

Timed Multiparty Session Types

“…Calculi with time. Recent work proposes calculi with time, for example: [19] includes time constraints inspired by timed automata into the π-calculus, [5,17] add timeouts, [12] analyses the active times of processes, and [15] for service-oriented systems. The aim of our work is different from the work above: we use timed specifications as types to check time properties of the interactions, rather than enriching the π-calculus syntax with time primitives and reason on examples using timed LTS (or check channels linearity as [5]).…”

“…They are both inspired by the notion of times in [5] and, whereas Web-π focuses on orchestrations of asynchronous services, C 3 focuses on multiparty conversations in a synchronous scenario. [12] introduces a (dense-time) calculus with a time guard construct [t min ,t max ] specifying a range for the delay for reaching the next state. The authors define a timed labelled transitions systems (TLTS) and a system of equations returning the times in which a process is active.…”