Reachability games on extended vector addition systems with states

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6199 LNCS, Issue PART 2, 2010, Pages 478-489

  Brázdil, Tomáš ^a   Jančar, Petr ^b   Kučera, Antonín ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

^b VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

REACHABILITY; SAFETY OBJECTIVES; TARGET CONFIGURATIONS; VECTOR ADDITION SYSTEMS;

LINGUISTICS;

TRANSLATION (LANGUAGES);

EID: 77955334289     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14162-1_40     Document Type: Conference Paper

References (35)

1. Abdulla, P. A., Bouajjani, A., d'Orso, J.: Monotonic and downward closed games. Journal of Logic and Computation 18 (1), 153-169 (2008)
2. Abdulla, P. A., Cerans, K.: Simulation is decidable for one-counter nets. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 253-268. Springer, Heidelberg (1998)
3. Abdulla, P. A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: Proceedings of LICS 1996, pp. 160-170. IEEE Computer Society Press, Los Alamitos (1996)
4. Brazdil, T., Jancar, P., Kucera, A.: Reachability games on extended vector addition systems with states. CoRR abs/1002.2557 (2010)
5. Burkart, O., Caucal, D., Moller, F., Steffen, B.: Verification on infinite structures. Handbook of Process Algebra, 545-623 (2001)
6. Demri, S., Jurdziński, M., Lachish, O., Lazic, R.: The covering and boundedness problems for branching vector addition systems. In: Proceedings of FST&TCS 2009. Leibniz International Proceedings in Informatics, vol. 4, pp. 181-192. Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2009)
7. Demri, S., Lazic, R., Sangnier, A.: Model checking freeze LTL over one-counter automata. In: Amadio, R. M. (ed.) FOSSACS 2008. LNCS, vol. 4962, pp. 490-504. Springer, Heidelberg (2008)
8. Esparza, J.: Decidability of model checking for infinite-state concurrent systems. Acta Informatica 34, 85-107 (1997)
9. Etessami, K., Wojtczak, D., Yannakakis, M.: Quasi-birth-death processes, tree-like QBDs, probabilistic 1-counter automata, and pushdown systems. In: Proceedings of 5th Int. Conf. on Quantitative Evaluation of Systems (QEST 2008). IEEE Computer Society Press, Los Alamitos (2008)
10. Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, PartI: Completions. In: Proceedings of STACS 2009. Leibniz International Proceedings in Informatics, vol. 3, pp. 433-444. Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2009)
11. Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, Part II: Complete WSTS. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 188-199. Springer, Heidelberg (2009)
12. Finkel, A., Schnoebelen, P.: Well structured transition systems everywhere? Theoretical Computer Science 256 (1-2), 63-92 (2001)
13. Grädel, E., Thomas, W., Wilke, T.: Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002)
14. Haase, C., Kreutzer, S., Ouaknine, J., Worrell, J.: Reachability in succinct and parametric one-counter automata. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 369-383. Springer, Heidelberg (2009)
15. Harel, D.: Effective transformations on infinite trees with applications to high undecidability dominoes, and fairness. Journal of the Association for Computing Machinery 33 (1) (1986)
16. Holzer, M.: On emptiness and counting for alternating finite automata. In: Developments in Language Theory II, pp. 88-97. World Scientific, Singapore (1995)
17. Jancar, P.: Undecidability of bisimilarity for Petri nets and some related problems. Theoretical Computer Science 148 (2), 281-301 (1995)
18. Jancar, P.: Decidability of bisimilarity for one-counter processes. Information and Computation 158 (1), 1-17 (2000)
19. Jancar, P., Kucera, A., Moller, F.: Simulation and bisimulation over one-counter processes. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 334-345. Springer, Heidelberg (2000)
20. Jancar, P., Kucera, A., Moller, F., Sawa, Z.: DP lower bounds for equivalence-checking and model-checking of one-counter automata. Information and Computation 188 (1), 1-19 (2004)
21. Jancar, P., Sawa, Z.: A note on emptiness for alternating finite automata with a one-letter alphabet. Information Processing Letters 104 (5), 164-167 (2007)
22. Kucera, A.: The complexity of bisimilarity-checking for one-counter processes. Theoretical Computer Science 304 (1-3), 157-183 (2003)
23. Kučera, A., Jančar, P.: Equivalence-checking on infinite-state systems: Techniques and results. Theory and Practice of Logic Programming 6 (3), 226-264 (2006)
24. Lipton, R.: The reachability problem requires exponential space. Technical report 62, Yale University (1976)
25. Martin, D. A.: Borel determinacy. Annals of Mathematics, Second Series 102 (2), 363-371 (1975)
26. Minsky, M. L.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)
27. Peterson, J. L.: Petri Net Theory and the Modelling of Systems. Prentice-Hall, Englewood Cliffs (1981)
28. Rackoff, C: The covering and boundedness problems for vector addition systems. Theoretical Computer Science 6, 223-231 (1978)
29. Reisig, W.: Petri Nets-An Introduction. Springer, Heidelberg (1985)
30. Rosier, L. E., Yen, H.-C.: A multiparameter analysis of the boundedness problem for vector addition systems. Journal of Computer and System Sciences 32, 105-135 (1986)
31. Serre, O.: Parity games played on transition graphs of one-counter processes. In: Aceto, L., Ingólfsdóttir, A. (eds.) FOSSACS 2006. LNCS, vol. 3921, pp. 337-351. Springer, Heidelberg (2006)
32. Thomas, W.: Infinite games and verification. In: Hunt Jr., W. A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 58-64. Springer, Heidelberg (2003)
33. Valk, R., Jantzen, M.: The residue of vector sets with applications to decidability problems in Petri nets. Acta Informatica 21, 643-674 (1985)
34. Verma, K. N., Goubault-Larrecq, J.: Karp-Miller trees for a branching extension of VASS. Discrete Mathematics & Theoretical Computer Science 7 (1), 217-230 (2005)
35. Walukiewicz, I.: A landscape with games in the background. In: Proceedings of LICS 2004, pp. 356-366. IEEE Computer Society Press, Los Alamitos (2004)