{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T20:38:25Z","timestamp":1794343105409,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540454588","type":"print"},{"value":"9783540454595","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11874683_39","type":"book-chapter","created":{"date-parts":[[2006,9,27]],"date-time":"2006-09-27T09:47:26Z","timestamp":1159350446000},"page":"591-605","source":"Crossref","is-referenced-by-count":17,"title":["Satisfiability and Finite Model Property for the Alternating-Time \u03bc-Calculus"],"prefix":"10.1007","author":[{"given":"Sven","family":"Schewe","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernd","family":"Finkbeiner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"5","key":"39_CR1","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R. Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. Journal of the ACM\u00a049(5), 672\u2013713 (2002)","journal-title":"Journal of the ACM"},{"key":"39_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/BFb0028774","volume-title":"Computer Aided Verification","author":"R. Alur","year":"1998","unstructured":"Alur, R., Henzinger, T.A., Mang, F.Y.C., Qadeer, S., Rajamani, S.K., Tasiran, S.: Mocha: Modularity in model checking. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 521\u2013525. Springer, Heidelberg (1998)"},{"key":"39_CR3","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. Logic, Methodology and Philosophy of Science, 1\u201311 (1962)"},{"key":"39_CR4","first-page":"279","volume-title":"Proc. LICS","author":"L. Alfaro de","year":"2001","unstructured":"de Alfaro, L., Henzinger, T.A., Majumdar, R.: From verification to control: Dynamic programs for omega-regular objectives. In: Proc. LICS, pp. 279\u2013290. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"39_CR5","first-page":"368","volume-title":"Proc. FOCS","author":"E.A. Emerson","year":"1991","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, \u03bc-calculus and determinacy. In: Proc. FOCS, pp. 368\u2013377. IEEE Computer Society Press, Los Alamitos (1991)"},{"key":"39_CR6","unstructured":"Even, S., Yacobi, Y.: Relations among public key signature systems. Technical Report 175, Technion, Haifa, Israel (March 1980)"},{"key":"39_CR7","first-page":"321","volume-title":"Proc. LICS","author":"B. Finkbeiner","year":"2005","unstructured":"Finkbeiner, B., Schewe, S.: Uniform distributed synthesis. In: Proc. LICS, pp. 321\u2013330. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"39_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-46541-3_24","volume-title":"STACS 2000","author":"M. Jurdzi\u0144ski","year":"2000","unstructured":"Jurdzi\u0144ski, M.: Small progress measures for solving parity games. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 290\u2013301. Springer, Heidelberg (2000)"},{"key":"39_CR9","first-page":"313","volume-title":"Proc. Logic of Programs","author":"D. Kozen","year":"1983","unstructured":"Kozen, D., Parikh, R.J.: A decision procedure for the propositional \u03bc-calculus. In: Proc. Logic of Programs, pp. 313\u2013325. Springer, Heidelberg (1983)"},{"issue":"3","key":"39_CR10","doi-asserted-by":"crossref","first-page":"399","DOI":"10.3233\/JCS-2003-11307","volume":"11","author":"S. Kremer","year":"2003","unstructured":"Kremer, S., Raskin, J.-F.: A game-based verification of non-repudiation and fair exchange protocols. Journal of Computer Security\u00a011(3), 399\u2013430 (2003)","journal-title":"Journal of Computer Security"},{"key":"39_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/3-540-44612-5_45","volume-title":"Mathematical Foundations of Computer Science 2000","author":"O. Kupferman","year":"2000","unstructured":"Kupferman, O., Vardi, M.Y.: \u03bc-calculus synthesis. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 497\u2013507. Springer, Heidelberg (2000)"},{"issue":"2","key":"39_CR12","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. Journal of the ACM\u00a047(2), 312\u2013360 (2000)","journal-title":"Journal of the ACM"},{"issue":"5","key":"39_CR13","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"R. McNaughton","year":"1966","unstructured":"McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Information and Control\u00a09(5), 521\u2013530 (1966)","journal-title":"Information and Control"},{"issue":"1-2","key":"39_CR14","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(94)00214-4","volume":"141","author":"D.E. Muller","year":"1995","unstructured":"Muller, D.E., Schupp, P.E.: Simulating alternating tree automata by nondeterministic automata: new results and new proofs of the theorems of Rabin, McNaughton and Safra. Theor. Comput. Sci.\u00a0141(1-2), 69\u2013107 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"39_CR15","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Automata on Infinite Objects and Church\u2019s Problem. Regional Conference Series in Mathematics, vol.\u00a013. Amer. Math. Soc. (1972)","DOI":"10.1090\/cbms\/013"},{"key":"39_CR16","first-page":"319","volume-title":"Proc. FoCS","author":"S. Safra","year":"1988","unstructured":"Safra, S.: On the complexity of the \u03c9-automata. In: Proc. FoCS, pp. 319\u2013327. IEEE Computer Society Press, Los Alamitos (1988)"},{"key":"39_CR17","first-page":"208","volume-title":"Proc. LICS","author":"G. Drimmelen van","year":"2003","unstructured":"van Drimmelen, G.: Satisfiability in alternating-time temporal logic. In: Proc. LICS, pp. 208\u2013217. IEEE Computer Society Press, Los Alamitos (2003)"},{"issue":"1","key":"39_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1092","volume":"115","author":"M.Y. Vardi","year":"1994","unstructured":"Vardi, M.Y., Wolper, P.: Reasoning about infinite computations. Journal of Information and Computation\u00a0115(1), 1\u201337 (1994)","journal-title":"Journal of Information and Computation"},{"key":"39_CR19","doi-asserted-by":"crossref","unstructured":"Walther, D., Lutz, C., Wolter, F., Wooldridge, M.: Atl satisfiability is indeed exptime-complete. Journal of Logic and Computation (to appear, 2006)","DOI":"10.1093\/logcom\/exl009"},{"key":"39_CR20","doi-asserted-by":"crossref","unstructured":"Wilke, T.: Alternating tree automata, parity games, and modal \u03bc-calculus. Bull. Soc. Math. Belg.\u00a08(2) (May 2001)","DOI":"10.36045\/bbms\/1102714178"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11874683_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:47:37Z","timestamp":1605624457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11874683_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540454588","9783540454595"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11874683_39","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11874683","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}