Concurrent games on VASS with inhibition

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

Volumn 7454 LNCS, Issue , 2012, Pages 39-52

  Bérard, Béatrice ^a   Haddad, Serge ^b   Sassolas, Mathieu ^c   Sznajder, Nathalie ^a  

^a SORBONNE UNIVERSITÉ   (France)

^b CNRS   (France)

^c UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMMETRIC GAMES; CONCURRENT GAMES; CONCURRENT SEMANTICS; CONTROL PROBLEMS; REACHABILITY; SAFETY OBJECTIVES; VECTOR ADDITION SYSTEMS;

GAME THEORY; PETRI NETS; SEMANTICS; VECTORS;

CONCURRENCY CONTROL;

EID: 84866696237     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-32940-1_5     Document Type: Conference Paper

References (19)

1. Abdulla, P.A., Bouajjani, A., d'Orso, J.: Monotonic and downward closed games. J. Log. Comput. 18(1), 153-169 (2008)
2. Bérard, B., Haddad, S., Sassolas, M., Sznajder, N.: Concurrent games on VASS with inhibition. Technical Report LSV-12-10, LSV, ENS Cachan (2012)
3. Bollue, K., Slaats, M., Abraham, E., Thomas, W., Abel, D.: Synthesis of Behavioral Controllers for DES: Increasing Efficiency. In: WODES 2010, IFAC (2010)
4. Bouziane, Z., Finkel, A.: Cyclic petri net reachability sets are semi-linear effectively constructible. Electr. Notes Theor. Comput. Sci. 9, 15-24 (1997)
5. Brázdil, T., Jančar, P., Kučera, A.: Reachability Games on Extended Vector Addition Systems with States. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010, Part II. LNCS, vol. 6199, pp. 478-489. Springer, Heidelberg (2010)
6. Chandra, A.K., Kozen, D., Stockmeyer, L.J.: Alternation J. ACM 28(1), 114-133 (1981)
7. Chatterjee, K., Doyen, L., Henzinger, T.A., Raskin, J.F.: Generalized mean-payoff and energy games. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2010. LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, vol. 8, pp. 505-516 (2010)
8. Demri, S., Jurdziński, M., Lachish, O., Lazić, R.: The covering and boundedness problems for branching vector addition systems. In: Proc. of the 29th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009). Leibniz International Proceedings in Informatics, Leibniz-Zentrum für Informatik, vol. 4, pp. 181-192 (December 2009)
9. Esparza, J.: Petri nets, commutative context-free grammars, and basic parallel processes. Fundam. Inform. 31(1), 13-25 (1997)
10. Hopcroft, J.E., Pansiot, J.J.: On the reachability problem for 5-dimensional vector addition systems. Theor. Comput. Sci. 8, 135-159 (1979)
11. Kumar, R., Garg, V.: On computation of state avoidance control for infinite state systems in assignment program framework. IEEE Trans. Autom. Sci. Eng. 2(1), 87-91 (2005)
12. Le Gall, T., Jeannet, B., Marchand, H.: Supervisory Control of Infinite Symbolic Systems using Abstract Interpretation. In: CDC 2005, pp. 31-35. IEEE Press (2005)
13. Lipton, R.: The reachability problem requires exponential space. Technical Report 62, Dept. of Computer Science. Yale University (1976)
14. Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: algorithms and complexity. Prentice-Hall (1982)
15. Rackoff, C.: The covering and boundedness problems for vector addition systems. Theor. Comput. Sci. 6, 223-231 (1978)
16. Raskin, J.F., Samuelides, M., Van Begin, L.: Petri games are monotonic but difficult to decide. Technical Report 508, Université Libre de Bruxelles (2003)
17. Raskin, J.F., Samuelides, M., Van Begin, L.: Games for counting abstractions. Electr. Notes Theor. Comput. Sci. 128(6), 69-85 (2005)
18. 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)
19. Sreenivas, R.S.: Some observations on supervisory policies that enforce liveness in partially controlled free-choice petri nets. Math. Comp. Simul. 70(5-6), 266-274 (2006)