{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T11:10:22Z","timestamp":1757589022031,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642319143"},{"type":"electronic","value":"9783642319150"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31915-0_6","type":"book-chapter","created":{"date-parts":[[2012,7,12]],"date-time":"2012-07-12T01:25:04Z","timestamp":1342056304000},"page":"95-113","source":"Crossref","is-referenced-by-count":3,"title":["Abstraction for Model Checking Modular Interpreted Systems over ATL"],"prefix":"10.1007","author":[{"given":"Michael","family":"K\u00f6ster","sequence":"first","affiliation":[]},{"given":"Peter","family":"Lohmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"6_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. J. ACM\u00a049(5), 672\u2013713 (2002)","journal-title":"J. ACM"},{"unstructured":"Ball, T., Rajamani, S.: Boolean programs: A model and process for software analysis. Tech. Rep. 2010-14 (2000)","key":"6_CR2"},{"issue":"5","key":"6_CR3","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1145\/876638.876643","volume":"50","author":"E.M. Clarke","year":"2003","unstructured":"Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking. J. ACM\u00a050(5), 752\u2013794 (2003)","journal-title":"J. ACM"},{"issue":"5","key":"6_CR4","doi-asserted-by":"publisher","first-page":"1512","DOI":"10.1145\/186025.186051","volume":"16","author":"E.M. Clarke","year":"1994","unstructured":"Clarke, E.M., Grumberg, O., Long, D.E.: Model checking and abstraction. ACM Trans. Program. Lang. Syst.\u00a016(5), 1512\u20131542 (1994)","journal-title":"ACM Trans. Program. Lang. Syst."},{"unstructured":"Clarke, E., Grumberg, O., Peled, D.: Model checking. Springer (1999)","key":"6_CR5"},{"unstructured":"Cohen, M., Dam, M., Lomuscio, A., Russo, F.: Abstraction in model checking multi-agent systems. In: AAMAS (2), pp. 945\u2013952 (2009)","key":"6_CR6"},{"doi-asserted-by":"crossref","unstructured":"Das, S., Dill, D.: Successive approximation of abstract transition relations. In: Proceedings of 16th Annual IEEE Symposium on Logic in Computer Science 2001, pp. 51\u201358. IEEE (2002)","key":"6_CR7","DOI":"10.1109\/LICS.2001.932482"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-85762-4_8","volume-title":"Theoretical Aspects of Computing - ICTAC 2008","author":"F. Dechesne","year":"2008","unstructured":"Dechesne, F., Orzan, S., Wang, Y.: Refinement of Kripke Models for Dynamics. In: Fitzgerald, J.S., Haxthausen, A.E., Yenigun, H. (eds.) ICTAC 2008. LNCS, vol.\u00a05160, pp. 111\u2013125. Springer, Heidelberg (2008), http:\/\/dx.doi.org\/10.1007\/978-3-540-85762-4_8"},{"unstructured":"Deiters, C., K\u00f6ster, M., Lange, S., L\u00fctzel, S., Mokbel, B., Mumme, C., Niebuhr, D. (eds.): DemSy - A Scenario for an Integrated Demonstrator in a SmartCity. Tech. Rep. 2010\/01, NTH Focused Research School for IT Ecosystems, Clausthal University of Technology (May 2010), http:\/\/www.gbv.de\/dms\/clausthal\/H_BIB\/IfI\/NTH_CompSciRep\/2010-01.pdf","key":"6_CR9"},{"doi-asserted-by":"crossref","unstructured":"Emerson, E., Halpern, J.: \u201cSometimes\u201d and \u201dnot never\u201d revisited: On branching versus linear time temporal logic. In: Proceedings of the Annual ACM Symposium on Principles of Programming Languages, vol.\u00a033(1), pp. 151\u2013178 (1986)","key":"6_CR10","DOI":"10.1145\/4904.4999"},{"key":"6_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-540-75254-7_2","volume-title":"Multi-Agent Systems and Applications V","author":"C. Enea","year":"2007","unstructured":"Enea, C., Dima, C.: Abstractions of Multi-agent Systems. In: Burkhard, H.-D., Lindemann, G., Verbrugge, R., Varga, L.Z. (eds.) CEEMAS 2007. LNCS (LNAI), vol.\u00a04696, pp. 11\u201321. Springer, Heidelberg (2007), http:\/\/dx.doi.org\/10.1007\/978-3-540-75254-7_2"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF01784885","volume":"3","author":"J.Y. Halpern","year":"1989","unstructured":"Halpern, J.Y., Fagin, R.: Modelling knowledge and action in distributed systems. Distributed Computing\u00a03, 159\u2013177 (1989), http:\/\/dx.doi.org\/10.1007\/BF01784885","journal-title":"Distributed Computing"},{"doi-asserted-by":"crossref","unstructured":"Halpern, J., Fagin, R., Moses, Y., Vardi, M.: Reasoning about knowledge. Handbook of Logic in Artificial Intelligence and Logic Programming 4 (1995)","key":"6_CR13","DOI":"10.1093\/oso\/9780198534532.003.0001"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1007\/3-540-45061-0_69","volume-title":"Automata, Languages and Programming","author":"T.A. Henzinger","year":"2003","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R.: Counterexample-Guided Control. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 886\u2013902. Springer, Heidelberg (2003)"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-540-45099-3_12","volume-title":"Static Analysis","author":"T.A. Henzinger","year":"2000","unstructured":"Henzinger, T.A., Majumdar, R., Mang, F.Y.C., Raskin, J.-F.: Abstract Interpretation of Game Properties. In: SAS 2000. LNCS, vol.\u00a01824, pp. 220\u2013240. Springer, Heidelberg (2000), http:\/\/portal.acm.org\/citation.cfm?id=647169.718154"},{"doi-asserted-by":"crossref","unstructured":"Jamroga, W., \u00c5gotnes, T.: Modular interpreted systems: A preliminary report. Tech. Rep. IfI-06-15, Clausthal University of Technology (2006)","key":"6_CR16","DOI":"10.1145\/1329125.1329286"},{"doi-asserted-by":"crossref","unstructured":"Jamroga, W., \u00c5gotnes, T.: Modular interpreted systems. In: Durfee, E.H., Yokoo, M., Huhns, M.N., Shehory, O. (eds.) Proceedings of AAMAS 2007, pp. 892\u2013899. ACM Press (2007)","key":"6_CR17","DOI":"10.1145\/1329125.1329286"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/345099.345104","volume":"22","author":"O. Kupferman","year":"2000","unstructured":"Kupferman, O., Vardi, M.Y.: An automata-theoretic approach to modular model checking. ACM Trans. Program. Lang. Syst.\u00a022, 87\u2013128 (2000), http:\/\/doi.acm.org\/10.1145\/345099.345104","journal-title":"ACM Trans. Program. Lang. Syst."},{"doi-asserted-by":"crossref","unstructured":"Kurshan, R.: Computer-aided verification of coordinating processes: the automata-theoretic approach. Princeton Univ. Press (1994)","key":"6_CR19","DOI":"10.1515\/9781400864041"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-45657-0_19","volume-title":"Computer Aided Verification","author":"K.L. McMillan","year":"2002","unstructured":"McMillan, K.L.: Applying SAT Methods in Unbounded Symbolic Model Checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 250\u2013264. Springer, Heidelberg (2002), http:\/\/dx.doi.org\/10.1007\/3-540-45657-0_19"},{"key":"6_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic model checking: An Approach to the State Explosion Problem","author":"K. McMillan","year":"1993","unstructured":"McMillan, K.: Symbolic model checking: An Approach to the State Explosion Problem. Kluwer Academic Publishers Norwell, MA (1993)"},{"unstructured":"Wooldridge, M.: Computationally grounded theories of agency. In: Proceedings of the Fourth International Conference on Multi-Agent Systems, ICMAS 2000 (2000), http:\/\/doi.ieeecomputersociety.org\/10.1109\/ICMAS.2000.858426","key":"6_CR22"}],"container-title":["Lecture Notes in Computer Science","Programming Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31915-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T22:41:27Z","timestamp":1743720087000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-31915-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642319143","9783642319150"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31915-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}