{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T18:51:54Z","timestamp":1768416714576,"version":"3.49.0"},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3735,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0304-3975(02)00442-5","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T23:26:12Z","timestamp":1049498772000},"page":"7-34","source":"Crossref","is-referenced-by-count":138,"title":["Games for synthesis of controllers with partial observation"],"prefix":"10.1016","volume":"303","author":[{"given":"A.","family":"Arnold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Vincent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Walukiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00442-5_BIB1","unstructured":"A. Arnold, D. Niwi\u0144ski, Rudiments of \u03bc-Calculus, Studies in Logic and the Foundations of Mathematics, Vol. 146, Elsevier, Amsterdam, 2001."},{"key":"10.1016\/S0304-3975(02)00442-5_BIB2","first-page":"555","article-title":"A unified approach to control problems in discrete event processes","volume":"27","author":"Bergeron","year":"1993","journal-title":"RAIRO-ITA"},{"key":"10.1016\/S0304-3975(02)00442-5_BIB3","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.2307\/2273681","article-title":"State strategies for games in F\u03c3\u03b4\u2229 G\u03b4\u03c3","volume":"48","author":"B\u00fcchi","year":"1983","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(02)00442-5_BIB4","series-title":"Introduction to Discrete Event Systems","author":"Cassandras","year":"1999"},{"key":"10.1016\/S0304-3975(02)00442-5_BIB5","doi-asserted-by":"crossref","unstructured":"E.A. Emerson, C.S. Jutla, The complexity of tree automata and logics of programs, in: Proc. 29th FOCS, 1988.","DOI":"10.1109\/SFCS.1988.21949"},{"key":"10.1016\/S0304-3975(02)00442-5_BIB6","doi-asserted-by":"crossref","unstructured":"Y. Gurevich, L. Harrington, Trees, automata and games, in: Proc. 14th ACM Symp. on Theory of Computations, 1982, pp. 60\u201365.","DOI":"10.1145\/800070.802177"},{"issue":"8","key":"10.1016\/S0304-3975(02)00442-5_BIB7","article-title":"A polynomial time algorithm for diagnosability of discrete event systems","volume":"46","author":"Jiang","year":"2001","journal-title":"IEEE Trans. Automat. Control"},{"key":"10.1016\/S0304-3975(02)00442-5_BIB8","series-title":"Modeling and Control of Logical Discrete Event Systems","author":"Kumar","year":"1995"},{"key":"10.1016\/S0304-3975(02)00442-5_BIB9","unstructured":"O. Kupferman, M. Vardi, Synthesis with incomplete information, in: Proc. Second Internat. Conf. on Temporal Logic, 1997, pp. 91\u2013106."},{"key":"10.1016\/S0304-3975(02)00442-5_BIB10","doi-asserted-by":"crossref","unstructured":"O. Kupferman, M. Vardi, \u03bc-calculus synthesis, in: Proc. MFCS 2000, Lecture Notes in Computer Science, Vol. 1893, 2000, pp. 497\u2013507.","DOI":"10.1007\/3-540-44612-5_45"},{"key":"10.1016\/S0304-3975(02)00442-5_BIB11","doi-asserted-by":"crossref","unstructured":"H. Lamouchi, J.G. Thistle, Effective control synthesis for DES under partial observations, in: Proc. 39th IEEE Conf. on Decision and Control, December 2000.","DOI":"10.1109\/CDC.2000.912726"},{"key":"10.1016\/S0304-3975(02)00442-5_BIB12","series-title":"Proc. STACS\u201995","first-page":"229","article-title":"On the synthesis of discrete controllers for timed systems","volume":"Vol. 900","author":"Maler","year":"1995"},{"key":"10.1016\/S0304-3975(02)00442-5_BIB13","doi-asserted-by":"crossref","unstructured":"A. Pnueli, R. Rosner, Distributed reactive systems are hard to synthesize, in: Proc. 31th IEEE Symp. on Foundations of Computer Science (FOCS 1990), 1990, pp. 746\u2013757.","DOI":"10.1109\/FSCS.1990.89597"},{"key":"10.1016\/S0304-3975(02)00442-5_BIB14","doi-asserted-by":"crossref","DOI":"10.1109\/5.21072","article-title":"The control of discrete event systems","volume":"77","author":"Ramadge","year":"1989","journal-title":"Proc. IEEE"},{"issue":"11","key":"10.1016\/S0304-3975(02)00442-5_BIB15","doi-asserted-by":"crossref","first-page":"1692","DOI":"10.1109\/9.173140","article-title":"Think globally, act locally","volume":"37","author":"Rudie","year":"1992","journal-title":"IEEE Trans. Automat. Control"},{"issue":"9","key":"10.1016\/S0304-3975(02)00442-5_BIB16","doi-asserted-by":"crossref","first-page":"1555","DOI":"10.1109\/9.412626","article-title":"Diagnosability of discrete event systems","volume":"40","author":"Sampath","year":"1995","journal-title":"IEEE Trans. Automat. Control"},{"key":"10.1016\/S0304-3975(02)00442-5_BIB17","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0020-0190(96)00130-5","article-title":"Fast and simple nested fixpoints","volume":"59","author":"Seidl","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(02)00442-5_BIB18","article-title":"Languages, automata, and logic","volume":"Vol. 3","author":"Thomas","year":"1997"},{"key":"10.1016\/S0304-3975(02)00442-5_BIB19","doi-asserted-by":"crossref","unstructured":"S. Tripakis, Undecidable problems of decentralized observation and control, in: IEEE Conf. on Decision and Control, 2001.","DOI":"10.1109\/.2001.980822"},{"key":"10.1016\/S0304-3975(02)00442-5_BIB20","unstructured":"A. Vincent, Synth\u00e9se de contr\u00f4leurs et strat\u00e9gies gagnantes dans les jeux de partit\u00e9, in: MSR2001, 2001, to appear."},{"key":"10.1016\/S0304-3975(02)00442-5_BIB21","doi-asserted-by":"crossref","unstructured":"J. V\u00f6ge, M. Jurdzi\u0144ski, A discrete strategy improvement algorithm for solving parity games, in: Proc. CAV 2000, 2000, pp. 202\u2013215.","DOI":"10.1007\/10722167_18"},{"key":"10.1016\/S0304-3975(02)00442-5_BIB22","unstructured":"T. Yoo, S. Lafortune, On the computational complexity of some problems arising in partially-observed discrete-event systems, in: American Control Conf. 2001, 2001."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004425?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004425?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T22:52:39Z","timestamp":1553381559000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502004425"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0304397502004425"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00442-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}