ePrints

Regions of Petri nets with a/sync connections

Lookup NU author(s): Emeritus Professor Maciej KoutnyORCiD, Dr Marta Koutny

Downloads

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

Abstract

Automated synthesis from behavioural specifications,such as transition systems,is an attractive way of constructing correct concurrent systems.In this paper, we investigate the synthesisof Petri nets which use special connectionsbetween transitions and places.Along these a/sync connections tokens can be transferredinstantaneously between transitions executed in a single step.We show that for Place/Transition nets with a/sync connectionsthe synthesis problem can be treatedwithin the general approach based on regions ofstep transition systems.We also show that the problem is decidablefor finite transition systems, and outlinea suitable construction algorithm.

Publication metadata

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

Publication type: Article

Publication status: Published

Journal: Theoretical Computer Science

Year: 2012

Volume: 454

Pages: 189-198

Print publication date: 21/04/2012

ISSN (print): 0304-3975

Publisher: Elsevier BV

URL: http://dx.doi.org/10.1016/j.tcs.2012.04.016

DOI: 10.1016/j.tcs.2012.04.016

Altmetrics

Funding

Share