{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:10:37Z","timestamp":1737436237939,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442400"},{"type":"electronic","value":"9783540457930"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45793-3_20","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T12:03:26Z","timestamp":1187265806000},"page":"292-305","source":"Crossref","is-referenced-by-count":4,"title":["Trading Probability for Fairness"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Jurdzi\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Orna","family":"Kupferman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/151646.151649","volume":"15","author":"M. Abadi","year":"1993","unstructured":"M. Abadi and L. Lamport. Composing specifications. ACM Transactions on Programming Languages and Systems, 15(1):73\u2013132, 1993.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"20_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/3-540-44618-4_33","volume-title":"CONCUR 00: Concurrency Theory","author":"L. Alfaro de","year":"2000","unstructured":"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\u2013473. Springer-Verlag, 2000."},{"key":"20_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-44804-7","volume-title":"CONCUR 01: Concurrency Theory","author":"L. Alfaro de","year":"2001","unstructured":"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."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"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\u2013154, Santa Barbara, California, 2000. IEEE Computer Society Press.","DOI":"10.1109\/LICS.2000.855763"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Luca de Alfaro, Thomas A. Henzinger, and Orna Kupferman. Concurrent reachability games. In Proc. 39th IEEE Symposium on Foundations of Computer Science, October 1998.","DOI":"10.1109\/SFCS.1998.743507"},{"key":"20_CR6","unstructured":"Luca de Alfaro, Thomas A. Henzinger, and Orna Kupferman. Concurrent reachability games. Technical Report UCB\/ERL M98\/33, University of California at Berkeley, 1998."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time temporal logic. In Proc. 38th IEEE Symp. on Foundations of Computer Science, pages 100\u2013109, Florida, October 1997.","DOI":"10.1109\/SFCS.1997.646098"},{"key":"20_CR8","series-title":"Lect Notes Comput Sci","first-page":"237","volume-title":"Theoretical Computer Science","author":"A. Browne","year":"1997","unstructured":"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\u2013255, May 1997. A preliminary version appeared in Proceedings of CAV\u201994, volume 818 of LNCS, Springer-Verlag."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"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\u2013377, San Juan, Puerto Rico, 1-4 October 1991. IEEE Computer Society Press.","DOI":"10.1109\/SFCS.1991.185392"},{"key":"20_CR10","unstructured":"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\u2013278, Cambridge, Massachusetts, 16-18 June 1986. IEEE."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"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\u2013498. Springer-Verlag, 1985.","DOI":"10.1007\/978-3-642-82453-1_17"},{"key":"20_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/3-540-46541-3_24","volume-title":"STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings","author":"M. Jurdzi\u0144ski","year":"2000","unstructured":"Marcin Jurdzi\u0144ski. 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\u2013301, Lille, France, February 2000. Springer-Verlag."},{"key":"20_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/3-540-44618-4_9","volume-title":"Proc. 11th International Conference on Concurrency Theory","author":"O. Kupferman","year":"2000","unstructured":"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\u2013107. Springer-Verlag, 2000."},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1006\/inco.2000.2893","volume":"164","author":"O. Kupferman","year":"2001","unstructured":"O. Kupferman, M. Y. Vardi, and P. Wolper. Module checking. Information and Computation, 164:322\u2013344, 2001.","journal-title":"Information and Computation"},{"issue":"2","key":"20_CR15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","volume":"65","author":"R. McNaughton","year":"1993","unstructured":"Robert McNaughton. Infinite games played on finite graphs. Annals of Pure and Applied Logic, 65(2):149\u2013184, 1993.","journal-title":"Annals of Pure and Applied Logic"},{"key":"20_CR16","series-title":"Lect Notes Comput Sci","volume-title":"Proc. 13th International Colloquium on Automata, Languages and Programming","author":"D. E. Muller","year":"1986","unstructured":"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."},{"key":"20_CR17","unstructured":"Damian Niwi\u0144ski. Private communication, 1996."},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th ACM Symp. on Principles of Programming Languages, pages 179\u2013190, Austin, January 1989.","DOI":"10.1145\/75277.75293"},{"key":"20_CR19","first-page":"81","volume":"77","author":"P. J. G. Ramadge","year":"1989","unstructured":"P. J. G. Ramadge and W.M. Wonham. The control of discrete event systems. IEEE Transactions on Control Theory, 77:81\u201398, 1989.","journal-title":"IEEE Transactions on Control Theory"},{"issue":"6","key":"20_CR20","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0020-0190(96)00130-5","volume":"59","author":"Helmut Seidl","year":"1996","unstructured":"Helmut Seidl. Fast and simple nested fixpoints. Information Processing Letters, 59(6):303\u2013308, September 1996.","journal-title":"Information Processing Letters"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Wolfgang Thomas. Languages, automata, and logic. In Grzegorz Rozenberg and Arto Salomaa, editors, Handbook of Formal Language Theory, volume III, pages 389\u2013455. Springer-Verlag, 1996.","DOI":"10.1007\/978-3-642-59126-6_7"},{"key":"20_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/10722167_18","volume-title":"Computer Aided Verification, 12th International Conference, CAV 2000, Proceedings","author":"J. V\u0151ge","year":"2000","unstructured":"Jens V\u0151ge and Marcin Jurdzi\u0144ski. 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\u2013215, Chicago, IL, USA, July 2000. Springer-Verlag."},{"issue":"2","key":"20_CR23","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.2000.2894","volume":"164","author":"I. Walukiewicz","year":"2001","unstructured":"Igor Walukiewicz. Pushdown processes: Games and model-checking. Information and Computation, 164(2):234\u2013263, 2001.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45793-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T11:39:33Z","timestamp":1737373173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45793-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442400","9783540457930"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-45793-3_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}