L'accessibilité dans les réseaux de Petri est non élémentaire
1 : Laboratoire Bordelais de Recherche en Informatique
Centre National de la Recherche Scientifique : UMR5800, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Université Sciences et Technologies - Bordeaux 1, Université Bordeaux Segalen - Bordeaux 2
The Reachability Problem for Petri Nets is Not Elementary
Petri nets, also known as vector addition systems, are a long established and widely used model of concurrent processes. The
complexity of their reachability problem is one of the most prominent open questions in the theory of verification. That the reachability problem is decidable was established by Mayr in his seminal STOC 1981 work, and the currently best upper bound is non-primitive recursive cubic-Ackermannian of Leroux and Schmitz from LICS 2015. We show that the reachability problem is not elementary. Until this work, the best lower bound has been exponential space, due to Lipton in 1976.
Joint work with Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki.
| Type : | : | Exposés |
| Thématiques | : | GdR IM |
| PDF version | : |  PDF version |
- Poster
