{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:39:52Z","timestamp":1725493192767},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441908"},{"type":"electronic","value":"9783540457572"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45757-7_54","type":"book-chapter","created":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T13:50:39Z","timestamp":1192888239000},"page":"565-565","source":"Crossref","is-referenced-by-count":0,"title":["Alternation"],"prefix":"10.1007","author":[{"given":"Moshe Y.","family":"Vardi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,20]]},"reference":[{"issue":"2","key":"54_CR1","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1145\/333979.333987","volume":"47","author":"O. Kupferman","year":"2000","unstructured":"O. Kupferman, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. Journal of the ACM, 47(2):312\u2013360, March 2000.","journal-title":"Journal of the ACM"},{"key":"54_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/3-540-61042-1_51","volume-title":"Games and modal \u03bc-calculus","author":"C. Stirling","year":"1996","unstructured":"C. Stirling. Games and modal \u03bc-calculus. In Proc. 13th Symp. on Theoretical Aspects of Computer Science, volume 1055 of Lecture Notes in Computer Science, pages 298\u2013312. Springer-Verlag, 1996."},{"key":"54_CR3","doi-asserted-by":"crossref","unstructured":"M.Y. Vardi. On the complexity of epistemic reasoning. In Proc. 4th IEEE Symp. on Logic in Computer Science, pages 243\u2013252, Asilomar, June 1989.","DOI":"10.1109\/LICS.1989.39179"},{"key":"54_CR4","doi-asserted-by":"crossref","unstructured":"M.Y. Vardi. Alternating automata-unifying truth and validity checking for temporal logics. In W. McCune, editor, Proc. 14th International Conference on Automated Deduction, volume 1249 of Lecture Notes in Artificial Intelligence, pages 191\u2013206. Springer-Verlag, Berlin, july 1997.","DOI":"10.1007\/3-540-63104-6_19"},{"key":"54_CR5","doi-asserted-by":"crossref","unstructured":"T. Wilke. Alternating tree automata, parity games, and modal \u03bc-calculus. Bull. Soc. Math. Belg., 8(2), May 2001.","DOI":"10.36045\/bbms\/1102714178"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45757-7_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T04:44:19Z","timestamp":1587962659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45757-7_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441908","9783540457572"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-45757-7_54","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}