Toggle Main Menu Toggle Search

Open Access padlockePrints

An Algebra of Non-safe Petri Boxes

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

We define an algebraic framework based on non-safe Petri nets, which allows one to express operations such as iteration, parallel composition, and transition synchronisation. This leads to an algebra of process expressions, whose constants and operators directly correspond to those used in Petri nets, and so we are able to associate nets to process expressions compositionally. The semantics of composite nets is then used to guide the definition of a structured operational semantics of process expressions. The main result is that an expression and the corresponding net generate isomorphic transition systems. We finally discuss a partial order semantics of the two algebras developed in this paper.


Publication metadata

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

Editor(s): Kirchner, H., Ringeissen, C.

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 9th International Conference on Algebraic Methodology and Software Technology (AMAST)

Year of Conference: 2002

Pages: 192-207

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

Publisher: Springer-Verlag

URL: http://dx.doi.org/10.1007/3-540-45719-4_14

DOI: 10.1007/3-540-45719-4_14

Library holdings: Search Newcastle University Library for this item

Series Title: Lecture Notes in Computer Science

ISBN: 9783540441441


Share