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 π-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 π-calculus. Our construction renders in a compositional way the control flow aspects present in π-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. © IFIP International Federation for Information Processing 2004.

Publication metadata

Author(s): Devillers R, Klaudel H, Koutny M

Publication type: Book Chapter

Publication status: Published

Book Title: Formal Techniques for Networked and Distributed Systems – FORTE 2004

Year: 2004

Volume: 3235

Pages: 309-325

Print publication date: 01/01/2004

Series Title: Lecture Notes in Computer Science

Publisher: Springer

Place Published: Berlin

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

ISBN: 9783540232520

Share