The covering and boundedness problems for branching vector addition systems

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 4, Issue , 2009, Pages 181-192

  Demri, Stephane ^a   Jurdziński, Marcin ^b   Lachish, Oded ^b   Lazic, Ranko ^b  

^a INRIA SACLAY   (France)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDEDNESS; VECTOR ADDITION SYSTEMS;

SOFTWARE ENGINEERING;

VECTORS;

EID: 77955323583     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.FSTTCS.2009.2317     Document Type: Conference Paper

References (17)

1. M. Bojańczyk, A. Muscholl, T. Schwentick, and L. Segoufin. Two-variable logic on data trees and XML reasoning. J. ACM, 56(3), 2009.
2. I. Borosh and L. B. Treybig. Bounds on positive integral solutions of linear Diophantine equations. Proc. AMS, 55: 299-304, 1976.
3. A. Chandra, D. Kozen, and L. Stockmeyer. Alternation. J. ACM, 28(1): 114-133, 1981.
4. P. de Groote, B. Guillaume, and S. Salvati. Vector addition tree automata. In LICS, pages 64-73. IEEE, 2004.
5. J. Esparza. Decidability and complexity of Petri net problems - an introduction. In Lectures on Petri Nets I: Basic Models, Volume 1491 of Lect. Notes Comput. Sci., pages 374-428. Springer, 1998.
6. J. Esparza and M. Nielsen. Decidability issues for Petri nets - a survey. Bull. EATCS, 52: 244-262, 1994.
7. P. Habermehl. On the complexity of the linear-time mu-calculus for Petri nets. In ICATPN, Volume 1248 of Lect. Notes Comput. Sci., pages 102-116. Springer, 1997.
8. R. M. Karp and R. E. Miller. Parallel program schemata. J. Comput. Syst. Sci., 3(2): 147-195, 1969.
9. R. Lazić. The branching reachability problem requires doubly-exponential space. Manuscript, 2009.
10. R. J. Lipton. The reachability problem requires exponential space. Technical Report 62, Dep. Comput. Sci., Yale Univ., Jan. 1976.
11. E. W. Mayr and A. R. Meyer. The complexity of the word problems for commutative semigroups and polynomial ideals. Adv. Math., 46: 305-329, 1982.
12. C. Rackoff. The covering and boundedness problems for vector addition systems. Theor. Comput. Sci., 6(2): 223-231, 1978.
13. O. Rambow. Multiset-valued linear index grammars: imposing dominance constraints on derivations. In ACL, pages 263-270. Morgan Kaufmann, 1994.
14. W. Reisig. Petri Nets: An Introduction, Volume 4 of Monographs in Theor. Comput. Sci. An EATCS Series. Springer, 1985.
15. L. Rosier and H.-C. Yen. A multiparameter analysis of the boundedness problem for vector addition systems. J. Comput. Syst. Sci., 32: 105-135, 1986.
16. R. Valk and G. Vidal-Naquet. Petri nets and regular languages. J. Comput. Syst. Sci., 23(3): 299-325, 1981.
17. K. N. Verma and J. Goubault-Larrecq. Karp-Miller trees for a branching extension of VASS. Discr. Math. and Theor. Comput. Sci., 7: 217-230, 2005.