{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:20:14Z","timestamp":1743074414542,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319114385"},{"type":"electronic","value":"9783319114392"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11439-2_8","type":"book-chapter","created":{"date-parts":[[2014,9,15]],"date-time":"2014-09-15T01:30:11Z","timestamp":1410744611000},"page":"98-111","source":"Crossref","is-referenced-by-count":3,"title":["Synthesising Succinct Strategies in Safety and Reachability Games"],"prefix":"10.1007","author":[{"given":"Gilles","family":"Geeraerts","sequence":"first","affiliation":[]},{"given":"Jo\u00ebl","family":"Goossens","sequence":"additional","affiliation":[]},{"given":"Am\u00e9lie","family":"Stainer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.: A theory of timed automata. TCS\u00a0126(2), 183\u2013235 (1994)","journal-title":"TCS"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BFb0055622","volume-title":"CONCUR \u201998 Concurrency Theory","author":"R. Alur","year":"1998","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O., Vardi, M.Y.: Alternating refinement relations. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 163\u2013178. Springer, Heidelberg (1998)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-642-19805-2_17","volume-title":"Foundations of Software Science and Computational Structures","author":"N. Bertrand","year":"2011","unstructured":"Bertrand, N., Stainer, A., J\u00e9ron, T., Krichen, M.: A game approach to determinize timed automata. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol.\u00a06604, pp. 245\u2013259. Springer, Heidelberg (2011)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-15781-3_20","volume-title":"Algorithms \u2013 ESA 2010","author":"V. Bonifaci","year":"2010","unstructured":"Bonifaci, V., Marchetti-Spaccamela, A.: Feasibility analysis of sporadic real-time multiprocessor task systems. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part II. LNCS, vol.\u00a06347, pp. 230\u2013241. Springer, Heidelberg (2010)"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/1967631","volume":"3","author":"C. Bouton","year":"1902","unstructured":"Bouton, C.: Nim, a game with a complete mathematical theory. Ann. Math.\u00a03, 35\u201339 (1902)","journal-title":"Ann. Math."},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/11539452_9","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"F. Cassez","year":"2005","unstructured":"Cassez, F., David, A., Fleury, E., Larsen, K.G., Lime, D.: Efficient on-the-fly algorithms for the analysis of timed games. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 66\u201380. Springer, Heidelberg (2005)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-12002-2_2","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L. Doyen","year":"2010","unstructured":"Doyen, L., Raskin, J.-F.: Antichain algorithms for finite automata. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 2\u201322. Springer, Heidelberg (2010)"},{"issue":"3","key":"8_CR8","first-page":"261","volume":"39","author":"E. Filiot","year":"2011","unstructured":"Filiot, E., Jin, N., Raskin, J.: Antichains and compositional algorithms for LTL synthesis. FMSD\u00a039(3), 261\u2013296 (2011)","journal-title":"FMSD"},{"issue":"2","key":"8_CR9","first-page":"171","volume":"49","author":"G. Geeraerts","year":"2013","unstructured":"Geeraerts, G., Goossens, J., Lindstr\u00f6m, M.: Multiprocessor schedulability of arbitrary-deadline sporadic tasks: complexity and antichain algorithm. RTS\u00a049(2), 171\u2013218 (2013)","journal-title":"RTS"},{"key":"8_CR10","unstructured":"Geeraerts, G., Goossens, J., Stainer, A.: Computing succinct strategies in safety games. CoRR abs\/1404.6228, \n                    http:\/\/arxiv.org\/abs\/1404.6228"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-642-24372-1_22","volume-title":"Automated Technology for Verification and Analysis","author":"D. Neider","year":"2011","unstructured":"Neider, D.: Small Strategies for Safety Games. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol.\u00a06996, pp. 306\u2013320. Springer, Heidelberg (2011)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-78800-3_6","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M. De Wulf","year":"2008","unstructured":"De Wulf, M., Doyen, L., Maquet, N., Raskin, J.-F.: Antichains: Alternative algorithms for LTL satisfiability and model-checking. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 63\u201377. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11439-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T11:05:12Z","timestamp":1676891112000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11439-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319114385","9783319114392"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11439-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}