A landscape with games in the background

Proceedings - Symposium on Logic in Computer Science

Volumn 19, Issue , 2004, Pages 356-366

  Walukiewicz, Igor ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER SCIENCE; DECISION MAKING; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PROBLEM SOLVING; SURVEYS;

COMMUNICATION PATTERNS; DISTRIBUTED GAMES; PLAYER PATH-FORMING;

GAME THEORY;

EID: 4544303594     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/lics.2004.1319630     Document Type: Conference Paper

References (78)

1. P. A. Abdulla, A. Bouajjani, and J. d'Orso. Deciding monotonic games. In CSL'03, volume 2725 of Lecture Notes in Computer Science, pages 1-14, 2003.
2. S. Abramsky, D. R. Ghica, A. S. Murawski, and C.-H. L. Ong. Applying game semantics to compositional software modeling and verification. In TACAS'04, volume 2988 of Lecture Notes in Computer Science, pages 421-435, 2004.
3. R. Alur, L. Fix, and T. Henzinger. Event-clock automata: A determinizable class of timed automata. Theoretical Computer Science, 204, 1997.
4. R. Alur and P. Madhusudan. Visibly pushdown languages. In STOC'04, 2004. To appear.
5. A. Arnold. The mu-calculus alternation-depth hierarchy is strict on binary trees. RAIRO-Theoretical Informatics and Applications, 33:329-339, 1999.
6. A. Arnold and L. Santocanale. Ambiguous classes in the games mu-calculus hierarchy. In FOSSACS 03, volume 2620 of Lecture Notes in Computer Science, pages 70-86, 2003.
7. A. Arnold, A. Vincent, and I. Walukiewicz. Games for synthesis of controllers with partial observation. Theoretical Computer Science, 303(1):7-34, 2003.
8. E. Asarin, O. Maler, A. Pnueli, and J. Sifakis. Contrloller synthesis for timed automata. In Proc. IFAC Symp. System Structure and Control, pages 469-474, 1998.
9. A. Blass. A game semantics for linear logic. Ann. Pure and Appl. Logic, 56(1-3):183-220, 1992.
10. A. Bouquet, O. Serre, and I. Walukiewicz. Pushdown games with the unboundedness and regular conditions. In FSTTCS'03, volume 2914 of Lecture Notes in Computer Science, pages 88-99, 2003.
11. P. Bouyer, D. D'Souza, P. Madhusudan, and A. Petit. Timed control with partial observability. In CAV'03, volume 2725 of Lecture Notes in Computer Science, pages 180-192, 2003.
12. J. Bradfield. The modal mu-calculus alternation hierarchy is strict. Theoretical Computer Science, 195:133-153, 1997.
13. T. Cachat. Higher order pushdown automata, the Caucal hierarchy of graphs and parity games, In ICALP'03, volume 2719 of Lecture Notes in Computer Science, pages 556-569, 2003.
14. T. Cachat, J. Duparc, and W. Thomas. Solving pushdown games with a Sigma-3 winning condition. In CSL'02, volume 2471 of Lecture Notes in Computer Science, pages 322-336, 2002.
15. T. Cachat and I. Walukiewicz. Complexity of games on higher-order pushdown automata. Manuscript, 2004.
16. A. Carayol and S. Wöhrle. The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata. In FSTTCS'03, volume 2914 of Lecture Notes in Computer Science, pages 112-124, 2003.
17. C. G. Cassandras and S. Lafortune. Introduction to Discrete Event Systems. Kluwer Academic Publishers, 1999.
18. F. Cassez, T. Henzinger, and J. Raskin. A comparison of control problems for timed and hybrid systems. In Hybrid Systems Computation and Control (HSCC'02), number 2289 in Lecture Notes in Computer Science, pages 134-148, 2002.
19. D. Caucal. On infinite terms having a decidable monadic theory. In MFCS'02, volume 2420 of Lecture Notes in Computer Science, pages 165-176, 2002.
20. K. Chatterjee, M. Jurdziński, and T. A. Henzinger. Quantitative stochastic parity games. In SODA'04, 2004. To appear.
21. B. Chor and C. Dwork. Randomization in Byzantine agreement. In S. Micali, editor, Randomness and Computation, pages 433-498. JAI Press, Greenwich, 1989.
22. T. Colcombet and D. Niwiński. On the positional determinacy of edge-labeled games. Submitted, 2004.
23. L. de Alfaro. Quantitative verification and control via the mu-calculus. In CONCUR'03, volume 2761 of Lecture Notes in Computer Science, pages 102-126, 2003.
24. L. de Alfaro, M. Faella, T. A. Henzinger, R. Majumdar, and M. Stoelinga. The element of surprise in timed games. In CONCUR'03, volume 2761 of Lecture Notes in Computer Science, pages 142-156, 2003.
25. L. de Alfaro and R. Majumdar. Quantitative solution of omega-regular games. In STOC'01: 33rd Annual ACM Symposium on Theory of Computing, pages 675-683, 2001.
26. V. Diekert and P. Gastin. Pure future local temporal logics are expressively complete for mazurkiewicz traces. In LATIN'04, Lecture Notes in Computer Science, 2004. to appear.
27. D. D'Souza and P. Madhusudan. Timed control synthesis for external specifications. In STACS'02, volume 2285 of Lecture Notes in Computer Science, pages 571-582, 2002.
28. E. A. Emerson and C. S. Jutla. Tree automata, mu-calculus and determinacy. In Proc. FOCS'91, pages 368-377, 1991.
29. J. Engelfriet. Iterated push-down automata and complexity classes. In 15th STOC'83, pages 365-373, 1983.
30. J. Esparza and J. Knoop. An automata-theoretic approach to interprocedural data-flow analysis. In FOSSACS'99, volume 1578 of Lecture Notes in Computer Science, pages 14-30, 1999.
31. W. Felscher. Dialogues as a foundation for intuitionistic logic. In D. Gabbay and F. Guenther, editors, Handbook of Philosophical Logic, volume III, pages 341-372. Reidel Publishing Company, 1986.
32. M. Fisher. The consensus problem in unreliable distributed systems (a brief survey). In Proc. International Conference on Foundations of Computation, 1983.
33. H. Gimbert. Parity and explosion games on context-free graphs. Manuscript, 2003.
34. E. Grädel. Positional determinacy of infinite games. In STAGS'04, volume 2996 of Lecture Notes in Computer Science, pages 4-18, 2004.
35. E. Grädel and I. Walukiewicz. Positional determinacy of infnite games, 2004. Submitted.
36. T. Henzinger, J.-F. Raskin, and P.-Y. Schobbens. The regular real-time languages. In ICALP'98, volume 1443 of Lecture Notes in Computer Science, pages 580-591, 1998.
37. Y. Hirshfeld and A. Rabinovich. A framework for decidable metrical logics. In ICALP'99, volume 1664 of Lecture Notes in Computer Science, pages 422-432, 1999.
38. Y. Hirshfeld and A. Rabinovich. Quantitative temporal logic. In CSL'99, volume 1683 of Lecture Notes in Computer Science, pages 172-187, 1999.
39. A. S. Kechris. Classical Descriptive Set Theory, volume 156 of Graduate Texts in Mathematics. Springer-Verlag, 1995.
40. T. Knapik, D. Niwinski, and P. Urzyczyn. Higher-order pushdown trees are easy. In FoSSaCS' 02, volume 2303 of Lecture Notes in Computer Science, pages 205-222, 2002.
41. R. Kumar and V. K. Garg. Modeling and control of logical discrete event systems. Kluwer Academic Pub., 1995.
42. O. Kupferman and M. Vardi. Synthesizing distributed systems. In Proc. 16th IEEE Symp. on Logic in Computer Science, 2001.
43. O. Kupferman, M. Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. Journal of the ACM, 47(2):312-360, 2000.
44. F. Lin and M. Wonham. Decentralized control and coordination of discrete-event systems with partial observation. IEEE Transactions on automatic control, 33(12):1330-1337, 1990.
45. C. Löding. Model-checking infinite state systems generated by ground tree rewriting. In FOSSACS'02, volume 2303 of Lecture Notes in Computer Science, pages 280-294, 2002.
46. C. Löding. Infinite Graphs Generated by Tree Rewriting. PhD thesis, RWTH Aachen, 2003.
47. P. Madhusudan. Control and Synthesis of Open Reactive Systems. PhD thesis, University of Madras, 2001.
48. P. Madhusudan and P. Thiagarajan. Distributed control and synthesis for local specifications. In ICALP'01, volume 2076 of Lecture Notes in Computer Science, 2001.
49. P. Madhusudan and P. Thiagarajan. A decidable class of asynchronous distributed controllers. In CONCUR'02, volume 2421 of Lecture Notes in Computer Science, 2002.
50. O. Maler and A. Pnueli. On recognizable timed languages. In FOSSACS'04, volume 2987 of Lecture Notes in Computer Science, pages 348-362, 2004.
51. D. Martin. Borel determinacy. Ann. Math., 102:363-371, 1975.
52. D. Martin. The determinacy of Blackwell games. The Journal of Symbolic Logic, 63(4):1565-1581, 1998.
53. R. McNaughton. Infinite games played on finite graphs. Ann. Pure and Applied Logic, 65:149-184, 1993.
54. S. Mohalik and I. Walukiewicz. Distributed games. In FSTTCS'03, volume 2914 of Lecture Notes in Computer Science, pages 338-351, 2003.
55. Y. Moschovakis. Descriptive Set Theory, volume 100 of Studies in Logic. North-Holand, 1980.
56. A. W. Mostowski. Regular expressions for infinite trees and a standard form of automata. In Fifth Symposium on Computation Theory, volume 208 of LNCS, pages 157-168, 1984.
57. A. W. Mostowski. Games with forbidden positions. Technical Report 78, University of Gdansk, 1991.
58. D. Niwinski and I. Walukiewicz. Games for μ-calculus. Theoretical Computer Science, 163:99-116, 1996.
59. C.-H. L. Ong. bservational equivalence of third-order idealized Algol is decidable. In LICS'02, pages 245-256, 2002.
60. A. Pnueli and R. Rosner. Distributed reactive systems are hard to synthesize. In 31th IEEE Symposium Foundations of Computer Science (FOCS 1990), pages 746-757, 1990.
61. M. Rabin. Randomized Byzantine generals. In FOCS'83, pages 403-409, 1983.
62. P. J. G. Ramadge and W. M. Wonham. The control of discrete event systems. Proceedings of the IEEE, 77(2):81-98, 1989.
63. T. Reps, S. Schwoon, and S. Jha. Weighted pushdown systems and their application to interprocedural dataflow analysis. In 10th Int. Static Analysis Symp., volume 2694 of Lecture Notes in Computer Science, pages 189-213, 2003.
64. S. Riedweg. Logiques pour le contrôle d'automatismes discrets. PhD thesis, Université de Rennes 1, December 2003.
65. S. Riedweg and S. Pinchinat. Quantified mu-calculus for control synthesis. In MFCS'03, volume 2747 of Lecture Notes in Computer Science, pages 642-651, 2003.
66. K. Rudie and W. Wonham. Think globally, act locally: Decentralized supervisory control. IEEE Trans. on Automat. Control, 37(11):1692-1708, 1992.
67. L. Santocanale. A calculus of circular proofs and its categorical semantics. In FOSSACS 02, volume 2303 of Lecture Notes in Computer Science, 2002.
68. L. Santocanale. Free μ-lattices. Journal of Pure and Applied Algebra, 168(2-3):227-264, 2002.
69. O. Serre. Games with winning conditions of high Borel complexity. In ICALP'04, Lecture Notes in Computer Science, 2004. to appear.
70. C. Stirling. Modal and Temporal Properties of Processes. Texts in Computer Science. Springer, 2001.
71. W. Thomas. On the synthesis of strategies in infinite games. In STAGS'95, volume 900 of Lecture Notes in Computer Science, pages 1-13, 1995.
72. S. Tripakis. Undecidable problems in decentralized observation and control for regular languages. Information Processing Letters, 90(1):21-28, 2004.
73. N. Wallmeier, P. Htten, and W. Thomas. Symbolic synthesis of finite-state controllers for request-response specifications. In Conference on the Implementation and Application of Automata, CIAA'00, volume 2759 of Lecture Notes in Computer Science, pages 11-22, 2003.
74. I. Walukiewicz. Model checking CTL properties of pushdown systems. In FSTTCS'00, volume 1974 of Lecture Notes in Computer Science, pages 127-138, 2000.
75. I. Walukiewicz. Pushdown processes: Games and model checking. Information and Computation, 164(2):234-263, 2001.
76. I. Walukiewicz. Deciding low levels of tree-automata hierarchy. In WoLLIC'02, volume 67 of ENTCS, 2002.
77. I. Walukiewicz. Local logics for traces. Journal of Automata, Languages and Combinatorics, 7(2):259-290, 2002.
78. W. Zielonka. Perfect-information stochastic parity games. In FOSSACS'04, volume 2987 of Lecture Notes in Computer Science, pages 499 - 513, 2004.