Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Deadlock and lock freedom in the linear π-calculus

Luca Padovani 1, * 
Abstract : We study two refinements of the linear π-calculus that ensure deadlock freedom (the absence of stable states with pending linear communications) and lock freedom (the eventual completion of pending linear communications). The main feature of both type systems is a new form of channel polymorphism that affects their accuracy in a significant way: they are the first of their kind that can deal with recursive processes communicating in cyclic network topologies.
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download
Contributor : Luca Padovani Connect in order to contact the contributor
Submitted on : Monday, January 20, 2014 - 1:43:13 PM
Last modification on : Monday, February 7, 2022 - 4:06:03 PM
Long-term archiving on: : Saturday, April 8, 2017 - 8:34:17 PM


Files produced by the author(s)


  • HAL Id : hal-00932356, version 2


Luca Padovani. Deadlock and lock freedom in the linear π-calculus. 2014. ⟨hal-00932356v2⟩



Record views


Files downloads