Debois, Søren and Hildebrandt, Thomas and Slaats, Tijs and Yoshida, Nobuko - Type-checking Liveness for Collaborative Processes with Bounded and Unbounded Recursion

lmcs:1624 - Logical Methods in Computer Science, January 6, 2016, Volume 12, Issue 1
Type-checking Liveness for Collaborative Processes with Bounded and Unbounded Recursion

Authors: Debois, Søren and Hildebrandt, Thomas and Slaats, Tijs and Yoshida, Nobuko

We present the first session typing system guaranteeing request-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.


Source : oai:arXiv.org:1510.06658
DOI : 10.2168/LMCS-12(1:1)2016
Volume: Volume 12, Issue 1
Published on: January 6, 2016
Submitted on: November 30, 2014
Keywords: Computer Science - Logic in Computer Science


Share

Consultation statistics

This page has been seen 139 times.
This article's PDF has been downloaded 46 times.