{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:30:46Z","timestamp":1725798646907},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662445211"},{"type":"electronic","value":"9783662445228"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44522-8_10","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:12:23Z","timestamp":1407838343000},"page":"111-122","source":"Crossref","is-referenced-by-count":4,"title":["Alternating Parity Krivine Automata"],"prefix":"10.1007","author":[{"given":"Florian","family":"Bruse","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","first-page":"1","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society\u00a0141, 1\u201335 (1969)","journal-title":"Transactions of the American Mathematical Society"},{"issue":"1-6","key":"10_CR2","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J.R. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. Mathematical Logic Quarterly\u00a06(1-6), 66\u201392 (1960)","journal-title":"Mathematical Logic Quarterly"},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1145\/333979.333987","volume":"47","author":"O. Kupferman","year":"2000","unstructured":"Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. J. ACM\u00a047(2), 312\u2013360 (2000)","journal-title":"J. ACM"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Lange, M., Lozes, \u00c9., Guzm\u00e1n, M.V.: Model-checking process equivalences. In: Faella, M., Murano, A. (eds.) GandALF. EPTCS, vol.\u00a096, pp. 43\u201356 (2012)","DOI":"10.4204\/EPTCS.96.4"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Alur, R., Madhusudan, P.: Visibly pushdown languages. In: Babai, L. (ed.) STOC, pp. 202\u2013211. ACM (2004)","DOI":"10.1145\/1007352.1007390"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/978-3-540-30538-5_34","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"C. L\u00f6ding","year":"2004","unstructured":"L\u00f6ding, C., Madhusudan, P., Serre, O.: Visibly pushdown games. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol.\u00a03328, pp. 408\u2013420. Springer, Heidelberg (2004)"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/3-540-49116-3_48","volume-title":"STACS 99","author":"M. M\u00fcller-Olm","year":"1999","unstructured":"M\u00fcller-Olm, M.: A modal fixpoint logic with chop. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 510\u2013520. Springer, Heidelberg (1999)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/978-3-540-28644-8_33","volume-title":"CONCUR 2004 - Concurrency Theory","author":"M. Viswanathan","year":"2004","unstructured":"Viswanathan, M., Viswanathan, R.: A higher order modal fixed point logic. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 512\u2013528. Springer, Heidelberg (2004)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Axelsson, R., Lange, M., Somla, R.: The complexity of model checking higher-order fixpoint logic. Logical Methods in Computer Science\u00a03(2) (2007)","DOI":"10.2168\/LMCS-3(2:7)2007"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-16242-8_6","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"R. Axelsson","year":"2010","unstructured":"Axelsson, R., Hague, M., Kreutzer, S., Lange, M., Latte, M.: Extended computation tree logic. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol.\u00a06397, pp. 67\u201381. Springer, Heidelberg (2010)"},{"issue":"3","key":"10_CR11","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10990-007-9018-9","volume":"20","author":"J.L. Krivine","year":"2007","unstructured":"Krivine, J.L.: A call-by-name lambda-calculus machine. Higher-Order and Symbolic Computation\u00a020(3), 199\u2013207 (2007)","journal-title":"Higher-Order and Symbolic Computation"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-642-22012-8_12","volume-title":"Automata, Languages and Programming","author":"S. Salvati","year":"2011","unstructured":"Salvati, S., Walukiewicz, I.: Krivine machines and higher-order schemes. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 162\u2013173. Springer, Heidelberg (2011)"},{"issue":"9","key":"10_CR13","doi-asserted-by":"publisher","first-page":"1346","DOI":"10.1016\/j.ic.2006.05.001","volume":"204","author":"M. Lange","year":"2006","unstructured":"Lange, M.: The alternation hierarchy in fixpoint logic with chop is strict too. Inf. Comput.\u00a0204(9), 1346\u20131367 (2006)","journal-title":"Inf. Comput."},{"issue":"2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.2000.2894","volume":"164","author":"I. Walukiewicz","year":"2001","unstructured":"Walukiewicz, I.: Pushdown processes: Games and model-checking. Inf. Comput.\u00a0164(2), 234\u2013263 (2001)","journal-title":"Inf. Comput."},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-61604-7_58","volume-title":"CONCUR \u201996: Concurrency Theory","author":"J.C. Bradfield","year":"1996","unstructured":"Bradfield, J.C.: The modal mu-calculus alternation hierarchy is strict. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 233\u2013246. Springer, Heidelberg (1996)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Carayol, A., Serre, O.: Collapsible pushdown automata and labeled recursion schemes: Equivalence, safety and effective selection. In: LICS, pp. 165\u2013174. IEEE (2012)","DOI":"10.1109\/LICS.2012.73"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44522-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T14:39:19Z","timestamp":1558967959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44522-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662445211","9783662445228"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44522-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}