Skip to Main content Skip to Navigation

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 metadatas

Cited literature [26 references]  Display  Hide  Download

https://hal.inria.fr/hal-00932356
Contributor : Luca Padovani <>
Submitted on : Monday, January 20, 2014 - 1:43:13 PM
Last modification on : Monday, January 20, 2014 - 2:00:37 PM
Document(s) archivé(s) le : Saturday, April 8, 2017 - 8:34:17 PM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00932356, version 2

Citation

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

Share

Metrics

Record views

407

Files downloads

685