par Devillers, Raymond
Référence Lecture notes in computer science, 13929 LNCS, page (307-323)
Publication Publié, 2023-05-01
Article révisé par les pairs
Résumé : The paper examines how to decide if a given (initially marked) Petri net is reversible, i.e., may always return to the initial situation. In particular, it concentrates on a very specific subclass of weighted circuits where the total number of tokens is constant, for which the worst case complexity is not known. Various ways to tackle the problem are considered, and some subcases are derived for which the problem is more or less easy.

Documents en relation

DI-fusion