Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
2 results

The General Vector Addition System Reachability Problem by Presburger Inductive Invariants

leroux jerome.
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known to be decidable by algorithms exclusively based on the classical Kosaraju-Lambert-Mayr-Sacerdote-Tenney decomposition. This decomposition is used in this paper to prove that&nbsp;[&hellip;]
Published on September 9, 2010
Volume 6, Issue 3

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 >