Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Abstract : 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.
https://hal.inria.fr/hal-01398004 Contributor : Hal IfipConnect in order to contact the contributor Submitted on : Wednesday, November 16, 2016 - 3:32:44 PM Last modification on : Tuesday, January 18, 2022 - 2:26:05 PM Long-term archiving on: : Thursday, March 16, 2017 - 5:36:36 PM
Søren Debois, Thomas Hildebrandt, Tijs Slaats, Nobuko yoshida. Type Checking Liveness for Collaborative Processes with Bounded and Unbounded Recursion. 34th Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2014, Berlin, Germany. pp.1-16, ⟨10.1007/978-3-662-43613-4_1⟩. ⟨hal-01398004⟩