The covering and boundedness problems for branching vector addition systems

Journal of Computer and System Sciences

Volumn 79, Issue 1, 2013, Pages 23-38

  Demri, Stéphane ^a   Jurdziński, Marcin ^b   Lachish, Oded ^b,c   Lazić, Ranko ^b  

^a CNRS   (France)

^b UNIVERSITY OF WARWICK   (United Kingdom)

^c UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Boundedness; Branching vector addition systems; Computational complexity; Covering; Petri nets

Indexed keywords

COMPUTATIONAL COMPLEXITY; PETRI NETS;

BOUNDEDNESS; COVERING; EXPONENTIAL TIME; VECTOR ADDITION SYSTEMS;

VECTORS;

EID: 84869503257     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2012.04.002     Document Type: Conference Paper

References (21)

1. W. Reisig Petri Nets: An Introduction Monogr. Theoret. Comput. Sci. EATCS Ser. vol. 4 1985 Springer
2. J. Esparza, and M. Nielsen Decidability issues for Petri nets - a survey Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 52 1994 244 262
3. C. Rackoff The covering and boundedness problems for vector addition systems Theoret. Comput. Sci. 6 1978 223 231
4. R.J. Lipton, The Reachability Problem Requires Exponential Space, Technical Report 62, Dep. Comput. Sci., Yale Univ., 1976.
5. L. Rosier, and H.-C. Yen A multiparameter analysis of the boundedness problem for vector addition systems J. Comput. System Sci. 32 1986 105 135 (Pubitemid 16554549)
6. E.W. Mayr, and A.R. Meyer The complexity of the word problems for commutative semigroups and polynomial ideals Adv. Math. 46 1982 305 329
7. P. Habermehl On the complexity of the linear-time mu-calculus for Petri nets ICATPN Lecture Notes in Comput. Sci. vol. 1248 1997 Springer 102 116 (Pubitemid 127088938)
8. M.F. Atig, and P. Habermehl On Yen's path logic for Petri nets RP Lecture Notes in Comput. Sci. vol. 5797 2009 Springer 51 63
9. S. Demri On selective unboundedness of VASS Infinity Electron. Proc. Theor. Comput. Sci. vol. 39 2010 1 15
10. A. Urquhart The complexity of decision procedures in relevance logic II J. Symbolic Logic 64 1999 1774 1802
11. O. Rambow Multiset-valued linear index grammars: imposing dominance constraints on derivations ACL 1994 Morgan Kaufmann 263 270
12. S. Schmitz On the computational complexity of dominance links in grammatical formalisms ACL 2010 The Association for Computer Linguistics 514 524
13. P. de Groote, B. Guillaume, and S. Salvati Vector addition tree automata LICS 2004 IEEE Computer Society Press 64 73
14. R.M. Karp, and R.E. Miller Parallel program schemata J. Comput. System Sci. 3 1969 147 195
15. K.N. Verma, and J. Goubault-Larrecq Karp-Miller trees for a branching extension of VASS Discrete Math. Theor. Comput. Sci. 7 2005 217 230
16. M. Bojańczyk, A. Muscholl, T. Schwentick, and L. Segoufin Two-variable logic on data trees and XML reasoning J. ACM 56 2009
17. R. Valk, and G. Vidal-Naquet Petri nets and regular languages J. Comput. System Sci. 23 1981 299 325
18. A. Chandra, D. Kozen, and L. Stockmeyer Alternation J. ACM 28 1981 114 133
19. I. Borosh, and L.B. Treybig Bounds on positive integral solutions of linear Diophantine equations Proc. AMS 55 1976 299 304
20. J. Esparza Decidability and complexity of Petri net problems - an introduction Lectures on Petri Nets I: Basic Models Lecture Notes in Comput. Sci. vol. 1491 1998 Springer 374 428
21. R. Lazić The reachability problem for branching vector addition systems requires doubly-exponential space Inform. Process. Lett. 110 2010 740 745