Trading probability for Fairness

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

Volumn 2471, Issue , 2002, Pages 292-305

  Jurdziński, Marcin ^a   Kupferman, Orna ^b   Henzinger, Thomas A ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; COMMERCE; GAME THEORY; OPEN SYSTEMS; PROBABILITY;

ASYNCHRONOUS INTERACTION; BEHAVIORAL PROPERTIES; CONCURRENT PARITY GAMES; POSITIVE PROBABILITY; PROBABILISTIC GAMES; SYNCHRONOUS INTERACTIONS; THEORETICAL POINTS; WINNING CONDITIONS;

COMPUTER CIRCUITS;

EID: 34848862697     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45793-3_20     Document Type: Conference Paper

References (23)

1. [1] M. Abadi and L. Lamport. Composing specifications. ACM Transactions on Programming Languages and Systems, 15(1):73–132, 1993.
2. [2] L. de Alfaro, T.A. Henzinger, and F.Y.C. Mang. The control of synchronous systems. In C. Palamidessi, editor, CONCUR 00: Concurrency Theory, volume 1877 of Lecture Notes in Computer Science, pages 458–473. Springer-Verlag, 2000.
3. [3] L. de Alfaro, T.A. Henzinger, and F.Y.C. Mang. The control of synchronous systems, part II. In K. G. Larsen and M. Nielsen, editors, CONCUR 01: Concurrency Theory, volume 2154 of Lecture Notes in Computer Science. Springer-Verlag, 2001.
4. [4] Luca de Alfaro and Thomas A. Henzinger. Concurrent omega-regular games. In Proceedings of the 15th Annual Symposium on Logic in Computer Science, pages 141–154, Santa Barbara, California, 2000. IEEE Computer Society Press.
5. [5] Luca de Alfaro, Thomas A. Henzinger, and Orna Kupferman. Concurrent reachability games. In Proc. 39th IEEE Symposium on Foundations of Computer Science, October 1998.
6. [6] Luca de Alfaro, Thomas A. Henzinger, and Orna Kupferman. Concurrent reachability games. Technical Report UCB/ERL M98/33, University of California at Berkeley, 1998.
7. [7] R. Alur, T.A. Henzinger, and O. Kupferman. Alternating-time temporal logic. In Proc. 38th IEEE Symp. on Foundations of Computer Science, pages 100–109, Florida, October 1997.
8. [8] A. Browne, E. M. Clarke, S. Jha, D. E. Long, and W. Marrero. An improved algorithm for the evaluation of fixpoint expressions. Theoretical Computer Science, 178(1–2):237–255, May 1997. A preliminary version appeared in Proceedings of CAV’94, volume 818 of LNCS, Springer-Verlag.
9. [9] E.A. Emerson and C. S. Jutla. Tree automata, mu-calculus and determinacy (Extended abstract). In 32nd Annual Symposium on Foundations of Computer Science, pages 368–377, San Juan, Puerto Rico, 1–4 October 1991. IEEE Computer Society Press.
10. [10] E. Allen Emerson and Chin-Laung Lei. Efficient model checking in fragments of the propositional mu-calculus (Extended abstract). In Proceedings, Symposium on Logic in Computer Science, pages 267–278, Cambridge, Massachusetts, 16–18 June 1986. IEEE.
11. [11] D. Harel and A. Pnueli. On the development of reactive systems. In K. Apt, editor, Logics and Models of Concurrent Systems, volume F-13 of NATO Advanced Summer Institutes, pages 477–498. Springer-Verlag, 1985.
12. [12] Marcin Jurdziński. Small progress measures for solving parity games. In Horst Reichel and Sophie Tison, editors, STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings, volume 1770 of Lecture Notes in Computer Science, pages 290–301, Lille, France, February 2000. Springer-Verlag.
13. [13] O. Kupferman, P. Madhusudan, P. S. Thiagarajan, and M.Y. Vardi. Open systems in reactive environments: Control and synthesis. In Proc. 11th International Conference on Concurrency Theory, volume 1877 of Lecture Notes in Computer Science, pages 92–107. Springer-Verlag, 2000.
14. [14] O. Kupferman, M. Y. Vardi, and P. Wolper. Module checking. Information and Computation, 164:322–344, 2001.
15. [15] Robert McNaughton. Infinite games played on finite graphs. Annals of Pure and Applied Logic, 65(2):149–184, 1993.
16. [16] D.E. Muller, A. Saoudi, and P.E. Schupp. Alternating automata, the weak monadic theory of the tree and its complexity. In Proc. 13th International Colloquium on Automata, Languages and Programming, volume 226 of Lecture Notes in Computer Science. Springer-Verlag, 1986. 303
17. [17] Damian Niwiński. Private communication, 1996.
18. [18] A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th ACM Symp. on Principles of Programming Languages, pages 179–190, Austin, January 1989.
19. [19] P. J. G. Ramadge and W. M. Wonham. The control of discrete event systems. IEEE Transactions on Control Theory, 77:81–98, 1989.
20. [20] Helmut Seidl. Fast and simple nested fixpoints. Information Processing Letters, 59(6):303–308, September 1996.
21. [21] Wolfgang Thomas. Languages, automata, and logic. In Grzegorz Rozenberg and Arto Salomaa, editors, Handbook of Formal Language Theory, volume III, pages 389–455. Springer-Verlag, 1996.
22. [22] Jens Vöge and Marcin Jurdziński. A discrete strategy improvement algorithm for solving parity games (Extended abstract). In E. A. Emerson and A.P. Sistla, editors, Computer Aided Verification, 12th International Conference, CAV 2000, Proceedings, volume 1855 of Lecture Notes in Computer Science, pages 202–215, Chicago, IL, USA, July 2000. Springer-Verlag.
23. [23] Igor Walukiewicz. Pushdown processes: Games and model-checking. Information and Computation, 164(2):234–263, 2001.