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 Contributor : Rapport de Recherche InriaConnect in order to contact the contributor Submitted on : Wednesday, May 24, 2006 - 12:26:18 PM Last modification on : Friday, February 4, 2022 - 3:22:18 AM Long-term archiving on: : Sunday, April 4, 2010 - 11:41:17 PM
Zakaria Bouziane. A Primitive Recursive Algorithm for the General Petri Net Reachability Problem. [Research Report] RR-3404, INRIA. 1998. ⟨inria-00073286⟩