{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:25:30Z","timestamp":1729657530602,"version":"3.28.0"},"reference-count":78,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1109\/lics.2004.1319630","type":"proceedings-article","created":{"date-parts":[[2004,11,12]],"date-time":"2004-11-12T19:14:14Z","timestamp":1100286854000},"page":"356-366","source":"Crossref","is-referenced-by-count":13,"title":["A landscape with games in the background"],"prefix":"10.1109","author":[{"given":"I.","family":"Walukiewicz","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"78","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24727-2_35"},{"key":"77","first-page":"259","article-title":"Local logics for traces","volume":"7","author":"walukiewicz","year":"2002","journal-title":"Journal of Automata Languages and Combinatorics"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24749-4_2"},{"key":"36","first-page":"580","article-title":"The regular real-time languages","volume":"1443","author":"henzinger","year":"1998","journal-title":"ICALP'98 Volume 1443 of Lecture Notes in Computer Science"},{"journal-title":"Parity and Explosion Games on Context-free Graphs","year":"2003","author":"gimbert","key":"33"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24749-4_2"},{"key":"39","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4190-4","volume":"156","author":"kechris","year":"1995","journal-title":"Classical Descriptive Set Theory Volume 156 of Graduate Texts in Mathematics"},{"key":"37","first-page":"422","article-title":"A framework for decidable metrical logics","volume":"1664","author":"hirshfeld","year":"1999","journal-title":"ICALP'99 Volume 1664 of Lecture Notes in Computer Science"},{"key":"38","first-page":"172","article-title":"Quantitative temporal logic","volume":"1683","author":"hirshfeld","year":"1999","journal-title":"CSL'99 Volume 1683 of Lecture Notes in Computer Science"},{"key":"43","doi-asserted-by":"publisher","DOI":"10.1145\/333979.333987"},{"key":"42","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2001.932514"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-2217-1"},{"key":"40","first-page":"205","article-title":"Higher-order pushdown trees are easy","volume":"2303","author":"knapik","year":"2002","journal-title":"FoSSaCS' 02 Volume 2303 of Lecture Notes in Computer Science"},{"key":"67","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45931-6_25"},{"key":"66","doi-asserted-by":"publisher","DOI":"10.1109\/9.173140"},{"key":"69","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27836-8_95"},{"key":"68","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-4049(01)00098-6"},{"journal-title":"On the Positional Determinacy of Edge-labeled Games","year":"2004","author":"colcombet","key":"22"},{"key":"23","first-page":"102","article-title":"Quantitative verification and control via the mu-calculus","volume":"2761","author":"de alfaro","year":"2003","journal-title":"CONCUR volume 2761 Lecture Notes in Computer Science"},{"key":"24","first-page":"142","article-title":"The element of surprise in timed games","volume":"2761","author":"de alfaro","year":"2003","journal-title":"CONCUR volume 2761 Lecture Notes in Computer Science"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380871"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24698-5_27"},{"key":"27","first-page":"571","article-title":"Timed control synthesis for external specifications","volume":"2285","author":"d'souza","year":"2002","journal-title":"STACS'02 Volume 2285 of Lecture Notes in Computer Sciences"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185392"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808767"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00173-4"},{"key":"2","first-page":"421","article-title":"Applying game semantics to compositional software modeling and verification","volume":"2988","author":"abramsky","year":"2004","journal-title":"TACAS'04 Volume 2988 of Lecture Notes in Computer Science"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45220-1_1"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00442-5"},{"key":"30","first-page":"14","article-title":"An automata-theoretic approach to interprocedural data-flow analysis","volume":"1578","author":"esparza","year":"1999","journal-title":"FOSSACS'99 Volume 1578 of Lecture Notes in Computer Science"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36576-1_5"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1051\/ita:1999121"},{"key":"32","article-title":"The consensus problem in unreliable distributed systems (a brief survey)","author":"fisher","year":"1983","journal-title":"Proc International Conference on Foundations of Computation"},{"key":"4","doi-asserted-by":"crossref","DOI":"10.1145\/1007352.1007390","article-title":"Visibly pushdown languages","author":"alur","year":"2004","journal-title":"STOC'04"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-5203-4_5"},{"key":"70","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3550-5","author":"stirling","year":"2001","journal-title":"Modal and Temporal Properties of Processes"},{"key":"71","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-59042-0_57","article-title":"On the synthesis of strategies in infinite games","volume":"900","author":"thomas","year":"1995","journal-title":"STAGS'95 Volume 900 of Lecture Notes in Computer Science"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(92)90073-9"},{"key":"72","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.01.004"},{"key":"8","first-page":"469","article-title":"Contrloller synthesis for timed automata","author":"asarin","year":"1998","journal-title":"Proc IFAC Symp System Structure and Control"},{"key":"73","first-page":"11","article-title":"Symbolic synthesis of finite-state controllers for request-response specifications","volume":"2759","author":"wallmeier","year":"2003","journal-title":"Conference on the Implementation and Application of Automata CIAA'00 Volume 2759 of Lecture Notes in Computer Science"},{"key":"74","first-page":"127","article-title":"Model checking CTL properties of pushdown systems","volume":"1974","author":"walukiewicz","year":"2000","journal-title":"FSTTCS'00 Volume 1974 of Lecture Notes in Computer Science"},{"key":"75","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2894"},{"key":"76","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80541-3"},{"key":"59","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2002.1029833"},{"key":"58","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00136-0"},{"key":"57","article-title":"Games with forbidden positions","volume":"78","author":"mostowski","year":"1991","journal-title":"Technical Report"},{"key":"56","first-page":"157","article-title":"Regular expressions for infinite trees and a standard form of automata","volume":"208","author":"mostowski","year":"1984","journal-title":"Fifth Symposium on Computation Theory Volume 208 of LNCS"},{"key":"19","first-page":"165","article-title":"On infinite terms having a decidable monadic theory","volume":"2420","author":"caucal","year":"2002","journal-title":"MFCS'02 Volume 2420 of Lecture Notes in Computer Science"},{"key":"55","volume":"100","author":"moschovakis","year":"1980","journal-title":"Descriptive Set Theory Volume 100 of Studies in Logic"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4070-7"},{"key":"18","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/3-540-45873-5_13","article-title":"A comparison of control problems for timed and hybrid systems","author":"cassez","year":"2002","journal-title":"Hybrid Systems Computation and Control (HSCC 02)"},{"journal-title":"Complexity of Games on Higher-order Pushdown Automata","year":"2004","author":"cachat","key":"15"},{"key":"16","first-page":"112","article-title":"The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata","volume":"2914","author":"carayol","year":"2003","journal-title":"FSTTCS'03 Volume 2914 of Lecture Notes in Computer Science"},{"key":"13","first-page":"556","article-title":"Higher order pushdown automata, the Caucal hierarchy of graphs and parity games","volume":"2719","author":"cachat","year":"2003","journal-title":"ICALP'03 Volume 2719 of Lecture Notes in Computer Science"},{"key":"14","first-page":"322","article-title":"Solving pushdown games with a sigma-3 winning condition","volume":"2471","author":"cachat","year":"2002","journal-title":"CSL'02 Volume 2471 of Lecture Notes in Computer Science"},{"key":"11","first-page":"180","article-title":"Timed control with partial observability","volume":"2725","author":"bouyer","year":"2003","journal-title":"CSL'03 Volume 2725 of Lecture Notes in Computer Science"},{"key":"12","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0304-3975(97)00217-X","article-title":"The modal mu-calculus alternation hierarchy is strict","volume":"195","author":"bradfield","year":"1997","journal-title":"Theoretical Computer Science"},{"key":"21","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1109\/TSE.1985.232245","article-title":"a simple and efficient randomized byzantine agreement algorithm","volume":"se 11","author":"chor","year":"1985","journal-title":"IEEE Transactions on Software Engineering"},{"key":"20","article-title":"Quantitative stochastic parity games","author":"chatterjee","year":"2004","journal-title":"SODA'04"},{"journal-title":"Logiques pour le Contro?le D'automatismes Discrets","year":"2003","author":"riedweg","key":"64"},{"key":"65","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45138-9_58"},{"key":"62","doi-asserted-by":"publisher","DOI":"10.1109\/5.21072"},{"key":"63","first-page":"189","article-title":"Weighted pushdown systems and their application to interprocedural dataflow analysis","volume":"2694","author":"reps","year":"2003","journal-title":"10th Int Static Analysis Symp Volume 2694 of Lecture Notes in Computer Science"},{"key":"60","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89597"},{"key":"61","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.48"},{"key":"49","article-title":"A decidable class of asynchronous distributed controllers","volume":"2421","author":"madhusudan","year":"2002","journal-title":"CONCUR'02 Volume 2421 of Lecture Notes in Computer Science"},{"key":"48","article-title":"Distributed control and synthesis for local specifications","volume":"2076","author":"madhusudan","year":"2001","journal-title":"ICALP'01 Volume 2076 of Lecture Notes in Computer Science"},{"key":"45","first-page":"280","article-title":"Model-checking infinite state systems generated by ground tree rewriting","volume":"2303","author":"lo?ding","year":"2002","journal-title":"FoSSaCS' 02 Volume 2303 of Lecture Notes in Computer Science"},{"key":"44","doi-asserted-by":"publisher","DOI":"10.1109\/9.61009"},{"journal-title":"Control and Synthesis of Open Reactive Systems","year":"2001","author":"madhusudan","key":"47"},{"journal-title":"Infinite Graphs Generated by Tree Rewriting","year":"2003","author":"lo?ding","key":"46"},{"key":"10","first-page":"88","article-title":"Pushdown games with the unboundedness and regular conditions","volume":"2914","author":"bouquet","year":"2003","journal-title":"FSTTCS'03 Volume 2914 of Lecture Notes in Computer Science"},{"key":"51","doi-asserted-by":"publisher","DOI":"10.2307\/1971035"},{"key":"52","doi-asserted-by":"publisher","DOI":"10.2307\/2586667"},{"key":"53","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(93)90036-D"},{"key":"54","first-page":"338","article-title":"Distributed games","volume":"2914","author":"mohalik","year":"2003","journal-title":"FSTTCS'03 Volume 2914 of Lecture Notes in Computer Science"},{"key":"50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24727-2_25"}],"event":{"name":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.","start":{"date-parts":[[2004,7,17]]},"location":"Turku, Finland","end":{"date-parts":[[2004,7,17]]}},"container-title":["Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9221\/29239\/01319630.pdf?arnumber=1319630","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T05:27:09Z","timestamp":1545370029000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1319630\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"references-count":78,"URL":"https:\/\/doi.org\/10.1109\/lics.2004.1319630","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}