{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:23:10Z","timestamp":1776316990849,"version":"3.50.1"},"reference-count":21,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1051\/ita:2002013","type":"journal-article","created":{"date-parts":[[2003,11,14]],"date-time":"2003-11-14T16:55:04Z","timestamp":1068828904000},"page":"261-275","source":"Crossref","is-referenced-by-count":51,"title":["Permissive strategies: from parity games to safety games"],"prefix":"10.1051","volume":"36","author":[{"given":"Julien","family":"Bernet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Janin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Walukiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2002,12,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"A. Arnold, A. Vincent and I. Walukiewicz, Games for synthesis of controllers with partial observation.Theoret. Comput. Sci.(to appear).","DOI":"10.1016\/S0304-3975(02)00442-5"},{"key":"R2","first-page":"555","volume":"27","author":"Bergeron","year":"1993","journal-title":"RAIRO: Theoret. Informatics Appl."},{"key":"R3","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.2307\/2273681","volume":"48","author":"Buchi","year":"1983","journal-title":"J. Symbolic Logic"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"C.G. Cassandras and S. Lafortune,Introduction to Discrete Event Systems. KluwerAcademic Publishers (1999).","DOI":"10.1007\/978-1-4757-4070-7"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"S. Dziembowski, M. Jurdzinski and I. Walukiewicz, How much memory is needed to win infinite games, inLICS(1997) 99-110.","DOI":"10.1109\/LICS.1997.614939"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"E.A. Emerson, C. Jutla and A. Sistla, On model-checking for fragments of \u00b5-calculus, inCAV'93. Springer,Lecture Notes in Comput. Sci.697(1993) 385-396.","DOI":"10.1007\/3-540-56922-7_32"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"E.A. Emerson and C.S. Jutla, Tree automata, mu-calculus and determinacy, inProc. FOCS 91(1991) 368-377.","DOI":"10.1109\/SFCS.1991.185392"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"O. Grumberg, T. Heyman and A. Schusterk, Distributed symbolic model checking for mu-calculus, inCAV'01. Springer,Lecture Notes in Comput. Sci.2102(2001).","DOI":"10.1007\/3-540-44585-4_32"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"Y. Gurevich and L. Harrington, Trees, automata and games, in14th ACM Symp. on Theory of Computations(1982) 60-65.","DOI":"10.1145\/800070.802177"},{"key":"R10","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0020-0190(98)00150-1","volume":"68","author":"Jurdzinski","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"R11","doi-asserted-by":"crossref","unstructured":"M. Jurdzinski, Small progress measures for solving parity games, inSTACS. Springer,Lecture Notes in Comput. Sci.1770(2000) 290-301.","DOI":"10.1007\/3-540-46541-3_24"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"O. Kupferman, M.Y. Vardi and P. Wolper, An automata-theoretic approach to branching-time model checking.J. ACM47(2000).","DOI":"10.1145\/333979.333987"},{"key":"R13","unstructured":"A.W. Mostowski, Regular expressions for infinite trees and a standard form of automata, edited by A. Skowron, inFifth Symposium on Computation Theory. Springer,Lecture Notes in Comput. Sci.208(1984) 157-168."},{"key":"R14","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0304-3975(91)90283-8","volume":"83","author":"Mostowski","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"R15","doi-asserted-by":"crossref","unstructured":"P.J.G. Ramadge and W.M. Wonham, The control of discrete event systems.Proc. of IEEE77(1989).","DOI":"10.1109\/5.21072"},{"key":"R16","doi-asserted-by":"crossref","unstructured":"W. Thomas,Automata on infinite objects, edited by J. van Leeuven. Elsevier,Handb. Theoret. Comput. Sci.B(1990) 133-192.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"R17","doi-asserted-by":"crossref","unstructured":"W. Thomas, On the synthesis of strategies in infinite games, inSTACS '95. Springer,Lecture Notes in Comput. Sci.900(1995) 1-13.","DOI":"10.1007\/3-540-59042-0_57"},{"key":"R18","doi-asserted-by":"crossref","unstructured":"W. Thomas,Languages, automata, and logic, edited by G. Rozenberg and A. Salomaa. Springer-Verlag,Handbook Formal Languages3(1997).","DOI":"10.1007\/978-3-642-59126-6_7"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"J. V\u00f6ge and M. Jurdzinski, A discrete strategy improvement algorithm for solving parity games (Extended abstract), inCAV. Springer,Lecture Notes in Comput. Sci.1855(2000) 202-215.","DOI":"10.1007\/10722167_18"},{"key":"R20","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","volume":"200","author":"Zielonka","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"R21","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","volume":"158","author":"Zwick","year":"1996","journal-title":"Theoret. Comput. Sci."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2002013\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T11:03:46Z","timestamp":1734174226000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2002013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":21,"journal-issue":{"issue":"3"},"alternative-id":["ita0204"],"URL":"https:\/\/doi.org\/10.1051\/ita:2002013","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}