Synthesising elementary net systems with localities

Abstract

Elementary net systems with localities (enl-systems) is a class of Petri nets introduced to model globally asynchronous locally synchronous systems (gals), where some of the components can be considered as logically or physically close and acting synchronously, while others can be considered as loosely connected or residing at distant locations and communicating asynchronously with the rest of the system. The specification of the behaviour of a gals system comes very often in the form of a transition system. Automated synthesis based on the regions of transition systems is an approach that allows to construct Petri net models from their transition system specifications. In this paper we focus on developing algorithms and tool support for the synthesis of the enl-systems from transition systems, where transitions are labelled by steps (sets) of executed actions. We pay special attention to the subclass of enl-systems with localised conflicts where there is no conflict between events belonging to different localities. The algorithms are implemented within the workcraft framework.