Abstract
We describe the class of games with opacity condition, as an adequate model for security aspects of computing systems. We study their theoretical properties, relate them to reachability perfect information games and exploit this relation to discuss a search approach with heuristics, based on the directing-word problem in automata theory.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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
Černý, J.: Poznámka k. homogénnym experimentom s konecnými automatmi. Mat. fyz. čas SAV 14, 208–215 (1964)
Černý, J., Pirická, A., Rosenauerova, B.: On directable automata. Kybernetica 7, 289–298 (1971)
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)
Dubreil, J., Darondeau, P., Marchand, H.: Opacity enforcing control synthesis. In: Workshop on Discrete Event Systems, Gothenburg, Sweden (March 2008)
Imreh, Steinby: Directable nondeterministic automata. ACTACYB: Acta Cybernetica 14 (1999)
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)
Mahanti, A., Bagchi, A.: AND/OR graph heuristic search methods. Journal of the ACM (JACM) 32(1), 28–51 (1985)
Martin, D.: Borel determinacy. Annales of Mathematics 102, 363–371 (1975)
Pin, J.-E.: Le problème de la synchronisation et la conjecture de černý. 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)
Pin, J.-E.: On two combinatorial problems arising from automata theory. Annals of Discrete Mathematics 17, 535–548 (1983)
Reif: The complexity of two-player games of incomplete information. JCSS: Journal of Computer and System Sciences 29 (1984)
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)
Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. System. Sci. 4, 177–192 (1970)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maubert, B., Pinchinat, S. (2009). Games with Opacity Condition. In: Bournez, O., Potapov, I. (eds) Reachability Problems. RP 2009. Lecture Notes in Computer Science, vol 5797. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04420-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-04420-5_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04419-9
Online ISBN: 978-3-642-04420-5
eBook Packages: Computer ScienceComputer Science (R0)