{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:37:48Z","timestamp":1742971068785,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642247682"},{"type":"electronic","value":"9783642247699"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24769-9_40","type":"book-chapter","created":{"date-parts":[[2011,10,10]],"date-time":"2011-10-10T15:13:38Z","timestamp":1318259618000},"page":"551-565","source":"Crossref","is-referenced-by-count":8,"title":["The BMC Method for the Existential Part of RTCTLK and Interleaved Interpreted Systems"],"prefix":"10.1007","author":[{"given":"Bo\u017cena","family":"Wo\u017ana-Szcze\u015bniak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Agnieszka","family":"Zbrzezny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Zbrzezny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Biere, A., Cimatti, A., Clarke, E., Fujita, M., Zhu, Y.: Symbolic model checking using SAT procedures instead of BDDs. In: Proc. of DAC 1999, pp. 317\u2013320 (1999)","DOI":"10.21236\/ADA360973"},{"issue":"5:5","key":"40_CR2","first-page":"1","volume":"2","author":"A. Biere","year":"2006","unstructured":"Biere, A., Heljanko, K., Junttila, T., Latvala, T., Schuppan, V.: Linear Encodings of Bounded LTL Model Checking. Logical Methods in Computer Science\u00a02(5:5), 1\u201364 (2006)","journal-title":"Logical Methods in Computer Science"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cmbridge Tracts in Theoretical Computer Science, vol.\u00a053. Cambridge University Press (2001)","DOI":"10.1017\/CBO9781107050884"},{"key":"40_CR4","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (1999)"},{"key":"40_CR5","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: MiniSat, http:\/\/minisat.se\/MiniSat.html"},{"key":"40_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11499107_5","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2005","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: MiniSat - A SAT Solver with Conflict-Clause Minimization. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569. Springer, Heidelberg (2005)"},{"issue":"4","key":"40_CR7","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF00355298","volume":"4","author":"E.A. Emerson","year":"1992","unstructured":"Emerson, E.A., Sistla, A.P., Mok, A.K., Srinivasan, J.: Quantitative temporal reasoning. Real-Time Systems\u00a04(4), 331\u2013352 (1992)","journal-title":"Real-Time Systems"},{"key":"40_CR8","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5803.001.0001","volume-title":"Reasoning about Knowledge","author":"R. Fagin","year":"1995","unstructured":"Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. MIT Press, Cambridge (1995)"},{"issue":"2","key":"40_CR9","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1145\/128749.150945","volume":"39","author":"R. Fagin","year":"1992","unstructured":"Fagin, R., Halpern, J.Y., Vardi, M.Y.: What can machines know? On the properties of knowledge in distributed systems. Journal of the ACM\u00a039(2), 328\u2013376 (1992)","journal-title":"Journal of the ACM"},{"issue":"1","key":"40_CR10","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-0000(89)90039-1","volume":"38","author":"J.Y. Halpern","year":"1989","unstructured":"Halpern, J.Y., Vardi, M.Y.: The complexity of reasoning about knowledge and time 1: lower bounds. Journal of Computer and System Sciences\u00a038(1), 195\u2013237 (1989)","journal-title":"Journal of Computer and System Sciences"},{"key":"40_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/3-540-46017-9_9","volume-title":"Model Checking Software","author":"W. Hoek van der","year":"2002","unstructured":"van der Hoek, W., Wooldridge, M.J.: Model checking knowledge and time. In: Bo\u0161na\u010dki, D., Leue, S. (eds.) SPIN 2002. LNCS, vol.\u00a02318, pp. 95\u2013111. Springer, Heidelberg (2002)"},{"issue":"1","key":"40_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1026185103185","volume":"75","author":"W. Hoek van der","year":"2003","unstructured":"van der Hoek, W., Wooldridge, M.: Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications. Studia Logica\u00a075(1), 125\u2013157 (2003)","journal-title":"Studia Logica"},{"key":"40_CR13","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-20674-0_7","volume-title":"Model Checking and Artificial Intelligence","author":"X. Huang","year":"2011","unstructured":"Huang, X., Luo, C., van der Meyden, R.: Improved Bounded Model Checking for a Fair Branching-Time Temporal Epistemic Logic. In: van der Meyden, R., Smaus, J.-G. (eds.) MoChArt 2010. LNCS (LNAI), vol.\u00a06572, pp. 95\u2013111. Springer, Heidelberg (2011)"},{"issue":"2,3","key":"40_CR14","first-page":"221","volume":"63","author":"M. Kacprzak","year":"2006","unstructured":"Kacprzak, M., Lomuscio, A., Niewiadomski, A., Penczek, W., Raimondi, F., Szreter, M.: Comparing BDD and SAT based techniques for model checking Chaum\u2019s dining cryptographers protocol. Fundamenta Informaticae\u00a063(2,3), 221\u2013240 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"40_CR15","unstructured":"Lomuscio, A., Penczek, W., Qu, H.: Partial order reduction for model checking interleaved multi-agent systems. In: AAMAS, pp. 659\u2013666. IFAAMAS Press (2010)"},{"key":"40_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/3-540-56922-7_34","volume-title":"Computer Aided Verification","author":"D. Peled","year":"1993","unstructured":"Peled, D.: All from one, one for all: On model checking using representatives. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 409\u2013423. Springer, Heidelberg (1993)"},{"issue":"2","key":"40_CR17","first-page":"167","volume":"55","author":"W. Penczek","year":"2003","unstructured":"Penczek, W., Lomuscio, A.: Verifying epistemic properties of multi-agent systems via bounded model checking. Fundamenta Informaticae\u00a055(2), 167\u2013185 (2003)","journal-title":"Fundamenta Informaticae"},{"issue":"1-2","key":"40_CR18","first-page":"135","volume":"51","author":"W. Penczek","year":"2002","unstructured":"Penczek, W., Wo\u017ana, B., Zbrzezny, A.: Bounded model checking for the universal fragment of CTL. Fundamenta Informaticae\u00a051(1-2), 135\u2013156 (2002)","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"40_CR19","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.jal.2005.12.010","volume":"5","author":"F. Raimondi","year":"2005","unstructured":"Raimondi, F., Lomuscio, A.: Automatic verification of multi-agent systems by model checking via OBDDs. Journal of Applied Logic\u00a05(2), 235\u2013251 (2005); Special issue on Logic-based agent verification","journal-title":"Journal of Applied Logic"},{"key":"40_CR20","first-page":"280","volume-title":"Proc. of CSFW 2004","author":"R. Meyden van der","year":"2004","unstructured":"van der Meyden, R., Su, K.: Symbolic model checking the knowledge of the dining cryptographers. In: Proc. of CSFW 2004, pp. 280\u2013291. IEEE Computer Society, Los Alamitos (2004)"},{"key":"40_CR21","first-page":"178","volume-title":"Pre-Proc. of CEE-SET 2009","author":"B. Wo\u017ana-Szcze\u015bniak","year":"2009","unstructured":"Wo\u017ana-Szcze\u015bniak, B.: Bounded model checking for the existential part of Real-Time CTL and knowledge. In: Pre-Proc. of CEE-SET 2009, pp. 178\u2013191. AGH Krakow, Poland (2009)"},{"issue":"1-4","key":"40_CR22","doi-asserted-by":"crossref","first-page":"513","DOI":"10.3233\/FUN-2008-851-435","volume":"85","author":"A. Zbrzezny","year":"2008","unstructured":"Zbrzezny, A.: Improving the translation from ECTL to SAT. Fundamenta Informaticae\u00a085(1-4), 513\u2013531 (2008)","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24769-9_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T17:29:55Z","timestamp":1741800595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24769-9_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642247682","9783642247699"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24769-9_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}