{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T04:14:41Z","timestamp":1746072881372,"version":"3.40.4"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319005508"},{"type":"electronic","value":"9783319005515"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-319-00551-5_58","type":"book-chapter","created":{"date-parts":[[2013,4,30]],"date-time":"2013-04-30T20:23:36Z","timestamp":1367353416000},"page":"483-491","source":"Crossref","is-referenced-by-count":1,"title":["Two Approaches to Bounded Model Checking for a Soft Real-Time Epistemic Computation Tree Logic"],"prefix":"10.1007","author":[{"given":"Artur","family":"M\u0119ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo\u017cena","family":"Wo\u017ana-Szcze\u015bniak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Agnieszka M.","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":"58_CR1","doi-asserted-by":"crossref","unstructured":"Campos, S.: A quantitative approach to the formal verification of real-time systems. Ph.D. thesis, School of Computer Science, Carnegie Mellon University, USA (1996)","DOI":"10.1007\/3-540-63166-6_46"},{"key":"58_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-642-04761-9_6","volume-title":"Automated Technology for Verification and Analysis","author":"M. Cohen","year":"2009","unstructured":"Cohen, M., Dam, M., Lomuscio, A., Qu, H.: A data symmetry reduction technique for temporal-epistemic logic. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol.\u00a05799, pp. 69\u201383. Springer, Heidelberg (2009)"},{"key":"58_CR3","unstructured":"Cohen, M., Dam, M., Lomuscio, A., Russo, F.: Abstraction in model checking multi-agent systems. In: Proc. of AAMAS 2009, vol.\u00a02, pp. 945\u2013952. IFAAMAS (2009)"},{"key":"58_CR4","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)"},{"key":"58_CR5","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. van der Hoek","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)"},{"key":"58_CR6","doi-asserted-by":"crossref","unstructured":"Jones, A.V., Lomuscio, A.: Distributed BDD-based BMC for the verification of multi-agent systems. Proc. of AAMAS 2010, 675\u2013682. IFAAMAS (2010)","DOI":"10.1007\/978-3-642-02658-4_55"},{"key":"58_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-540-30960-4_13","volume-title":"Formal Approaches to Agent-Based Systems","author":"M. Kacprzak","year":"2004","unstructured":"Kacprzak, M., Lomuscio, A., \u0141asica, T., Penczek, W., Szreter, M.: Verifying multi-agent systems via unbounded model checking. In: Hinchey, M.G., Rash, J.L., Truszkowski, W.F., Rouff, C.A. (eds.) FAABS 2004. LNCS (LNAI), vol.\u00a03228, pp. 189\u2013212. Springer, Heidelberg (2004)"},{"issue":"1-4","key":"58_CR8","doi-asserted-by":"crossref","first-page":"313","DOI":"10.3233\/FUN-2008-851-422","volume":"85","author":"M. Kacprzak","year":"2008","unstructured":"Kacprzak, M., Nabialek, W., Niewiadomski, A., Penczek, W., P\u00f3lrola, A., Szreter, M., Wo\u017ana, B., Zbrzezny, A.: VerICS 2007 - a model checker for knowledge and real-time. Fundamenta Informaticae\u00a085(1-4), 313\u2013328 (2008)","journal-title":"Fundamenta Informaticae"},{"issue":"1-2","key":"58_CR9","doi-asserted-by":"crossref","first-page":"71","DOI":"10.3233\/FI-2010-276","volume":"101","author":"A. Lomuscio","year":"2010","unstructured":"Lomuscio, A., Penczek, W., Qu, H.: Partial order reductions for model checking temporal-epistemic logics over interleaved multi-agent systems. Fundamenta Informaticae\u00a0101(1-2), 71\u201390 (2010)","journal-title":"Fundamenta Informaticae"},{"key":"58_CR10","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1016\/j.artint.2007.05.005","volume":"171","author":"A. Lomuscio","year":"2007","unstructured":"Lomuscio, A., Penczek, W., Wo\u017ana, B.: Bounded model checking for knowledge and real time. Artificial Intelligence\u00a0171, 1011\u20131038 (2007)","journal-title":"Artificial Intelligence"},{"key":"58_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1007\/978-3-642-02658-4_55","volume-title":"Computer Aided Verification","author":"A. Lomuscio","year":"2009","unstructured":"Lomuscio, A., Qu, H., Raimondi, F.: McMAS: A model checker for the verification of multi-agent systems. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol.\u00a05643, pp. 682\u2013688. Springer, Heidelberg (2009)"},{"key":"58_CR12","unstructured":"M\u0119ski, A., Penczek, W., Szreter, M.: BDD-based Bounded Model Checking for LTLK over Two Variants of Interpreted Systems. Proc. of LAM 2012, 35\u201350 (2012)"},{"key":"58_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/3-540-46691-6_35","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"R. van der Meyden","year":"1999","unstructured":"van der Meyden, R., Shilov, N.: Model checking knowledge and time in systems with perfect recall. In: Pandu Rangan, C., Raman, V., Sarukkai, S. (eds.) FST TCS 1999. LNCS, vol.\u00a01738, pp. 432\u2013445. Springer, Heidelberg (1999)"},{"issue":"2","key":"58_CR14","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":"3-4","key":"58_CR15","doi-asserted-by":"crossref","first-page":"373","DOI":"10.3233\/FI-2012-743","volume":"119","author":"W. Penczek","year":"2012","unstructured":"Penczek, W., Wo\u017ana-Szcze\u015bniak, B., Zbrzezny, A.: Towards SAT-based BMC for LTLK over interleaved interpreted systems. Fundamenta Informaticae\u00a0119(3-4), 373\u2013392 (2012)","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"58_CR16","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)","journal-title":"Journal of Applied Logic"},{"key":"58_CR17","volume-title":"An introduction to multi-agent systems","author":"M. Wooldridge","year":"2002","unstructured":"Wooldridge, M.: An introduction to multi-agent systems. John Wiley, England (2002)"},{"key":"58_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-37890-4_10","volume-title":"Declarative Agent Languages and Technologies X","author":"B. Wo\u017ana-Szcze\u015bniak","year":"2013","unstructured":"Wo\u017ana-Szcze\u015bniak, B., Zbrzezny, A.: SAT-based BMC for Deontic Metric Temporal Logic and Deontic Interleaved Interpreted Systems. In: Baldoni, M., Dennis, L., Mascardi, V., Vasconcelos, W. (eds.) DALT 2012. LNCS, vol.\u00a07784, pp. 170\u2013189. Springer, Heidelberg (2013)"},{"key":"58_CR19","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-642-24769-9_40","volume-title":"Progress in Artificial Intelligence","author":"B..z. Wo\u017ana-Szcze\u015bniak","year":"2011","unstructured":"Wo\u017ana-Szcze\u015bniak, B.z., Zbrzezny, A., Zbrzezny, A.: The BMC method for the existential part of RTCTLK and interleaved interpreted systems. In: Antunes, L., Pinto, H.S. (eds.) EPIA 2011. LNCS (LNAI), vol.\u00a07026, pp. 551\u2013565. Springer, Heidelberg (2011)"}],"container-title":["Advances in Intelligent Systems and Computing","Distributed Computing and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-00551-5_58","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T07:40:11Z","timestamp":1745998811000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-00551-5_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319005508","9783319005515"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-00551-5_58","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2013]]}}}