Laura Bozzelli, Bastien Maubert & Sophie Pinchinat (2011):
Opacity Issues in Games with Imperfect Information.
Technical Report PI-1978.
IRISA.
Ján Černý (1964):
Poznámka k. homogénnym experimentom s konecnými automatmi.
Mat. fyz. čas SAV 14,
pp. 208–215.
Ján Černý, Alica Pirická & Blanka Rosenauerova (1971):
On directable automata.
Kybernetica 7,
pp. 289–298.
A.K. Chandra & L.J. Stockmeyer (1976):
Alternation.
In: 17th annual symposium on Foundations of Computer Science.
IEEE,
pp. 98–108,
doi:10.1109/SFCS.1976.4.
M. De Wulf, L. Doyen, T. Henzinger & J.F. Raskin (2006):
Antichains: A new algorithm for checking universality of finite automata.
In: Computer Aided Verification.
Springer,
pp. 17–30.
J. Dubreil (2009):
Monitoring and Supervisory Control for Opacity Properties.
Université de Rennes 1.
J. Dubreil, P. Darondeau & H. Marchand (2008):
Opacity enforcing control synthesis.
In: Discrete Event Systems, 2008. WODES 2008. 9th International Workshop on.
IEEE,
pp. 28–35,
doi:10.1109/WODES.2008.4605918.
S. Dziembowski, M. Jurdzinski & I. Walukiewicz (1997):
How much memory is needed to win infinite games?.
In: Logic in Computer Science, 1997. LICS'97. Proceedings., 12th Annual IEEE Symposium on.
IEEE,
pp. 99–110,
doi:10.1109/LICS.1997.614939.
J.Y. Halpern & M.Y. Vardi (1989):
The complexity of reasoning about knowledge and time. I. Lower bounds.
Journal of Computer and System Sciences 38(1),
pp. 195–237,
doi:10.1145/12130.12161.
J.E. Hopcroft, R. Motwani & J.D. Ullman (2006):
Automata theory, languages, and computation.
International Edition,
doi:10.1145/568438.568455.
M. Jurdzinski (1998):
Deciding the winner in parity games is in UP [intersection] co-UP.
Information Processing Letters 68(3),
pp. 119–124,
doi:10.1016/S0020-0190(98)00150-1.
D. Martin (1975):
Borel determinacy.
Annales of Mathematics 102,
pp. 363–371,
doi:10.2307/1971035.
B. Maubert & S. Pinchinat (2009):
Games with Opacity Condition.
In: Proceedings of the 3rd International Workshop on Reachability Problems.
Springer-Verlag,
pp. 175,
doi:10.1007/978-3-642-04420-5_16.
J.E. Pin (1983):
On two combinatorial problems arising from automata theory.
Ann. Discrete Math 17,
pp. 535–548,
doi:10.1016/S0304-0208(08)73432-7.
J.H. Reif (1984):
The complexity of two-player games of incomplete information.
Journal of computer and system sciences 29(2),
pp. 274–301,
doi:10.1016/0022-0000(84)90034-5.
A. Saboori & C.N. Hadjicostis (2008):
Opacity-Enforcing Supervisory Strategies for Secure Discrete Event Systems.
In: IEEE Conference on Decision and Control (CDC),
Cancun, Mexico,
pp. 889–894,
doi:10.1109/CDC.2008.4738646.
Walter J. Savitch (1970):
Relationships between nondeterministic and deterministic tape complexities.
J. Comput. System. Sci. 4,
pp. 177–192,
doi:10.1016/S0022-0000(70)80006-X.
L.J. Stockmeyer & A.R. Meyer (1973):
Word problems requiring exponential time (Preliminary Report).
In: Proceedings of the fifth annual ACM symposium on Theory of computing.
ACM,
pp. 1–9,
doi:10.1145/800125.804029.
eptcs@eptcs.org