Lookup NU author(s): Professor Maciej Koutny,
Dr Marta Koutny
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
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.
Author(s): Kleijn J, Koutny M, Pietkiewicz-Koutny M
Publication type: Article
Publication status: Published
Journal: Theoretical Computer Science
Print publication date: 21/04/2012
ISSN (print): 0304-3975
Publisher: Elsevier BV
Altmetrics provided by Altmetric