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
✦ LIBER ✦
On the Representation of McCarthy's amb in the π-calculus
✍ Scribed by Arnaud Carayol; Daniel Hirschkoff; Davide Sangiorgi
- Book ID
- 108126363
- Publisher
- Elsevier Science
- Year
- 2004
- Tongue
- English
- Weight
- 262 KB
- Volume
- 96
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Faithful π-nets.: A graphical representa
✍
Gabriel Ciobanu; Mihai Rotaru
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 976 KB
On the Expressive Power of Polyadic Sync
✍
Marco Carbone; Sergio Maffeis
📂
Article
📅
2002
🏛
Elsevier Science
🌐
English
⚖ 217 KB
On the decidability of fragments of the
✍
Roberto M. Amadio; Charles Meyssonnier
📂
Article
📅
2002
🏛
Elsevier Science
🌐
English
⚖ 323 KB
On the decidability of process equivalen
✍
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
On the representation theory of π-separa
✍
Geoffrey R Robinson; Reiner Staszewski
📂
Article
📅
1988
🏛
Elsevier Science
🌐
English
⚖ 376 KB
A theory of structural stationarity in t
✍
Roland Meyer
📂
Article
📅
2009
🏛
Springer-Verlag
🌐
English
⚖ 875 KB