Games with Opacity Condition

Authors:
Bastien Maubert;Sophie Pinchinat
Affiliations:
IRISA, France;IRISA, France
Venue:
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Year:
2009

Citing 5
Cited 0

AND/OR graph heuristic search methods

Journal of the ACM (JACM)
A general branch-and-bound formulation for and/or graph and game tree search

Search in Artificial Intelligence
Directable nondeterministic automata

Acta Cybernetica
Relationships between nondeterministic and deterministic tape complexities

Journal of Computer and System Sciences
Semiperfect-Information games

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.