JUCS - Journal of Universal Computer Science 6(1): 39-59, doi: 10.3217/jucs-006-01-0039
A Pi-Calculus Machine
expand article infoGabriel Ciobanu‡, Mihai Rotaru§
‡ Department of Computer Science, Iasi, Romania§ Institute of Theoretical Computer Science, Romanian Academy, Iasi, Romania

Corresponding author: Gabriel Ciobanu ( gabriel@infoiasi.ro )

© Gabriel Ciobanu, Mihai Rotaru.
This article is freely available under the J.UCS Open Content License.
Citation: Ciobanu G, Rotaru M (2000) A Pi-Calculus Machine. JUCS - Journal of Universal Computer Science 6(1): 39-59. https://doi.org/10.3217/jucs-006-01-0039
Open Access
Abstract
In this paper we investigate the -calculus guards, proposing a formalism which use exclusively machine tradition concepts: state, resource, transition. The reduction mechanism is similar to the token-game of Petri nets. We provide a multiset semantics for the -calculus by using this formalism. Moreover, our machines have a graphical representation which emphasizes their structure. As a consequence, we give a new improved graphical representation for the asynchronous -calculus. 1 C.S.Calude and G.Stefanescu (eds.). Automata, Logic, and Computability. Special issue dedicated to Professor Sergiu Rudeanu Festschrift.
Keywords
abstract machine, concurrent processes, -calculus, multiset semantics, nets, graphical representation of processes