AI Chat AI Image Generator AI Video Text to Speech

The Reachability Problem for Petri Nets is Not Primitive Recursive

04/26/2021

∙

by Jerome Leroux, et al.

∙

∙

We present a way to lift up the Tower complexity lower bound of the reachability problem for Petri nets to match the Ackermannian upper bound closing a long standing open problem. We also prove that the reachability problem in dimension 17 is not elementary.

page 1

page 2

page 3

page 4

research

∙ 09/19/2018

The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract)

Petri nets, also known as vector addition systems, are a long establishe...

0 Wojciech Czerwiński, et al. ∙

research

∙ 03/20/2019

Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension

The reachability problem in vector addition systems is a central questio...

0 Jerome Leroux, et al. ∙

research

∙ 11/10/2021

The Decidability and Complexity of Interleaved Bidirected Dyck Reachability

Dyck reachability is the standard formulation of a large domain of stati...

0 Adam Husted Kjelstrøm, et al. ∙

research

∙ 11/11/2020

The complexity of bounded context switching with dynamic thread creation

Dynamic networks of concurrent pushdown systems (DCPS) are a theoretical...

0 Pascal Baumann, et al. ∙

research

∙ 09/19/2018

The Reachability Problem for Petri Nets is Not Elementary

Petri nets, also known as vector addition systems, are a long establishe...

0 Wojciech Czerwiński, et al. ∙

research

∙ 09/17/2019

Reachability Games with Relaxed Energy Constraints

We study games with reachability objectives under energy constraints. We...

0 Loïc Hélouët, et al. ∙

research

∙ 06/10/2020

Checking marking reachability with the state equation in Petri net subclasses

Although decidable, the marking reachability problem for Petri nets is w...

0 Thomas Hujsa, et al. ∙