Deadlock and lock freedom in the linear π-calculus
Résumé
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 simple setting given by the linear π-calculus allows us to devise a new form of channel polymorphism that affects significantly the accuracy of the type systems, in particular with respect to recursive processes communicating in cyclic network topologies.
Origine : Fichiers produits par l'(les) auteur(s)