Toggle Main Menu Toggle Search

Open Access padlockePrints

Regions of Petri Nets with a/sync Connections

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

Downloads


Abstract

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.


Publication metadata

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

Publication type: Report

Publication status: Published

Series Title: School of Computing Science Technical Report Series

Year: 2011

Pages: 17

Print publication date: 01/11/2011

Source Publication Date: November 2011

Report Number: 1297

Institution: School of Computing Science, University of Newcastle upon Tyne

Place Published: Newcastle upon Tyne


Share