Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems

International audienceRecent studies investigated the problems of analyzing Petri nets and synthesizing them from labelled transition systems (LTS) with two letters (transitions) only. In this paper, we extend these works by providing new characterizations for the synthesis of two-and three-letter Weighted Marked Graphs (WMGs), a well-known and useful class of weighted Petri nets in which each place has at most one input and one output. In this study, we focus mainly on LTS forming a single circuit. Also, we develop a sufficient condition of WMG-solvability for an arbitrary number of letters. Finally, we show that this sufficient condition is not necessary in the case of LTS forming a single circuit with five letters