Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
2 results

Vector Addition System Reversible Reachability Problem

Jérôme Leroux.
The reachability problem for vector addition systems is a central problem of net theory. This problem is known to be decidable but the complexity is still unknown. Whereas the problem is EXPSPACE-hard, no elementary upper bounds complexity are known. In this paper we consider the reversible&nbsp;[&hellip;]
Published on February 27, 2013
Volume 9, Issue 1

Structurally Cyclic Petri Nets

Drewes Frank ; Leroux Jérôme.
A Petri net is structurally cyclic if every configuration is reachable from itself in one or more steps. We show that structural cyclicity is decidable in deterministic polynomial time. For this, we adapt the Kosaraju's approach for the general reachability problem for Petri nets.
Published on December 22, 2015
Volume 11, Issue 4
  • < Previous
  • 1
  • Next >