Vector Addition Systems and equivalent Petri nets are a well established models of
concurrency. The central algorithmic problem for Vector Addition Systems with a long …

The Reachability Problem for Petri Nets is Not Primitive Recursive Page 1 The Reachability
Problem for Petri Nets is Not Primitive Recursive Jérôme Leroux Univ. Bordeaux, CNRS …

Petri nets, also known as vector addition systems, are a long established model of
concurrency with extensive applications in modeling and analysis of hardware, software …

The reachability problem in vector addition systems is a central question, not only for the
static verification of these systems, but also for many inter-reducible decision problems …

We introduce a hierarchy of fast-growing complexity classes and show its suitability for
completeness statements of many nonelementary problems. This hierarchy allows the …

The reachability semantics for Petri nets can be studied using open Petri nets. For us, an
“open” Petri net is one with certain places designated as inputs and outputs via a cospan of …

Population protocols (Angluin et al. in PODC, 2004) are a formal model of sensor networks
consisting of identical mobile devices. Two devices can interact and thereby change their …

We consider a general class of decision problems concerning formal languages, called
“(one-dimensional) unboundedness predicates”, for automata that feature reversal-bounded …

The coverability problem for Petri nets plays a central role in the verification of concurrent
shared-memory programs. However, its high EXPSPACE-complete complexity poses a …

Petri nets, equivalently presentable as vector addition systems with states, are an
established model of concurrency with widespread applications. The reachability problem …