The covering and boundedness problems for branching vector addition systems

Demri, S. and Jurdziński, M. and Lachish, Oded and Lazić, R. (2013) The covering and boundedness problems for branching vector addition systems. Journal of Computer and System Sciences 79 (1), pp. 23-38. ISSN 0022-0000.

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1016/j.jcss.2012.04.002

Abstract

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

Metadata

Item Type:	Article
Keyword(s) / Subject(s):	petri nets, branching vector addition systems, covering, boundedness, computational complexity
School:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	30 May 2013 13:06
Last Modified:	09 Aug 2023 12:33
URI:	https://eprints.bbk.ac.uk/id/eprint/7104

Statistics

Archive Staff Only (login required)