The covering and boundedness problems for branching vector addition systems

Demri, S. and Jurdziński, M. and Lachish, Oded and Lazić, R. (2009) The covering and boundedness problems for branching vector addition systems. In: Kannan, R. and Kumar, K.N. (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics 4. Dagstuhl, Germany: Schloss Dagstuhl, pp. 181-192. ISBN 9783939897132.

Full text not available from this repository.

Official URL: http://dx.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.

Metadata

Item Type:	Book Section
Keyword(s) / Subject(s):	vector addition systems, petri nets, covering, boundedness, computational complexity
School:	School of Business, Economics & Informatics > Computer Science and Information Systems
Depositing User:	Sarah Hall
Date Deposited:	30 May 2013 15:31
Last Modified:	11 Oct 2016 12:01
URI:	https://eprints.bbk.ac.uk/id/eprint/7133

Statistics

Archive Staff Only (login required)

Edit/View Item