ePrints

A Petri Net Translation of p-Calculus Terms

Lookup NU author(s): 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 finite structural translation of possibly recursive pi-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.

Publication metadata

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

Editor(s): Barkaoui, K., Cavalcanti, A., Cerone, A.

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: Theoretical Aspects of Computing: 3rd International Colloquium (ICTAC)

Year of Conference: 2006

Pages: 138-152

ISSN: 0302-9743 (Print) 1611-3349 (Online)

Publisher: Springer

URL: http://dx.doi.org/10.1007/11921240_10

DOI: 10.1007/11921240_10

Library holdings: Search Newcastle University Library for this item

Series Title: Lecture Notes in Computer Science

ISBN: 9783540488156

Share