{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:59:48Z","timestamp":1725454788200},"reference-count":11,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/time.2003.1214889","type":"proceedings-article","created":{"date-parts":[[2004,1,24]],"date-time":"2004-01-24T04:33:03Z","timestamp":1074918783000},"page":"137-146","source":"Crossref","is-referenced-by-count":1,"title":["Towards symbolic strategy synthesis for >>A<<-LTL"],"prefix":"10.1109","author":[{"given":"A.","family":"Harding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Ryan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.-Y.","family":"Schobbens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","first-page":"267","article-title":"Efficient model checking in fragments of the mu-calculus","author":"emerson","year":"1986","journal-title":"IEEE Symposium on Logic in Computer Science"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58179-0_72"},{"key":"ref10","first-page":"322","article-title":"An automata-theoretic approach to automatic program verification","author":"vardi","year":"1986","journal-title":"Proceedings of the IEEE Symposium on Logic in Computer Science"},{"key":"ref6","first-page":"1","article-title":"Symbolic model checking: 1020 states and beyond","author":"burch","year":"1990","journal-title":"Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science"},{"year":"0","author":"mocha","key":"ref11"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(84)80047-9"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3190-6"},{"key":"ref7","first-page":"91","article-title":"Synthesis with incomplete informatio (sic)","author":"kupferman","year":"1997","journal-title":"Proc 2nd Int Conf Temporal Logic"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00618-7"},{"journal-title":"Complexity of Automata on Infinite Objects","year":"1989","author":"safra","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646098"}],"event":{"name":"10th International Symposium on Temporal Representation and Reasoning and Fourth International Conference on Temporal Logic. TIME-ICTL 2003","acronym":"TIME-03","location":"Cairns, Qld., Australia"},"container-title":["10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8624\/27321\/01214889.pdf?arnumber=1214889","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T18:34:29Z","timestamp":1489430069000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1214889\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/time.2003.1214889","relation":{},"subject":[]}}