Undecidability of Coverability and Boundedness for Timed-Arc Petri Nets with Invariants

Authors Lasse Jacobsen, Morten Jacobsen, Mikael H. Møller



PDF
Thumbnail PDF

File

DROPS.MEMICS.2009.2346.pdf
  • Filesize: 462 kB
  • 8 pages

Document Identifiers

Author Details

Lasse Jacobsen
Morten Jacobsen
Mikael H. Møller

Cite AsGet BibTex

Lasse Jacobsen, Morten Jacobsen, and Mikael H. Møller. Undecidability of Coverability and Boundedness for Timed-Arc Petri Nets with Invariants. In Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). Open Access Series in Informatics (OASIcs), Volume 13, pp. 106-113, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/DROPS.MEMICS.2009.2346

Abstract

Timed-Arc Petri Nets (TAPN) is a well studied extension of the classical Petri net model where tokens are decorated with real numbers that represent their age. Unlike reachability, which is known to be undecidable for TAPN, boundedness and coverability remain decidable. The model is supported by a recent tool called TAPAAL which, among others, further extends TAPN with invariants on places in order to model urgency. The decidability of boundedness and coverability for this extended model has not yet been considered. We present a reduction from two-counter Minsky machines to TAPN with invariants to show that both the boundedness and coverability problems are undecidable.
Keywords
  • Timed-Arc Petri Nets
  • Undecidability
  • Coverability
  • Boundedness

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail