Go home now Header Background Image
Submission Procedure
share: |
Follow us
Volume 6 / Issue 1

available in:   PDF (303 kB) PS (131 kB)
Similar Docs BibTeX   Write a comment
Links into Future
DOI:   10.3217/jucs-006-01-0039


A Pi-Calculus Machine

Gabriel Ciobanu (Department of Computer Science, Romania)

Mihai Rotaru (Institute of Theoretical Computer Science, Romanian Academy, Romania)

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: -calculus, abstract machine, concurrent processes, graphical representation of processes, multiset semantics, nets

Categories: F.3.1