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 …

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 …

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 …

A novel approach to link the environmental stresses with the COVID-19 cases is adopted
during this research. The time-dependent data are extracted from the online repositories that …

We consider the fundamental problem of reachability analysis over imperative programs
with real variables. Previous works that tackle reachability are either unable to handle …

Process descriptions are the backbones for creating products and delivering services
automatically. Computing the alignments between process descriptions (such as process …

Process mining techniques use event logs containing real process executions in order to
mine, align and extend process models. The partition of an event log into trace variants …

A pushdown vector addition system with states (PVASS) extends the model of vector
addition systems with a pushdown store. A PVASS is said to be\emph {bidirected} if every …

We prove that the reachability problem for two-dimensional vector addition systems with
states is NL-complete or PSPACE-complete, depending on whether the numbers in the input …