{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:03:38Z","timestamp":1725577418585},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642180972"},{"type":"electronic","value":"9783642180989"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18098-9_24","type":"book-chapter","created":{"date-parts":[[2011,2,4]],"date-time":"2011-02-04T13:56:14Z","timestamp":1296827774000},"page":"222-230","source":"Crossref","is-referenced-by-count":3,"title":["Reachability Games on Automatic Graphs"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Neider","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/3-540-45657-0_5","volume-title":"Computer Aided Verification","author":"W. Thomas","year":"2002","unstructured":"Thomas, W.: Infinite games and verification. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 58\u201364. Springer, Heidelberg (2002)"},{"issue":"3","key":"24_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.entcs.2005.01.044","volume":"138","author":"P. Habermehl","year":"2005","unstructured":"Habermehl, P., Vojnar, T.: Regular model checking using inference of regular languages. Electr. Notes Theor. Comput. Sci.\u00a0138(3), 21\u201336 (2005)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-540-31980-1_4","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Vardhan","year":"2005","unstructured":"Vardhan, A., Sen, K., Viswanathan, M., Agha, G.: Using language inference to verify omega-regular properties. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 45\u201360. Springer, Heidelberg (2005)"},{"issue":"6","key":"24_CR4","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00224-004-1133-y","volume":"37","author":"A. Blumensath","year":"2004","unstructured":"Blumensath, A., Gr\u00e4del, E.: Finite presentations of infinite structures: Automata and interpretations. Theory Comput. Syst.\u00a037(6), 641\u2013674 (2004)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"24_CR5","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/s10009-004-0179-0","volume":"7","author":"R. Alur","year":"2005","unstructured":"Alur, R., Madhusudan, P., Nam, W.: Symbolic computational techniques for solving games. STTT\u00a07(2), 118\u2013128 (2005)","journal-title":"STTT"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Touili, T.: Regular model checking using widening techniques. Electr. Notes Theor. Comput. Sci.\u00a050(4) (2001)","DOI":"10.1016\/S1571-0661(04)00187-2"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/10722167_31","volume-title":"Computer Aided Verification","author":"A. Bouajjani","year":"2000","unstructured":"Bouajjani, A., Jonsson, B., Nilsson, M., Touili, T.: Regular model checking. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 403\u2013418. Springer, Heidelberg (2000)"},{"issue":"3","key":"24_CR8","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.tcs.2007.07.008","volume":"386","author":"L. Alfaro de","year":"2007","unstructured":"de Alfaro, L., Henzinger, T.A., Kupferman, O.: Concurrent reachability games. Theor. Comput. Sci.\u00a0386(3), 188\u2013217 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"24_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput.\u00a075(2), 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-642-14295-6_32","volume-title":"Computer Aided Verification","author":"B. Bollig","year":"2010","unstructured":"Bollig, B., Katoen, J.P., Kern, C., Leucker, M., Neider, D., Piegdon, D.R.: libalf: The Automata Learning Framework. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol.\u00a06174, pp. 360\u2013364. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18098-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T10:18:31Z","timestamp":1559989111000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18098-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642180972","9783642180989"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18098-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}