{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:53:23Z","timestamp":1753894403286,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>In the timeline-based approach to planning, the evolution over time of a set\nof state variables (the timelines) is governed by a set of temporal\nconstraints. Traditional timeline-based planning systems excel at the\nintegration of planning with execution by handling temporal uncertainty. In\norder to handle general nondeterminism as well, the concept of timeline-based\ngames has been recently introduced. It has been proved that finding whether a\nwinning strategy exists for such games is 2EXPTIME-complete. However, a\nconcrete approach to synthesize controllers implementing such strategies is\nmissing. This paper fills this gap, by providing an effective and\ncomputationally optimal approach to controller synthesis for timeline-based\ngames.<\/jats:p>","DOI":"10.46298\/lmcs-20(3:17)2024","type":"journal-article","created":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T06:45:06Z","timestamp":1724741106000},"source":"Crossref","is-referenced-by-count":0,"title":["Controller Synthesis for Timeline-based Games"],"prefix":"10.46298","volume":"Volume 20, Issue 3","author":[{"given":"Renato","family":"Acampora","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Geatti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Gigante","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Montanari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentino","family":"Picotti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2024,8,27]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/14107\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/14107\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T06:45:16Z","timestamp":1724741116000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/11639"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,27]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-20(3:17)2024","relation":{"has-preprint":[{"id-type":"arxiv","id":"2307.12289v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2307.12289v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2307.12289","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2307.12289","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2024,8,27]]},"article-number":"11639"}}