Regions of Petri Nets with a/sync Connections

  1. Lookup NU author(s)
  2. Professor Maciej Koutny
  3. Dr Marta Pietkiewicz-Koutny
Author(s)Pietkiewicz-Koutny M; Koutny M; Kleijn J
Publication type Report
Series TitleSchool of Computing Science Technical Report Series
Year2011
DateNovember 2011
Report Number1297
Pages17
Full text is available for this publication:
Automated synthesis from behavioural specifications, is an attractive way of constructing correct concurrent systems.In this paper, we investigate the synthesis of Petri nets which use special connections between transitions and places. Along these a/sync connections tokens can be transferred instantaneously between two transitions executed in a single step. We show that for Place/Transition nets with a/sync connections the synthesis problem can be treated within the general approach based on regions of step transition systems. Moreover, we demonstrate that the problem is decidable for finite transition systems, and identify a subclass of nets for which a polynomial decision procedure and construction algorithm exists.
InstitutionSchool of Computing Science, University of Newcastle upon Tyne
Place PublishedNewcastle upon Tyne
ActionsLink to this publication