Faithful π-nets.: A graphical representation of the asynchronous π-calculus

✍ Scribed by Gabriel Ciobanu; Mihai Rotaru

• Publisher: Elsevier Science
• Year: 1998
• Tongue: English
• Weight: 976 KB
• Volume: 18
• Category: Article
• ISSN: 1571-0661
• DOI: 10.1016/s1571-0661(05)80248-8

✦ Synopsis

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 translations draw and write from the -calculus to the faithful -nets, and back. Operational correspondence results are given for both translations. For every faithful -net G without isolated nodes, and for every -term P , draw(write (G)) = G and write(draw (P )) P .