• Citer

Synthesis of weighted marked graphs from circular labelled transition systems

par Devillers, Raymond ;Erofeev, Evgeny;Hujsa, Thomas
Référence CEUR Workshop Proceedings, 2371, page (6-22)
Publication Publié, 2019-08-01

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

Résumé :

Several works have proposed methods for the analysis and synthesis of Petri net subclasses from labelled transition systems (LTS). In this paper, we focus on Choice-Free (CF) Petri nets, in which each place has at most one output, and their subclass of Weighted Marked Graphs (WMGs). We provide new conditions for the WMG-synthesis from a circular LTS, i.e. forming a single circuit, and discuss the difficulties in extending these new results to the CF case.