{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T05:08:38Z","timestamp":1736658518545,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540472377"},{"type":"electronic","value":"9783540472384"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11901914_17","type":"book-chapter","created":{"date-parts":[[2006,10,10]],"date-time":"2006-10-10T05:21:43Z","timestamp":1160457703000},"page":"200-214","source":"Crossref","is-referenced-by-count":1,"title":["Selective Approaches for Solving Weak Games"],"prefix":"10.1007","author":[{"given":"Malte","family":"Helmert","sequence":"first","affiliation":[]},{"given":"Robert","family":"Mattm\u00fcller","sequence":"additional","affiliation":[]},{"given":"Sven","family":"Schewe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0004-3702(94)90004-3","volume":"66","author":"L.V. Allis","year":"1994","unstructured":"Allis, L.V., van der Meulen, M., van der Herik, H.J.: Proof-number search. Artificial Intelligence\u00a066(1), 91\u2013124 (1994)","journal-title":"Artificial Intelligence"},{"issue":"5","key":"17_CR2","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":"17_CR3","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)"},{"issue":"1","key":"17_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)90266-6","volume":"126","author":"H.R. Andersen","year":"1994","unstructured":"Andersen, H.R.: Model checking and boolean graphs. Theor.\u00a0Comput.\u00a0Sci.\u00a0126(1), 3\u201330 (1994)","journal-title":"Theor.\u00a0Comput.\u00a0Sci."},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","volume":"98","author":"J.R. Burch","year":"1992","unstructured":"Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 1020 states and beyond. Information and Computation\u00a098(2), 142\u2013170 (1992)","journal-title":"Information and Computation"},{"key":"17_CR6","unstructured":"Chadha, R., Kremer, S., Scedrov, A.: Analysis of multi-party contract signing. Technical Report 516, Universit\u00e9 Libre de Bruxelles (2004)"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Proc.\u00a0IBM Workshop on Logics of Programs, pp. 52\u201371 (1981)","DOI":"10.1007\/BFb0025774"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/3-540-55179-4_6","volume-title":"Computer Aided Verification","author":"R. Cleaveland","year":"1992","unstructured":"Cleaveland, R., Steffen, B.: A linear-time model-checking algorithm for the alternation-free modal \u03bc-calculus. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol.\u00a0575, pp. 48\u201358. Springer, Heidelberg (1992)"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, \u03bc-calculus and determinacy. In: Proc.\u00a0FOCS, pp. 368\u2013377 (1991)","DOI":"10.1109\/SFCS.1991.185392"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/3-540-48169-9_11","volume-title":"Distributed Computing","author":"J.A. Garay","year":"1999","unstructured":"Garay, J.A., MacKenzie, P.D.: Abuse-free multi-party contract signing. In International Symposium on Distributed Computing. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol.\u00a01693, pp. 151\u2013165. Springer, Heidelberg (1999)"},{"key":"17_CR11","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1613\/jair.855","volume":"14","author":"J. Hoffmann","year":"2001","unstructured":"Hoffmann, J., Nebel, B.: The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research\u00a014, 253\u2013302 (2001)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"5","key":"17_CR12","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/32.588521","volume":"23","author":"G.J. Holzmann","year":"1997","unstructured":"Holzmann, G.J.: The model checker SPIN. Software Engineering\u00a023(5), 279\u2013295 (1997)","journal-title":"Software Engineering"},{"issue":"4","key":"17_CR13","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"D.E. Knuth","year":"1975","unstructured":"Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artificial Intelligence\u00a06(4), 293\u2013326 (1975)","journal-title":"Artificial Intelligence"},{"key":"17_CR14","unstructured":"Kremer, S.: Formal Analysis of Optimistic Fair Exchange Protocols. PhD thesis, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium (December 2003)"},{"issue":"3","key":"17_CR15","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":"17_CR16","doi-asserted-by":"crossref","unstructured":"Mahimkar, A., Shmatikov, V.: Game-based analysis of denial-of-service prevention protocols. In: IEEE Computer Security Foundations Workshop, pp. 287\u2013301 (2005)","DOI":"10.1109\/CSFW.2005.18"},{"key":"17_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/3-540-45448-9_8","volume-title":"Intelligent Agents VIII","author":"M. Ryan","year":"2002","unstructured":"Ryan, M., Schobbens, P.-Y.: Agents and roles: Refinement in alternating-time temporal logic. In: Meyer, J.-J.C., Tambe, M. (eds.) ATAL 2001. LNCS (LNAI), vol.\u00a02333, pp. 100\u2013114. Springer, Heidelberg (2002)"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"van der Hoek, W., Lomuscio, A., Wooldridge, M.: On the complexity of practical ATL model checking. In: Proc.\u00a0AAMAS (2006)","DOI":"10.1145\/1160633.1160665"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11901914_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T09:47:43Z","timestamp":1736588863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11901914_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540472377","9783540472384"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11901914_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}