𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the decidability of fragments of the asynchronous π-calculus

✍ Scribed by Roberto M. Amadio; Charles Meyssonnier

Book ID
108498194
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
323 KB
Volume
52
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the decidability of process equivalen
On the decidability of process equivalences for the π-calculus
✍ Mads Dam 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 994 KB

We present general results for showing process equivalences applied to the finite control fragment of the z-calculus decidable. Firstly, a Finite Reachability Theorem states that up to finite name spaces and up to a static normalisation procedure, the set of reachable agent expressions is finite. Se

Faithful π-nets.: A graphical representa
Faithful π-nets.: A graphical representation of the asynchronous π-calculus
✍ Gabriel Ciobanu; Mihai Rotaru 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 976 KB

Starting from the -nets de ned by Milner, we present a graphical formalism called faithful -nets. The aim of these nets is to provide a graphical form to the systems with dynamically changing con gurations. The faithful -nets correspond precisely to the -calculus. The paper gives two fully abstract