Toggle Main Menu Toggle Search

Open Access padlockePrints

Synthesis of General Petri Nets with Localities

Lookup NU author(s): Dr Marta Koutny


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


There is a growing need to introduce and develop computational models capable of faithfully modelling systems whose behaviour combines synchrony with asynchronyin a variety of complicated ways. Examples of such real-life systems can be found from VLSI hardware GALS systems to systems of cells within which biochemical reactions happen in synchronised pulses. One way of capturing the resulting intricate behaviours is to use Petri nets with localities where transitions are partitioned into disjoint groups within which execution is synchronous and maximally concurrent. In this paper, we generalise this type of nets by allowing each transition to belong to several localities. Moreover, we define this extension in a generic wayfor all classes of nets defined by net-types. We show that Petri nets with overlapping localities are an instance of the general model of nets with policies. Thanks to this fact, it is possible to automatically construct nets with localitiesfrom behavioural specifications given in terms of finite step transition systems.After that we outline our initial ideas concerning net synthesis when the association of transition to localities is not given and has to be determined by the synthesis algorithm.

Publication metadata

Author(s): Koutny M, Pietkiewicz-Koutny M

Editor(s): Desel, J., Yakovlev, A.

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: Application of Region Theory (ART)

Year of Conference: 2010

Pages: 15-28

Publisher: IEEE

Notes: Associated with 10th International Conference on Application of Concurrency to System Design (ACSD 2010)

Library holdings: Search Newcastle University Library for this item

ISBN: 9789728692544