Journal article
A compositional Petri net translation of general π-calculus terms
Abstract
We propose a finite structural translation of possibly recursive π-calculus terms into Petri nets. This is achieved by using high-level nets together with an equivalence on markings in order to model entering into recursive calls, which do not need to be guarded. We view a computing system as consisting of a main program (π-calculus term) together with procedure declarations (recursive definitions of π-calculus identifiers). The control …
Authors
Devillers R; Klaudel H; Koutny M
Journal
Formal Aspects of Computing, Vol. 20, No. 4-5, pp. 429–450
Publisher
Association for Computing Machinery (ACM)
Publication Date
July 2008
DOI
10.1007/s00165-008-0079-2
ISSN
0934-5043