Deadlock and lock freedom in the linear π-calculus - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year :

Deadlock and lock freedom in the linear π-calculus

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.
Fichier principal
Vignette du fichier
main.pdf (565.7 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00932356 , version 1 (16-01-2014)
hal-00932356 , version 2 (20-01-2014)

Identifiers

  • HAL Id : hal-00932356 , version 2

Cite

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

Share

Gmail Facebook Twitter LinkedIn More