Games with opacity condition

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

Volumn 5797 LNCS, Issue , 2009, Pages 166-175

  Maubert, Bastien ^a   Pinchinat, Sophie ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ADEQUATE MODELS; COMPUTING SYSTEM; INFORMATION GAME; REACHABILITY; WORD PROBLEM;

AUTOMATA THEORY; OPACITY;

GAME THEORY;

EID: 70349960035     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04420-5_16     Document Type: Conference Paper

References (14)

1. Berwanger, D., Doyen, L.: On the power of imperfect information. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dagstuhl, Germany (2008), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
2. ¡Cerńy, J.: Pozńamka k. homoǵennym experimentom s konecńymi automatmi. Mat. fyz. ¡cas SAV 14, 208-215 (1964)
3. ¡Cerńy, J., Piricḱa, A., Rosenauerova, B.: On directable automata. Kybernetica 7, 289-298 (1971)
4. Chatterjee, K., Henzinger, T.A.: Semiperfect-information games. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol.3821, pp. 1-18. Springer, Heidelberg (2005)
5. Dubreil, J., Darondeau, P., Marchand, H.: Opacity enforcing control synthesis. In: Workshop on Discrete Event Systems, Gothenburg, Sweden (March 2008)
6. Imreh, Steinby: Directable nondeterministic automata. ACTACYB: Acta Cybernetica 14 (1999)
7. Kumar, V., Nau, D.S.: A general branch-and-bound formulation for and/or graph and game tree search. In: Search in Artificial Intelligence, pp. 91-130 (1988)
8. Mahanti, A., Bagchi, A.: AND/OR graph heuristic search methods. Journal of the ACM (JACM) 32(1), 28-51 (1985)
9. Martin, D.: Borel determinacy. Annales of Mathematics 102, 363-371 (1975)
10. Pin, J.-E.: Le probl̀eme de la synchronisation et la conjecture de ¡cerńy. In: De luca, A. (ed.) Non-commutative structures in algebra and geometric combinatorics, CNR, Roma. Quaderni de la Ricerca Scientifica, vol.109, pp. 37-48 (1981)
11. Pin, J.-E.: On two combinatorial problems arising from automata theory. Annals of Discrete Mathematics 17, 535-548 (1983)
12. Reif: The complexity of two-player games of incomplete information. JCSS: Journal of Computer and System Sciences 29 (1984)
13. Saboori, A., Hadjicostis, C.N.: Opacity-enforcing supervisory strategies for secure discrete event systems. In: IEEE Conference on Decision and Control (CDC), Cancun Mexico (December 2008)
14. Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. System. Sci. 4, 177-192 (1970)