%0 Journal Article
%T Synthesis of Petri Nets with Localities
%A M. Koutny
%A M. Pietkiewicz-Koutny
%J Scientific Annals of Computer Science
%D 2009
%I Alexandru Ioan Cuza University of Iasi
%X Automated synthesis from behavioural specifications is an attractiveway of constructing computational systems. In this paper, welook at a specific instance of this approach which aims at constructingGALS (globally asynchronous locally synchronous) systems. GALSsystems are represented by Petri nets with localities, each localitydefining a set of co-located actions, and specifications are given interms of transition systems with arcs labelled by steps of executed actions.The proposed synthesis procedures are based on the regions oftransition systems, and work without knowing which actions are to beco-located.We consider two basic classes of Petri nets, viz. Elementary NetSystem with Localities (ENL-system) and Place/Transition nets withlocalities (PTL-nets). In particular, we discuss ENL-systems wherethere is no conflict between events coming from different localities.In such a case, the synthesis problem reduces to checking just oneco-location relation. This result is then extended to PTL-nets.Keywords: concurrency, Petri nets, localities, GALS, net synthesis,step sequence semantics, transition systems, theory of regions, conflict.
%U http://www.info.uaic.ro/bin/download/Annals/XIX/XIX_0.pdf