Toggle Main Menu Toggle Search

Open Access padlockePrints

The Newcastle University research output collection, currently available on ePrints, will shortly be moving to a new open repository platform, Figshare. To prepare for the data migration we have paused adding new content to ePrints, and will resume once the new repository is launched. During this time you will continue to have access to ePrints (but no new content will appear). We will share updates here when available.

Petri net semantics of the finite pi-calculus

Lookup NU author(s): Emeritus Professor Maciej KoutnyORCiD

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Abstract

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.

Publication metadata

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

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

Share