The reachability problem for branching vector addition systems requires doubly-exponential space

Information Processing Letters

Volumn 110, Issue 17, 2010, Pages 740-745

  Lazić, Ranko ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

Program correctness; Theory of computation

Indexed keywords

DECISION PROBLEMS; FINITE SET; PROGRAM CORRECTNESS; REACHABILITY PROBLEM; THEORY OF COMPUTATION; VECTOR ADDITION SYSTEMS;

COMPUTATION THEORY; VECTORS;

VECTOR SPACES;

EID: 77954080079     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2010.06.008     Document Type: Article

References (16)

1. W. Reisig Petri Nets: An Introduction Monographs in Theor. Comput. Sci. An EATCS Series vol. 4 1985 Springer
2. J. Esparza, and M. Nielsen Decidability issues for Petri nets - a survey Bull. EATCS 52 1994 244 262
3. R.J. Lipton, The reachability problem requires exponential space, Tech. Rep. 62, Dep. Comput. Sci., Yale Univ. (January 1976)
4. L.J. Stockmeyer, The complexity of decision problems in automata theory and logic, Ph.D. thesis, MIT, TR-133, Lab. Comput. Sci., 1974
5. E.W. Mayr An algorithm for the general Petri net reachability problem SIAM J. Comput. 13 3 1984 441 460
6. R. Kosaraju, Decidability of reachability in vector addition systems, in: STOC, 1982, pp. 267-281
7. J.-L. Lambert A structure to decide reachability in Petri nets Theoretical Comput. Sci. 99 1 1992 79 104
8. J. Leroux, The general vector addition system reachability problem by Presburger inductive invariants, in: LICS, IEEE Comput. Soc., 2009, pp. 4-13
9. O. Rambow Multiset-valued linear index grammars: imposing dominance constraints on derivations ACL 1994 Morgan Kaufmann 263 270
10. P. de Groote, B. Guillaume, S. Salvati, Vector addition tree automata, in: LICS, IEEE Comput. Soc., 2004, pp. 64-73
11. R.M. Karp, and R.E. Miller Parallel program schemata J. Comput. Syst. Sci. 3 2 1969 147 195
12. K.N. Verma, and J. Goubault-Larrecq Karp-Miller trees for a branching extension of VASS Discr. Math. and Theor. Comput. Sci. 7 2005 217 230
13. M. Bojańczyk, A. Muscholl, T. Schwentick, L. Segoufin, Two-variable logic on data trees and XML reasoning, J. ACM 56 (3)
14. S. Demri, M. Jurdziński, O. Lachish, and R. Lazić The covering and boundedness problems for branching vector addition systems FSTTCS LIPIcs vol. 4 2009 Schloss Dagstuhl 181 192
15. J. Esparza Decidability and complexity of Petri net problems - an introduction Lectures on Petri Nets I: Basic Models Lect. Notes Comput. Sci. vol. 1491 1998 Springer 374 428
16. C. Rackoff The covering and boundedness problems for vector addition systems Theor. Comput. Sci. 6 2 1978 223 231