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 …

Continuous Petri nets are a relaxation of classical discrete Petri nets in which transitions can
be fired a fractional number of times, and consequently places may contain a fractional …

This publication addresses two bottlenecks in the construction of minimal coverability sets of
Petri nets: the detection of situations where the marking of a place can be converted to ω …

Downward closures of Petri net reachability sets can be finitely represented by their set of
maximal elements called the minimal coverability set or Clover. Many properties …

The verification of infinite-state systems is a challenging task. A prominent instance is
reachability analysis of Petri nets, for which no efficient algorithm is known. The minimal …

Petri nets have been proposed as a fundamental model for discrete-event systems in a wide
variety of applications and have been an asset to reduce the computational complexity …

Karp and Miller's algorithm is based on an exploration of the reachability tree of a Petri net
where, the sequences of transitions with positive incidence are accelerated. The tree nodes …

Karp-Miller tree construction on Petri nets is a classical well-known algorithm to construct the
minimal coverability set via forward analysis. It enables us to construct decision procedures …

Formal verification of dynamic, concurrent and real-time systems has been the focus of
several decades of software engineering research. Formal verification requires high …

Vector Addition Systems (and, equivalently, Petri nets) are a widespread formalism for
modelling across a spectrum of problem domains, from logistics to hardware simulation. In …