Timed $$\pi $$-Calculus

Saeedloei, Neda; Gupta, Gopal

doi:10.1007/978-3-319-05119-2_8

Cited by 12 publications

(7 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Session types and process calculi. In addition to the work on timed multiparty session types Neykova et al 2014], time has been introduced into the π -calculus (see, for example, Saeedloei and Gupta [2014]) or session-based communication primitives (see, for example, López et al [2009]) but generally these works do not develop a type system. Kobayashi [2002] extends a (synchronous) πcalculus with means to count parallel reduction steps.…”

Section: :16mentioning

confidence: 99%

Parallel complexity analysis with temporal session types

Das

Hoffmann

Pfenning

2018

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

We study the problem of parametric parallel complexity analysis of concurrent, message-passing programs. To make the analysis local and compositional, it is based on a conservative extension of binary session types, which structure the type and direction of communication between processes and stand in a Curry-Howard correspondence with intuitionistic linear logic. The main innovation is to enrich session types with the temporal modalities next ( A), always (✷A), and eventually (✸A), to additionally prescribe the timing of the exchanged messages in a way that is precise yet flexible. The resulting temporal session types uniformly express properties such as the message rate of a stream, the latency of a pipeline, the response time of a concurrent queue, or the span of a fork/join parallel program. The analysis is parametric in the cost model and the presentation focuses on communication cost as a concrete example. The soundness of the analysis is established by proofs of progress and type preservation using a timed multiset rewriting semantics. Representative examples illustrate the scope and usability of the approach.

show abstract

Section: :16mentioning

confidence: 99%

Parallel complexity analysis with temporal session types

Das

Hoffmann

Pfenning

2018

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

show abstract

“…Several timed calculi have been introduced outside the context of behavioural 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].…”

Section: Conclusion and Related Workmentioning

confidence: 99%

Asynchronous Timed Session Types

Bocchi

Murgia

Vasconcelos

et al. 2019

Programming Languages and Systems

View full text Add to dashboard Cite

We present a behavioural typing system for a higher-order timed calculus using session types to model timed protocols. Behavioural typing ensures that processes in the calculus perform actions in the timewindows prescribed by their protocols. We introduce duality and subtyping for timed asynchronous session types. Our notion of duality allows typing a larger class of processes with respect to previous proposals. Subtyping is critical for the precision of our typing system, especially in the presence of session delegation. The composition of dual (timed asynchronous) types enjoys progress when using an urgent receive semantics, in which receive actions are executed as soon as the expected message is available. Our calculus increases the modelling power of extant calculi on timed sessions, adding a blocking receive primitive with timeout and a primitive that consumes an arbitrary amount of time in a given range.

show abstract

“…1. Timed pi-Calculus [3]: It is the timed version of the existing pi-Calculus [4], which expresses process movements indirectly by using the notion of value passing. It allows time-stamp and clock to be passed additionally during value passing, with which the temporal requirements of the process movements can be specified.…”

Section: Introductionmentioning

confidence: 99%

dT-Calculus: A Formal Method to Specify Distributed Mobile Real-Time IoT Systems

Lee¹,

Choe²,

Lee³

2018

Internet of Things - Technology, Applications and Standardization

View full text Add to dashboard Cite

In general, process algebra can be the most suitable formal method to specify IoT systems due to the equivalent notion of processes as things. However there are some limitations for distributed mobile real-time IoT systems. For example, Timed pi-Calculus has capability of specifying time property, but is lack of direct specifying both execution time of action and mobility of process at the same time. And d-Calculus has capability of specifying mobility of process itself, but is lack of specifying various time properties of both action and process, such as, ready time, timeout, execution time, deadline, as well as priority and repetition. In order to overcome the limitations, this paper presents a process algebra, called, dT-Calculus, extended from d-Calculus, by providing with capability of specifying the set of time properties, as well as priority and repetition. Further the method is implemented as a tool, called SAVE, on ADOxx meta-modeling platform. It can be considered one of the most practical and innovative approaches to specify distributed mobile real-time IoT systems.

show abstract

Timed $$\pi $$-Calculus

Cited by 12 publications

References 4 publications

Parallel complexity analysis with temporal session types

Parallel complexity analysis with temporal session types

Asynchronous Timed Session Types

dT-Calculus: A Formal Method to Specify Distributed Mobile Real-Time IoT Systems

Contact Info

Product

Resources

About