Affiliations: [a] Département d’Informatique, Université Libre de Bruxelles, B-1050 Brussels, Belgium. [email protected] | [b] LAAS-CNRS, Université de Toulouse, CNRS, Toulouse, France. [email protected]
Correspondence:
[*]
Address for correspondence: Département d’Informatique, Université Libre de Bruxelles, B-1050 Brussels, Belgium
Note: [†] Supported by the STAE foundation/project DAEDALUS, Toulouse, France.
Abstract: Numerous real-world systems can be modeled with Petri nets, which allow a combination of concurrency with synchronizations and conflicts. To alleviate the difficulty of checking their behaviour, a common approach consists in studying specific subclasses. In the converse problem of Petri net synthesis, a Petri net of some subclass has to be constructed efficiently from a given specification, typically from a labelled transition system (lts) describing the behaviour of the desired net. In this paper, we focus on a notorious subclass of persistent Petri nets, the weighted marked graphs (WMGs), also called generalised (or weighted) event (or marked) graphs or weighted T-nets. In such nets, edges have multiplicities (weights) and each place has at most one ingoing and one outgoing transition. Although extensively studied in previous works and benefiting from strong results, both their analysis and synthesis can be further investigated. We provide new behavioural properties of WMGs expressed on their reachability graph, notably backward persistence and strong similarities between any two sequences sharing the same starting state and the same destination state. Besides, we design a general synthesis procedure aiming at the WMG class. Finally, when no solution to the synthesis problem exists, i.e., when the given lts is not WMG-solvable, we show how to construct a WMG whose reachability graph is a minimal over-approximation of the given lts.
Keywords: Weighted Petri net, analysis, synthesis, marked graph, event graph, theory of regions, approximation, persistence
