More than 30 years after their inception, the decidability proofs for reach ability in vector
addition systems (VAS) still retain much of their mystery. These proofs rely crucially on a …

Tree structures are used extensively in domains such as computational biology, pattern
recognition, XML databases, computer networks, and so on. In this paper, we present …

The covering and boundedness problems for branching vector addition systems Page 1 HAL Id:
hal-03191875 https://hal.science/hal-03191875 Submitted on 7 Apr 2021 HAL is a …

The program of the 30th Symposium on Logic in Computer Science held in 2015 in Kyoto
included two contributions on the computational complexity of the reachability problem for …

We revisit decidability results for resource-bounded logics and use decision problems on
vector addition systems with states (VASS) in order to establish complexity characterisations …

A large number of properties of a vector addition system—for instance coverability,
boundedness, or regularity—can be decided using its coverability graph, by looking for …

We study an extension of classical Petri nets where tokens carry values from a countable
data domain, that can be tested for equality upon firing transitions. These Unordered Data …

We study the ($\omega $-) regular separability problem for B\" uchi VASS languages: Given
two B\" uchi VASS with languages $ L_1 $ and $ L_2 $, check whether there is a regular …

We show that the regular separability problem of VASS reachability languages is decidable
and $\mathbf {F} _ {\omega} $-complete. At the heart of our decision procedure are doubly …

Recent and simple algorithms for Petri nets | SpringerLink Skip to main content Advertisement
SpringerLink Log in Menu Find a journal Publish with us Search Cart 1.Home 2.Software & …