• Citer

Synthesis of Inhibitor-Reset Petri Nets: Algorithmic and Complexity Issues

par Devillers, Raymond ;Tredup, Ronny
Référence Lecture notes in computer science, 13288 LNCS, page (213-235)
Publication Publié, 2022-12-01

Article révisé par les pairs

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

Résumé :

In this paper, we examine the synthesis problem from a finite labeled transition system when the target is the class of weighted nets with (possibly) inhibitor and/or reset links, or some subclasses of them. We also discuss the intrinsic complexity of some cases; in particular we show that although some subclasses have a polynomial synthesis, most of the time it is NP-complete.