The Covering and Boundedness Problems for Branching Vector Addition Systems

Authors Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic



PDF
Thumbnail PDF

File

LIPIcs.FSTTCS.2009.2317.pdf
  • Filesize: 119 kB
  • 12 pages

Document Identifiers

Author Details

Stéphane Demri
Marcin Jurdzinski
Oded Lachish
Ranko Lazic

Cite AsGet BibTex

Stéphane Demri, Marcin Jurdzinski, Oded Lachish, and Ranko Lazic. The Covering and Boundedness Problems for Branching Vector Addition Systems. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 181-192, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2317

Abstract

The covering and boundedness problems for branching vector addition systems are shown complete for doubly-exponential time.
Keywords
  • Vector addition systems
  • Petri nets
  • covering
  • boundedness
  • computational complexity

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