Alternating vector addition systems with states

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

Volumn 8634 LNCS, Issue PART 1, 2014, Pages 220-231

  Courtois, Jean Baptiste ^a   Schmitz, Sylvain ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

VECTORS;

COMPLEXITY RESULTS; FINITE STATE SYSTEMS; LINEAR LOGIC; QUANTITATIVE VERIFICATION; STATE REACHABILITY; VECTOR ADDITION SYSTEMS;

PETRI NETS;

EID: 84958549186     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-662-44522-8_19     Document Type: Conference Paper

References (18)

1. Abdulla, P.A., Atig, M.F., Hofman, P., Mayr, R., Kumar, K.N., Totzke, P.: Infinitestate energy games. CSL-LICS 2014. ACM (2014), to appear
2. Abdulla, P.A., Bouajjani, A., d'Orso, J.: Deciding monotonic games. CSL 2003. LNCS, vol. 2803, pp. 1-14. Springer (2003)
3. Abdulla, P.A., Mayr, R., Sangnier, A., Sproston, J.: Solving parity games on integer vectors. Concur 2013. LNCS, vol. 8052, pp. 106-120. Springer (2013)
4. Berard, B., Haddad, S., Sassolas, M., Sznajder, N.: Concurrent games on VASS with inhibition. Concur 2012. LNCS, vol. 7454, pp. 39-52. Springer (2012)
5. Brázdil, T., Jančar, P., Kučera, A.: Reachability games on extended vector addition systems with states. ICALP 2010. LNCS, vol. 6199, pp. 478-489. Springer (2010)
6. Chaloupka, J.: Z-reachability problem for games on 2-dimensional vector addition systems with states is in P. Fund. Inform. 123(1), 15-42 (2013)
7. Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.F.: Generalized mean-payoff and energy games. FSTTCS 2010. LIPIcs, vol. 8, pp. 505-516. LZI (2010)
8. Demri, S., Jurdzinski, M., Lachish, O., Lazic, R.: The covering and boundedness problems for branching vector addition systems. J. Comput. Syst. Sci. 79(1), 23-38 (2012)
9. Jančar, P., Moller, F.: Checking regular properties of Petri nets. Concur '95. LNCS, vol. 962, pp. 348-362. Springer (1995)
10. Kanovich, M.I.: Petri nets, Horn programs, linear logic and vector games. Ann. Pure App. Logic 75(1-2), 107-135 (1995)
11. Kučera, A., Mayr, R.: Simulation preorder over simple process algebras. Inform. and Comput. 173(2), 184-198 (2002)
12. Lasota, S.: ExpSpace lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system. Inf. Process. Lett. 109(15), 850-855 (2009)
13. Lincoln, P., Mitchell, J., Scedrov, A., Shankar, N.: Decision problems for propositional linear logic. Ann. Pure App. Logic 56(1-3), 239-311 (1992)
14. Lipton, R.: The reachability problem requires exponential space. Tech. Rep. 62, Yale University (1976)
15. Rackoff, C.: The covering and boundedness problems for vector addition systems. Theor. Comput. Sci. 6(2), 223-231 (1978)
16. Raskin, J.F., Samuelides, M., Begin, L.V.: Games for counting abstractions. AVoCS 2004. ENTCS, vol. 128(6), pp. 69-85. Elsevier (2005)
17. Rosier, L., Yen, H.C.: A multiparameter analysis of the boundedness problem for vector addition systems. J. Comput. Syst. Sci. 32(1), 105-135 (1986)
18. Yen, H.C., Chen, C.L.: On minimal elements of upward-closed sets. Theor. Comput. Sci. 410(24-25), 2442-2452 (2009)