{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:54:16Z","timestamp":1773615256178,"version":"3.50.1"},"reference-count":19,"publisher":"Allerton Press","issue":"7","license":[{"start":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T00:00:00Z","timestamp":1417392000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T00:00:00Z","timestamp":1417392000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Aut. Control Comp. Sci."],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.3103\/s0146411614070086","type":"journal-article","created":{"date-parts":[[2015,1,30]],"date-time":"2015-01-30T19:16:45Z","timestamp":1422645405000},"page":"381-388","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Common knowledge in well-structured perfect recall systems"],"prefix":"10.3103","volume":"48","author":[{"given":"N. O.","family":"Garanina","sequence":"first","affiliation":[]}],"member":"1627","published-online":{"date-parts":[[2015,2,1]]},"reference":[{"key":"6339_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1999.2843","volume":"160","author":"PA Abdulla","year":"2000","unstructured":"Abdulla, P.A., Cerans, K., Johnson, B., and Tsay Yih-Kuen, Algorithmic analysis of programs with well quasiordered domains, Inform. Compt., 2000, vol. 160, pp. 109\u2013127.","journal-title":"Inform. Compt."},{"key":"6339_CR2","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10458-006-5955-7","volume":"12","author":"RH Bordini","year":"2006","unstructured":"Bordini, R.H., Fisher, M., Visser, W., and Wooldridge, M., Verifying multi-agent programs by model checking, Autonom. Agents and Multi-Agent Syst., 2006, vol. 12, pp. 239\u2013256.","journal-title":"Autonom. Agents and Multi-Agent Syst."},{"key":"6339_CR3","first-page":"1077","volume-title":"Proc. 2010 Conf. on ECAI 2010","author":"M Cohen","year":"2010","unstructured":"Cohen, M. and Lomuscio, A., Non-elementary speed up for model checking synchronous perfect recall, Proc. 2010 Conf. on ECAI 2010, Amsterdam: IOS, 2010, pp. 1077\u20131078."},{"key":"6339_CR4","first-page":"995","volume-title":"Handbook of Theoretical Computer Science","author":"EA Emerson","year":"1990","unstructured":"Emerson, E.A., Temporal and modal logic, in Handbook of Theoretical Computer Science, V. B. Elsevier and MIT, 1990, pp. 995\u20131072."},{"key":"6339_CR5","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., and Vardi, M.Y., Reasoning about Knowledge, MIT, 1995."},{"key":"6339_CR6","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A Finkel","year":"2001","unstructured":"Finkel, A. and Schnoebelen, Ph., Well-structured transition systems everywhere!, Theor. Comp. Sci., 2001, vol. 256, pp. 63\u201392.","journal-title":"Theor. Comp. Sci."},{"key":"6339_CR7","series-title":"Informatik-Bericht","first-page":"351","volume-title":"Proc. Concurrency, Specification and Programming Workshop CS&P","author":"NO Garanina","year":"2004","unstructured":"Garanina, N.O., Kalinina, N.A., and Shilov, N.V., Model checking knowledge, actions and fixpoints, Proc. Concurrency, Specification and Programming Workshop CS&P, Berlin, Humboldt Universitat, 2004, Informatik-Bericht No. 170, vol. 2, pp. 351\u2013357."},{"key":"6339_CR8","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1134\/S0361768812060047","volume":"38","author":"NO Garanina","year":"2012","unstructured":"Garanina, N.O., Exponential improvement of time complexity of model checking for multiagent systems with perfect recall, Program. Compt. Software, 2012, vol. 38, pp. 294\u2013303.","journal-title":"Program. Compt. Software"},{"key":"6339_CR9","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1137\/S0097539797320906","volume":"33","author":"JY Halpern","year":"2004","unstructured":"Halpern, J.Y., van der Meyden, R., and Vardi, M.Y., Complete axiomatizations for reasoning about knowledge and time, SIAM J. Compt., 2004, vol. 33, pp. 674\u2013703.","journal-title":"SIAM J. Compt."},{"key":"6339_CR10","first-page":"449","volume-title":"J. ACM","author":"JY Halpern","year":"1992","unstructured":"Halpern, J.Y. and Zuck, L.D., A little knowledge goes a long way: knowledge-based derivations and correctness proofs for a family of protocols, J. ACM, 1992, no. 3, pp. 449\u2013478."},{"key":"6339_CR11","first-page":"549","volume":"215","author":"X Huang","year":"2010","unstructured":"Huang, X. and van der Meyden, R., The complexity of epistemic model checking: clock semantics and branching time, Proc. 19th Eur. Conf. on Artificial Intelligence. Frontiers in Artificial Intelligence and Applications, Lisbon, 2010, Vol. 215, pp. 549\u2013554.","journal-title":"Proc. 19th Eur. Conf. on Artificial Intelligence. Frontiers in Artificial Intelligence and Applications, Lisbon"},{"key":"6339_CR12","doi-asserted-by":"crossref","unstructured":"Kouzmin, E.V., Shilov, N.V., and Sokolov, V.A., Model checking \u03bc-calculus in well-structured transition systems, Proc. 11th Int. Symp. on Temporal Representation and Reasoning (TIME\u201904), France, IEEE, pp. 152\u2013155.","DOI":"10.1109\/TIME.2004.1314433"},{"key":"6339_CR13","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D Kozen","year":"1983","unstructured":"Kozen, D., Results on the propositional mu-calculus, Theor. Compt. Sci., 1983, vol. 27, pp. 333\u2013354.","journal-title":"Theor. Compt. Sci."},{"key":"6339_CR14","first-page":"789","volume-title":"Handbook of Theoretical Computer Science","author":"D Kozen","year":"1990","unstructured":"Kozen, D. and Tiuryn, J., Logics of programs, in Handbook of Theoretical Computer Science, Elsevier and MIT, 1990, pp. 789\u2013840."},{"key":"6339_CR15","first-page":"543","volume-title":"Proc. 19th Eur. Conf. on Artificial Intelligence. Frontiers in Artificial Intelligence and Applications","author":"MZ Kwiatkowska","year":"2010","unstructured":"Kwiatkowska, M.Z., Lomuscio, A., and Qu, H., Parallel model checking for temporal epistemic logic, Proc. 19th Eur. Conf. on Artificial Intelligence. Frontiers in Artificial Intelligence and Applications, Lisbon, IOS, 2010, vol. 215, pp. 543\u2013548."},{"key":"6339_CR16","first-page":"659","volume":"1","author":"A Lomuscio","year":"2010","unstructured":"Lomuscio, A., Penczek, W., and Qu, H., Partial order reductions for model checking temporal epistemic logics over interleaved multi-agent systems, Proc. 9th AAMAS, Toronto, 2010, vol. 1, IFAAMAS, 2010, pp. 659\u2013666.","journal-title":"Proc. 9th AAMAS, Toronto, 2010"},{"key":"6339_CR17","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/3-540-46691-6_35","volume":"1738","author":"R van der Meyden","year":"1999","unstructured":"van der Meyden, R. and Shilov, N.V., Model checking knowledge and time in systems with perfect recall, Lect. Notes Compt. Sci., 1999, vol. 1738, pp. 432\u2013445.","journal-title":"Lect. Notes Compt. Sci."},{"key":"6339_CR18","first-page":"347","volume":"72","author":"NV Shilov","year":"2006","unstructured":"Shilov, N.V., Garanina, N.O., and Choe, K.-M., Update and abstraction in model checking of knowledge and branching time, Fundamenta Informaticae, 2006, vol. 72, pp. 347\u2013361.","journal-title":"Fundamenta Informaticae"},{"key":"6339_CR19","unstructured":"Shilov, N.V. and Garanina, N.O., Well-structured model checking of multiagent systems, Proc. 6th Int. Conf. on Perspectives of System Informatics, Lect. Notes Compt. Sci., Novosibirsk, 2006, vol. 4378."}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411614070086.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411614070086","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411614070086","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411614070086.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T21:57:29Z","timestamp":1773611849000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411614070086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12]]},"references-count":19,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["6339"],"URL":"https:\/\/doi.org\/10.3103\/s0146411614070086","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12]]},"assertion":[{"value":"22 November 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2015","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}