Abstract : The general Petri net reachability problem is shown to be decidable in double exponential space. The previous algorithm is non-primitive recursive.
https://hal.inria.fr/inria-00073286
Contributeur : Rapport de Recherche Inria
<>
Soumis le : mercredi 24 mai 2006 - 12:26:18
Dernière modification le : vendredi 16 novembre 2018 - 01:27:47
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:41:17
Zakaria Bouziane. A Primitive Recursive Algorithm for the General Petri Net Reachability Problem. [Research Report] RR-3404, INRIA. 1998. 〈inria-00073286〉
