zbMATH — the first resource for mathematics

Types and deadlock freedom in a calculus of services, sessions and pipelines. (English) Zbl 1170.68428
Meseguer, JosĂ© (ed.) et al., Algebraic methodology and software technology. 12th international conference, AMAST 2008, Urbana, IL, USA, July 28–31, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79979-5/pbk). Lecture Notes in Computer Science 5140, 100-115 (2008).
Summary: The notion of a session is fundamental in service-oriented applications, as it serves to separate interactions between clients and different instances of the same service, and to group together logical units of work. Recently, the Service Centered Calculus (SCC) has been proposed as a process calculus designed around the concept of a dyadic session between a service side and an invoker side, where interaction protocols and service orchestration can be conveniently expressed. In this paper we propose a generic type system to collect services’ behaviours and then we fix a class of well-typed processes that are guaranteed to be deadlock free, in the sense that they either diverge by invoking new service instances or reach a normal form. The type system is based on previous research on traditional mobile calculi, here conveniently extended and simplified thanks to the neat discipline imposed by the linguistic primitives of SCC.
For the entire collection see [Zbl 1154.68019].

68N30 Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Full Text: DOI