Published in Volume XIX, 2009, pages 1-23

Authors: M. Koutny and M. Pietkiewicz-Koutny

Abstract

Automated synthesis from behavioural specifications is an attractive
way of constructing computational systems. In this paper, we
look at a specific instance of this approach which aims at constructing
GALS (globally asynchronous locally synchronous) systems. GALS
systems are represented by Petri nets with localities, each locality
defining a set of co-located actions, and specifications are given in
terms of transition systems with arcs labelled by steps of executed actions.
The proposed synthesis procedures are based on the regions of
transition systems, and work without knowing which actions are to be
co-located.

Full Text (PDF)

Bibtex

@article{sacscuza:koutny2009sopnwl,
  title={Synthesis of Petri Nets with Localities},
  author={M. Koutny and M. Pietkiewicz-Koutny},
  journal={Scientific Annals of Computer Science},
  volume={19},
  organization={``A.I. Cuza'' University, Iasi, Romania},
  year={2009},
  pages={1--23},
  publisher={``A.I. Cuza'' University Press}
}