Browse by author
Lookup NU author(s): Professor Maciej KoutnyORCiD
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
In this paper we propose a translation into high level Petri nets of a finite fragment of the pi-calculus. Our construction renders in a compositional way the control flow aspects present in pi-calculus process expressions, by adapting the existing graph-theoretic net composition operators. Those aspects which are related to term rewriting, as well as name binding, are handled through special inscription of places, transitions and arcs, together with a suitable choice of the initial marking for a compositionally derived high level Petri net.
Author(s): Devillers R, Klaudel H, Koutny M
Editor(s): de Frutos-Escrig, D., Nunez, M.
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: Formal Techniques for Networked and Distributed Systems (FORTE)
Year of Conference: 2004
Pages: 309-325
ISSN: 0302-9743 (print) 1611-3349 (online)
Publisher: Springer
URL: http://dx.doi.org/10.1007/978-3-540-30232-2_20
DOI: 10.1007/978-3-540-30232-2_20
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science
ISBN: 9783540232520
