License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2009.2317
URN: urn:nbn:de:0030-drops-23173
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2009/2317/
Go to the corresponding LIPIcs Volume Portal

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

The Covering and Boundedness Problems for Branching Vector Addition Systems

pdf-format:
09005.DemriStephane.2317.pdf (0.1 MB)

Abstract

The covering and boundedness problems for
branching vector addition systems
are shown complete for doubly-exponential time.

BibTeX - Entry

@InProceedings{demri_et_al:LIPIcs:2009:2317,
  author =	{St{\'e}phane Demri and Marcin Jurdzinski and Oded Lachish and Ranko Lazic},
  title =	{{The Covering and Boundedness Problems for Branching Vector Addition Systems}},
  booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science},
  pages =	{181--192},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-13-2},
  ISSN =	{1868-8969},
  year =	{2009},
  volume =	{4},
  editor =	{Ravi Kannan and K. Narayan Kumar},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2317},
  URN =		{urn:nbn:de:0030-drops-23173},
  doi =		{10.4230/LIPIcs.FSTTCS.2009.2317},
  annote =	{Keywords: Vector addition systems, Petri nets, covering, boundedness, computational complexity}
}

Keywords: Vector addition systems, Petri nets, covering, boundedness, computational complexity
Collection: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
Issue Date: 2009
Date of publication: 14.12.2009

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI