{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:32:24Z","timestamp":1743103944822,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153747"},{"type":"electronic","value":"9783642153754"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15375-4_21","type":"book-chapter","created":{"date-parts":[[2010,8,20]],"date-time":"2010-08-20T18:04:18Z","timestamp":1282327458000},"page":"297-312","source":"Crossref","is-referenced-by-count":3,"title":["Multipebble Simulations for Alternating Automata"],"prefix":"10.1007","author":[{"given":"Lorenzo","family":"Clemente","sequence":"first","affiliation":[]},{"given":"Richard","family":"Mayr","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Abdulla, P.A., Chen, Y.-F., Holik, L., Vojnar, T.: Mediating for reduction (on minimizing alternating B\u00fcchi automata). In: FSTTCS 2009, Dagstuhl, Germany. LIPIcs, vol.\u00a04, pp. 1\u201312 (2009)"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Clemente, L., Mayr, R.: Multipebble simulations for alternating automata. Technical Report EDI-INF-RR-1376, University of Edinburgh, School of Informatics (2010), http:\/\/www.inf.ed.ac.uk\/publications\/report\/1376.html","DOI":"10.1007\/978-3-642-15375-4_21"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/3-540-45694-5_10","volume-title":"CONCUR 2002 - Concurrency Theory","author":"K. Etessami","year":"2002","unstructured":"Etessami, K.: A hierarchy of polynomial-time computable simulations for automata. In: Brim, L., Jan\u0107ar, P., K\u0159et\u00ednsk\u00fd, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol.\u00a02421, pp. 131\u2013144. Springer, Heidelberg (2002)"},{"issue":"5","key":"21_CR4","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1137\/S0097539703420675","volume":"34","author":"K. Etessami","year":"2005","unstructured":"Etessami, K., Wilke, T., Schuller, R.A.: Fair simulation relations, parity games, and state space reduction for B\u00fcchi automata. SIAM J. Comput.\u00a034(5), 1159\u20131175 (2005)","journal-title":"SIAM J. Comput."},{"issue":"1-3","key":"21_CR5","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.tcs.2005.01.016","volume":"338","author":"C. Fritz","year":"2005","unstructured":"Fritz, C., Wilke, T.: Simulation relations for alternating B\u00fcchi automata. Theor. Comput. Sci.\u00a0338(1-3), 275\u2013314 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/800070.802177","volume-title":"STOC 1982: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing","author":"Y. Gurevich","year":"1982","unstructured":"Gurevich, Y., Harrington, L.: Trees, automata, and games. In: STOC 1982: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pp. 60\u201365. ACM, New York (1982)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-46419-0_21","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T.A. Henzinger","year":"2000","unstructured":"Henzinger, T.A., Rajamani, S.: Fair bisimulation. In: Schwartzbach, M.I., Graf, S. (eds.) TACAS 2000. LNCS, vol.\u00a01785, pp. 299\u2013314. Springer, Heidelberg (2000)"},{"key":"21_CR8","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional mu-calculus. Theor. Comput. Sci.\u00a027, 333\u2013354 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0304-3975(84)90049-5","volume":"32","author":"S. Miyano","year":"1984","unstructured":"Miyano, S., Hayashi, T.: Alternating finite automata on \u03c9-words. Theoretical Computer Science\u00a032, 321\u2013330 (1984)","journal-title":"Theoretical Computer Science"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/BFb0015261","volume-title":"Computer Science Today","author":"M.Y. Vardi","year":"1995","unstructured":"Vardi, M.Y.: Alternating automata and program verification. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol.\u00a01000, pp. 471\u2013485. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2010 - Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15375-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T21:12:07Z","timestamp":1740431527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15375-4_21"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153747","9783642153754"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15375-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}