We present the first session typing system guaranteeing response liveness properties for possibly non-terminating communicating processes. The types augment the branch and select types of the standard binary session types with a set of required responses, indicating that whenever a particular label is selected, a set of other labels, its responses, must eventually also be selected. We prove that these extended types are strictly more expressive than standard session types. We provide a type system for a process calculus similar to a subset of collaborative BPMN processes with internal (data-based) and external (event-based) branching, message passing, bounded and unbounded looping. We prove that this type system is sound, i.e., it guarantees request-response liveness for dead-lock free processes. We exemplify the use of the calculus and type system on a concrete example of an infinite state system. © 2014 IFIP International Federation for Information Processing.
CITATION STYLE
Debois, S., Hildebrandt, T., Slaats, T., & Yoshida, N. (2014). Type checking liveness for collaborative processes with bounded and unbounded recursion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8461 LNCS, pp. 1–16). Springer Verlag. https://doi.org/10.1007/978-3-662-43613-4_1
Mendeley helps you to discover research relevant for your work.