Acceleration For Presburger Petri Nets

3 pages•Published: July 25, 2013

Abstract

The reachability problem for Petri nets is a central problem of net theory. The problem is known to be decidable by inductive invariants definable in the Presburger arithmetic. When the reachability set is definable in the Presburger arithmetic, the existence of such an inductive invariant is immediate. However, in this case, the computation of a Presburger formula denoting the reachability set is an open problem. Recently this problem got closed by proving that if the reachability set of a Petri net is definable in the Presburger arithmetic, then the Petri net is flatable, i.e. its reachability set can be obtained by runs labeled by words in a bounded language. As a direct consequence, classical algorithms based on acceleration techniques effectively compute a formula in the Presburger arithmetic denoting the reachability set.

Keyphrases: acceleration, flatability, infinite state systems, petri nets, presburger, reachability, vector addition systems

In: Alexei Lisitsa and Andrei Nemytykh (editors). VPT 2013. First International Workshop on Verification and Program Transformation, vol 16, pages 10-12.

Links:	https://easychair.org/publications/paper/hnX
	https://doi.org/10.29007/8wkd

BibTeX entry

@inproceedings{VPT2013:Acceleration_Presburger_Petri_Nets,
  author    = {Jerome Leroux},
  title     = {Acceleration For Presburger Petri Nets},
  booktitle = {VPT 2013. First International Workshop on Verification and Program Transformation},
  editor    = {Alexei Lisitsa and Andrei Nemytykh},
  series    = {EPiC Series in Computing},
  volume    = {16},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/hnX},
  doi       = {10.29007/8wkd},
  pages     = {10-12},
  year      = {2013}}

Download PDF Open PDF in browser