{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,29]],"date-time":"2026-08-29T11:18:28Z","timestamp":1788002308123,"version":"build-2784847793"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T00:00:00Z","timestamp":1773187200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T00:00:00Z","timestamp":1773187200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003407","name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["PRIN 2022 - grant number 2022598LMZ"],"award-info":[{"award-number":["PRIN 2022 - grant number 2022598LMZ"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J of Log Lang and Inf"],"published-print":{"date-parts":[[2026,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    We present a formal framework encompassing concurrency theoretic and modal logic based approaches to the modeling and verification of dynamic multi-agent systems. We develop a model of computation merging classical labeled transition systems and multi-agent Kripke frames. Based on this model, which we call a Kripke labeled transition system, we provide a modal logic and a process algebra for the specification and analysis of interacting multi-agent systems. Our logic is obtained by combining proof systems for Hennessy-Milner Logic and the normal epistemic logic\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\textsf{S5}_n$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>S<\/mml:mi>\n                            <mml:msub>\n                              <mml:mn>5<\/mml:mn>\n                              <mml:mi>n<\/mml:mi>\n                            <\/mml:msub>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    and is sound and complete with respect to its intended models. Further, we show that this logic is decidable and induces a behavioral equivalence combining classical notions of bisimulation. We prove that our process algebra is adequate for specifying the behavior of Kripke labeled transition systems and we show its effectiveness and usability through real-world examples.\n                  <\/jats:p>","DOI":"10.1007\/s10849-026-09461-3","type":"journal-article","created":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T17:39:51Z","timestamp":1773250791000},"page":"341-379","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bridging concurrency theory and epistemic models: a formal framework for dynamic multi-agent systems"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7250-5011","authenticated-orcid":false,"given":"Alessandro","family":"Aldini","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-5844-2894","authenticated-orcid":false,"given":"Ludovico","family":"Fusco","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,3,11]]},"reference":[{"key":"9461_CR1","unstructured":"Aldini, A. (2024). A process algebraic framework for multi-agent dynamic epistemic systems. In: de\u2019Liguoro, U., Palazzo, M., & Roversi, L. (eds.) 25th Italian Conference on Theoretical Computer Science (ICTCS), vol. 3811, pp. 269\u2013283. CEUR-WS, Aachen, Germany. https:\/\/ceur-ws.org\/Vol-3811\/."},{"key":"9461_CR2","doi-asserted-by":"publisher","unstructured":"Aldini, A., & Tagliaferri, M. (2020). Logics to reason formally about trust computation and manipulation. In: Saracino, A., & Mori, P. (eds.) Emerging Technologies for Authorization and Authentication. LNCS, vol. 11967, pp. 1\u201315. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-030-39749-4_1.","DOI":"10.1007\/978-3-030-39749-4_1"},{"key":"9461_CR3","doi-asserted-by":"publisher","unstructured":"Aldini, A., Curzi, G., Graziani, P., & Tagliaferri, M. (2021). Trust evidence logic. In: Vejnarov\u00e1, J., Wilson, N. (eds.) Symbolic and Quantitative Approaches to Reasoning with Uncertainty: 16th European Conference (ECSQARU). LNAI, vol. 12897, pp. 575\u2013589. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-030-86772-0_41.","DOI":"10.1007\/978-3-030-86772-0_41."},{"key":"9461_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2024.109167","volume":"169","author":"A Aldini","year":"2024","unstructured":"Aldini, A., Curzi, G., Graziani, P., & Tagliaferri, M. (2024). A probabilistic modal logic for context-aware trust based on evidence. International Journal of Approximate Reasoning, 169, Article 109167. https:\/\/doi.org\/10.1016\/j.ijar.2024.109167","journal-title":"International Journal of Approximate Reasoning"},{"issue":"2","key":"9461_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3155337","volume":"28","author":"A Aldini","year":"2018","unstructured":"Aldini, A. (2018). Design and verification of trusted collective adaptive systems. Transactions on Modeling and Computer Simulation (TOMACS), 28(2), 1\u201327. https:\/\/doi.org\/10.1145\/3155337","journal-title":"Transactions on Modeling and Computer Simulation (TOMACS)"},{"issue":"6","key":"9461_CR6","doi-asserted-by":"publisher","first-page":"1272","DOI":"10.1093\/logcom\/exac015","volume":"32","author":"A Aldini","year":"2022","unstructured":"Aldini, A. (2022). On the modeling and verification of the spread of fake news, algebraically. Journal of Logic and Computation, 32(6), 1272\u20131291. https:\/\/doi.org\/10.1093\/logcom\/exac015","journal-title":"Journal of Logic and Computation"},{"issue":"5","key":"9461_CR7","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. (2002). Alternating-time temporal logic. Journal of the ACM, 49(5), 672\u2013713. https:\/\/doi.org\/10.1145\/585265.585270","journal-title":"Journal of the ACM"},{"key":"9461_CR8","volume-title":"Principles of Model Checking (Representation and Mind Series)","author":"C Baier","year":"2008","unstructured":"Baier, C., & Katoen, J.-P. (2008). Principles of Model Checking (Representation and Mind Series). Cambridge, MA, USA: The MIT Press."},{"key":"9461_CR9","doi-asserted-by":"publisher","unstructured":"Balliu, M., Dam, M., & Le Guernic, G. (2011). Epistemic temporal logic for information flow security. In: PLAS\u201911: Proceedings of the ACM SIGPLAN 6th Workshop on Programming Languages and Analysis for Security. ACM, New York. https:\/\/doi.org\/10.1145\/2166956.2166962.","DOI":"10.1145\/2166956.2166962."},{"key":"9461_CR10","doi-asserted-by":"publisher","unstructured":"Baltag, A., Moss, L. S., & Solecki, S. (2016). The logic of public announcements, common knowledge, and private suspicions. In: Arl\u00f3-Costa, H., Hendricks, V.F., Benthem, J. (eds.) Readings in Formal Epistemology: Sourcebook, pp. 773\u2013812. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-20451-2_38.","DOI":"10.1007\/978-3-319-20451-2_38."},{"key":"9461_CR11","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/B:SYNT.0000024912.56773.5e","volume":"139","author":"A Baltag","year":"2004","unstructured":"Baltag, A., & Moss, L. S. (2004). Logics for epistemic programs. Synthese, 139, 165\u2013224. https:\/\/doi.org\/10.1023\/B:SYNT.0000024912.56773.5e","journal-title":"Synthese"},{"key":"9461_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2021.100735","volume":"125","author":"K Bavendiek","year":"2022","unstructured":"Bavendiek, K., & Schupp, S. (2022). A process calculus for privacy-preserving protocols in location-based service systems. Journal of Logical and Algebraic Methods in Programming, 125, Article 100735. https:\/\/doi.org\/10.1016\/j.jlamp.2021.100735","journal-title":"Journal of Logical and Algebraic Methods in Programming"},{"key":"9461_CR13","doi-asserted-by":"crossref","unstructured":"Benthem, J., Gerbrandy, J., & Pacuit, E. (2007). Merging frameworks for interaction: DEL and ETL. In: Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK\u201907), pp. 72\u201381. ACM, New York.","DOI":"10.1145\/1324249.1324262"},{"key":"9461_CR14","doi-asserted-by":"publisher","unstructured":"Blackburn, P., De Rijke, M., & Venema, Y. (2002). Modal Logic. Cambridge Tracts in Theoretical Computer Science, vol. 53. Cambridge University Press, Cambridge, UK. https:\/\/doi.org\/10.1017\/CBO9781107050884","DOI":"10.1017\/CBO9781107050884"},{"key":"9461_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4204\/EPTCS.243.1","volume":"243","author":"T Bolander","year":"2017","unstructured":"Bolander, T. (2017). A gentle introduction to epistemic planning: The DEL approach. Electronic Proceedings in Theoretical Computer Science, 243, 1\u201322. https:\/\/doi.org\/10.4204\/EPTCS.243.1","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"9461_CR16","doi-asserted-by":"publisher","unstructured":"Caleiro, C., Sernadas, C., & Sernada, A. (1999). Parameterisation of Logics. In: Fiadeiro, J.L. (ed.) Recent Trends in Algebraic Development Techniques. 13th International Workshop, WADT\u201998, 1998, Selected Papers, pp. 48\u201363. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/3-540-48483-3_4.","DOI":"10.1007\/3-540-48483-3_4."},{"key":"9461_CR17","volume-title":"The Stanford Encyclopedia of Philosophy","author":"W Carnielli","year":"2025","unstructured":"Carnielli, W., & Coniglio, M. E. (2025). Combining Logics. In E. N. Zalta & U. Nodelman (Eds.), The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab: Stanford University."},{"key":"9461_CR18","doi-asserted-by":"publisher","unstructured":"Chadha, R., Delaune, S., & Kremer, S. (2009). Epistemic Logic for the Applied Pi Calculus. In: Lee, D., Lopes, A., Poetzsch-Heffter, A. (eds.) Formal Techniques for Distributed Systems. Joint 11th IFIP WG 6.1 International Conference FMOODS and 29th IFIP WG 6.1 International Conference FORTE, pp. 182\u2013197. Springer, Berlin, Heidelberg. doi: https:\/\/doi.org\/10.1007\/978-3-642-02138-1_12.","DOI":"10.1007\/978-3-642-02138-1_12."},{"issue":"6","key":"9461_CR19","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1016\/j.ic.2009.07.004","volume":"208","author":"K Chatterjee","year":"2010","unstructured":"Chatterjee, K., Henzinger, T. A., & Piterman, N. (2010). Strategy logic. Information and Computation, 208(6), 677\u2013693. https:\/\/doi.org\/10.1016\/j.ic.2009.07.004","journal-title":"Information and Computation"},{"key":"9461_CR20","doi-asserted-by":"publisher","unstructured":"Cimatti, A., Clarke, E. M., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., & Tacchella, A. (2002). NuSMV 2: An OpenSource Tool for Symbolic Model Checking. In: Computer Aided Verification. 14th International Conference, CAV 2002, pp. 359\u2013364. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/3-540-45657-0_29.","DOI":"10.1007\/3-540-45657-0_29."},{"key":"9461_CR21","doi-asserted-by":"publisher","unstructured":"Clarke, E. M., & Emerson, E. A. (1982). Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logics of Programs, pp. 52\u201371. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/BFb0025774.","DOI":"10.1007\/BFb0025774."},{"key":"9461_CR22","doi-asserted-by":"publisher","unstructured":"Coenen, N., Finkbeiner, B., Hahn, C., & Hofmann, J. (2019) The Hierarchy of Hyperlogics. In: Proc. of the 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS\u201919), Article No.: 39, pp. 1\u201313. IEEE, Vancouver. https:\/\/doi.org\/10.1109\/LICS.2019.8785713.","DOI":"10.1109\/LICS.2019.8785713."},{"key":"9461_CR23","doi-asserted-by":"publisher","unstructured":"De Nicola, R., & Vaandrager, F. (1990). Action versus state based logics for transition systems. In: Guessarian, I. (ed.) Semantics of Systems of Concurrent Processes. LITP Spring School on Theoretical Computer Science 1990, Proceedings. LNCS, vol. 469, pp. 407\u2013419. Springer, Berlin, Heidelberg.https:\/\/doi.org\/10.1007\/3-540-53479-2_17.","DOI":"10.1007\/3-540-53479-2_17."},{"key":"9461_CR24","doi-asserted-by":"publisher","unstructured":"Dechesne, F., Mousavi, M. R., & Orzan, S. (2007). Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap. In: Dershowitz, N., Voronkov, A. (eds.) Logic for Programming, Artificial Intelligence, and Reasoning. 14th International Conference, LPAR. LNAI, vol. 4790, pp. 226\u2013241. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-540-75560-9_18.","DOI":"10.1007\/978-3-540-75560-9_18."},{"key":"9461_CR25","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s11229-010-9765-8","volume":"177","author":"F Dechesne","year":"2010","unstructured":"Dechesne, F., & Wang, Y. (2010). To know or not to know: epistemic approaches to security protocol verification. Synthese, 177, 51\u201376. https:\/\/doi.org\/10.1007\/s11229-010-9765-8","journal-title":"Synthese"},{"key":"9461_CR26","unstructured":"Ditmarsch, H., Halpern, J. Y., Hoek, W., & Kooi, B. (Eds.). (2015). Handbook of Epistemic Logic. College Publications, Rickmansworth, UK."},{"key":"9461_CR27","doi-asserted-by":"publisher","unstructured":"Emerson, E. A., & Halpern, J. Y. (1983). \"Sometimes\" and \"not never\" revisited: on branching versus linear time (preliminary report). In: Proceedings of the 10th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages. POPL\u201983, pp. 127\u2013140. ACM, New York, NY, USA. https:\/\/doi.org\/10.1145\/567067.567081.","DOI":"10.1145\/567067.567081."},{"issue":"3","key":"9461_CR28","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BF00156915","volume":"1","author":"M Finger","year":"1992","unstructured":"Finger, M., & Gabbay, D. M. (1992). Adding a Temporal Dimension to a Logic System. Journal of Logic, Language, and Information, 1(3), 203\u2013233. https:\/\/doi.org\/10.1007\/BF00156915","journal-title":"Journal of Logic, Language, and Information"},{"key":"9461_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04293-9","author":"W Fokkink","year":"2007","unstructured":"Fokkink, W. (2007). Introduction to Process Algebra. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-662-04293-9","journal-title":"Springer, Berlin, Heidelberg."},{"key":"9461_CR30","unstructured":"Girard, P., Seligman, J., & Liu, F. (2012). General dynamic dynamic logic. In: Bolander, T., Bra\u00fcner, T., Ghilardi, S., & Moss, L. (eds.) 9th Conf. on Advances in Modal Logic. Advances in Modal Logic, vol. 9, pp. 239\u2013260. College Publications, Rickmansworth, UK."},{"issue":"1","key":"9461_CR31","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/147508.147524","volume":"39","author":"JA Goguen","year":"1992","unstructured":"Goguen, J. A., & Burstall, R. M. (1992). Institutions: abstract model theory for specification and programming. Journal of the ACM, 39(1), 95\u2013146. https:\/\/doi.org\/10.1145\/147508.147524","journal-title":"Journal of the ACM"},{"key":"9461_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21491-7","author":"R Gorrieri","year":"2015","unstructured":"Gorrieri, R., & Versari, C. (2015). Introduction to Concurrency Theory - Transition Systems and CCS. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-21491-7","journal-title":"Springer, Cham."},{"issue":"1","key":"9461_CR33","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.jlamp.2016.09.001","volume":"86","author":"M Guzman","year":"2017","unstructured":"Guzman, M., Haar, S., Perchy, S., Rueda, C., & Valencia, F. D. (2017). Belief, knowledge, lies and other utterances in an algebra for space and extrusion. Journal of Logical and Algebraic Methods in Programming, 86(1), 107\u2013133. https:\/\/doi.org\/10.1016\/j.jlamp.2016.09.001","journal-title":"Journal of Logical and Algebraic Methods in Programming"},{"issue":"3","key":"9461_CR34","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0004-3702(92)90049-4","volume":"54","author":"JY Halpern","year":"1992","unstructured":"Halpern, J. Y., & Moses, Y. (1992). A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54(3), 319\u2013379. https:\/\/doi.org\/10.1016\/0004-3702(92)90049-4","journal-title":"Artificial Intelligence"},{"key":"9461_CR35","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2516.001.0001","volume-title":"Dynamic Logic","author":"D Harel","year":"2000","unstructured":"Harel, D., Kozen, D., & Tiuryn, J. (2000). Dynamic Logic. Cambridge, MA: MIT Press."},{"key":"9461_CR36","doi-asserted-by":"publisher","unstructured":"Hennessy, M., & Milner, R. (1980). On observing nondeterminism and concurrency. In: Bakker, J.W., & Leeuwen, J. (eds.) Automata, Languages and Programming. Seventh Colloquium. LNCS, vol. 85, pp. 299\u2013309. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/3-540-10003-2_79.","DOI":"10.1007\/3-540-10003-2_79."},{"key":"9461_CR37","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/BF01642508","volume":"3","author":"M Hennessy","year":"1991","unstructured":"Hennessy, M. (1991). A proof system for communicating processes with value-passing. Formal Aspects of Computing, 3, 346\u2013366. https:\/\/doi.org\/10.1007\/BF01642508","journal-title":"Formal Aspects of Computing"},{"issue":"1","key":"9461_CR38","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M Hennessy","year":"1985","unstructured":"Hennessy, M., & Milner, R. (1985). Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1), 137\u2013161. https:\/\/doi.org\/10.1145\/2455.2460","journal-title":"Journal of the ACM"},{"issue":"10","key":"9461_CR39","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"CAR Hoare","year":"1969","unstructured":"Hoare, C. A. R. (1969). An axiomatic basis for computer programming. Communications of the ACM, 12(10), 576\u2013580. https:\/\/doi.org\/10.1145\/363235.363259","journal-title":"Communications of the ACM"},{"key":"9461_CR40","doi-asserted-by":"publisher","unstructured":"Hoek, W., & Wooldridge, M. (2002). Tractable multiagent planning for epistemic goals. In: Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems: Part 3. AAMAS\u201902, pp. 1167\u20131174. ACM, New York, NY, USA. https:\/\/doi.org\/10.1145\/545056.545095.","DOI":"10.1145\/545056.545095."},{"key":"9461_CR41","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.tcs.2012.03.002","volume":"433","author":"S Huang","year":"2012","unstructured":"Huang, S., Cao, Y., Wang, H., & Qu, W. (2012). Value-passing CCS with noisy channels. Theoretical Computer Science, 433, 43\u201359. https:\/\/doi.org\/10.1016\/j.tcs.2012.03.002","journal-title":"Theoretical Computer Science"},{"key":"9461_CR42","doi-asserted-by":"publisher","unstructured":"Knight, S., Mardare, R., & Panangaden, P. (2012). Combining Epistemic Logic and Hennessy-Milner Logic. In: Constable, R.L., & Silva, A. (eds.) Logic and Program Semantics. Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday. LNCS, vol. 7230, pp. 219\u2013243. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-29485-3_14.","DOI":"10.1007\/978-3-642-29485-3_14."},{"key":"9461_CR43","doi-asserted-by":"publisher","unstructured":"Knight, S., Palamidessi, C., Panangaden, P., & Valencia, F. D. (2012). Spatial and epistemic modalities in constraint-based process calculi. In: Koutny, M.,& Ulidowski, I. (eds.) CONCUR - Concurrency Theory, pp. 317\u2013332. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-32940-1_23.","DOI":"10.1007\/978-3-642-32940-1_23."},{"key":"9461_CR44","doi-asserted-by":"publisher","unstructured":"Kooi, B., & Renne, B. (2011). Generalized arrow update logic. In: 13th Conf. on Theoretical Aspects of Rationality and Knowledge (TARK\u201911), pp. 205\u2013211. ACM, New York, NY, USA. https:\/\/doi.org\/10.1145\/2000378.2000403.","DOI":"10.1145\/2000378.2000403."},{"issue":"3","key":"9461_CR45","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. (1983). Results on the propositional $$\\mu $$-calculus. Theoretical Computer Science, 27(3), 333\u2013354. https:\/\/doi.org\/10.1016\/0304-3975(82)90125-6","journal-title":"Theoretical Computer Science"},{"issue":"38","key":"9461_CR46","doi-asserted-by":"publisher","first-page":"5070","DOI":"10.1016\/j.tcs.2011.04.023","volume":"412","author":"C Kupke","year":"2011","unstructured":"Kupke, C., & Pattinson, D. (2011). Coalgebraic semantics of modal logics: An overview. Theoretical Computer Science, 412(38), 5070\u20135094. https:\/\/doi.org\/10.1016\/j.tcs.2011.04.023","journal-title":"Theoretical Computer Science"},{"key":"9461_CR47","doi-asserted-by":"publisher","unstructured":"Minami, K. (2020). Trace Equivalence and Epistemic Logic to Express Security Properties. In: Gotsman, A., Sokolova, A. (eds.) Formal Techniques for Distributed Objects, Components, and Systems. 40th IFIP WG 6.1 International Conference, FORTE, pp. 115\u2013132. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-50086-3_7.","DOI":"10.1007\/978-3-030-50086-3_7."},{"key":"9461_CR48","doi-asserted-by":"publisher","unstructured":"Mousavi, M. R., & Varshosaz, M. (2018). Telling lies in process algebra. In: 2018 Symposium on Theoretical Aspects of Software Engineering (TASE), pp. 116\u2013123. IEEE, New York, NY, USA. https:\/\/doi.org\/10.1109\/TASE.2018.00023.","DOI":"10.1109\/TASE.2018.00023."},{"key":"9461_CR49","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.scico.2016.03.001","volume":"126","author":"R Neves","year":"2016","unstructured":"Neves, R., Madeira, A., Martins, M. A., & Barbosa, L. S. (2016). Proof theory for hybrid(ised) logics. Science of Computer Programming, 126, 73\u201393. https:\/\/doi.org\/10.1016\/j.scico.2016.03.001","journal-title":"Science of Computer Programming"},{"issue":"4","key":"9461_CR50","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1023\/A:1025007018583","volume":"12","author":"R Parikh","year":"2003","unstructured":"Parikh, R., & Ramanujam, R. (2003). A knowledge based semantics of messages. Journal of Logic, Language and Information, 12(4), 453\u2013467. https:\/\/doi.org\/10.1023\/A:1025007018583","journal-title":"Journal of Logic, Language and Information"},{"key":"9461_CR51","doi-asserted-by":"publisher","unstructured":"Pnueli, A. (1977). The temporal logic of programs. In: Proc. of the 18th Annual Symposium on Foundations of Computer Science (SFCS 1977), pp. 46\u201357. https:\/\/doi.org\/10.1109\/SFCS.1977.32.","DOI":"10.1109\/SFCS.1977.32."},{"key":"9461_CR52","doi-asserted-by":"publisher","unstructured":"Poslad, S., & Charlton, P. (2001). Standardizing Agent Interoperability: The FIPA Approach. In: Multi-Agent Systems and Applications. 9th ECCAI Advanced Course ACAI 2001 and Agent Link\u2019s 3rd European Agent Systems Summer School, EASSS 2001. Selected Tutorial Papers. LNCS, vol. 2086, pp. 98\u2013117. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/3-540-47745-4_5.","DOI":"10.1007\/3-540-47745-4_5."},{"issue":"4","key":"9461_CR53","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/1293731.1293735","volume":"2","author":"S Poslad","year":"2007","unstructured":"Poslad, S. (2007). Specifying protocols for multi-agent systems interaction. ACM Transactions on Autonomous and Adaptive Systems, 2(4), 15. https:\/\/doi.org\/10.1145\/1293731.1293735","journal-title":"ACM Transactions on Autonomous and Adaptive Systems"},{"key":"9461_CR54","doi-asserted-by":"publisher","unstructured":"Pratt, V. R. (1976) Semantical Considerations On Floyd-Hoare Logic. In: 17th Annual Symposium on Foundations of Computer Science (SFCS 1976), pp. 109\u2013121. https:\/\/doi.org\/10.1109\/SFCS.1976.27.","DOI":"10.1109\/SFCS.1976.27."},{"issue":"3","key":"9461_CR55","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/s11229-015-0773-6","volume":"193","author":"B Renne","year":"2016","unstructured":"Renne, B., Sack, J., & Yap, A. (2016). Logics of temporal-epistemic actions. Synthese, 193(3), 813\u2013849. https:\/\/doi.org\/10.1007\/s11229-015-0773-6","journal-title":"Synthese"},{"issue":"6","key":"9461_CR56","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1093\/logcom\/exp027","volume":"19","author":"V Rybakov","year":"2009","unstructured":"Rybakov, V. (2009). Linear Temporal Logic $$\\cal{LTL} K$$ extended by Multi-Agent Logic $$K_n$$ with Interacting Agents. Journal of Logic and Computation, 19(6), 989\u20131017. https:\/\/doi.org\/10.1093\/logcom\/exp027","journal-title":"Journal of Logic and Computation"},{"key":"9461_CR57","unstructured":"Saraf, S., & Sourabh, S. (2012). Characterizing successful formulas: the multi-agent case. CoRR arXiv:1209.0935."},{"issue":"6","key":"9461_CR58","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1093\/logcom\/exac016","volume":"32","author":"M Tagliaferri","year":"2022","unstructured":"Tagliaferri, M., & Aldini, A. (2022). From belief to trust: A quantitative framework based on modal logic. Journal of Logic and Computation, 32(6), 1017\u20131047. https:\/\/doi.org\/10.1093\/logcom\/exac016","journal-title":"Journal of Logic and Computation"},{"issue":"2","key":"9461_CR59","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.scico.2010.07.002","volume":"76","author":"MH Ter Beek","year":"2011","unstructured":"Ter Beek, M. H., Fantechi, A., Gnesi, S., & Mazzanti, F. (2011). A state\/event-based model-checking approach for the analysis of abstract system properties. Science of Computer Programming, 76(2), 119\u2013135. https:\/\/doi.org\/10.1016\/j.scico.2010.07.002","journal-title":"Science of Computer Programming"},{"key":"9461_CR60","doi-asserted-by":"publisher","unstructured":"van Ditmarsch, H., van der Hoek, W., & Kooi, B. (2008). Dynamic Epistemic Logic. Syntese Library, vol. 337. Springer, Dordrecht. https:\/\/doi.org\/10.1007\/978-1-4020-5839-4.","DOI":"10.1007\/978-1-4020-5839-4."},{"key":"9461_CR61","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s11229-005-3384-9","volume":"151","author":"H Van Ditmarsch","year":"2006","unstructured":"Van Ditmarsch, H., & Kooi, B. (2006). The secret of my success. Synthese, 151, 201\u2013232. https:\/\/doi.org\/10.1007\/s11229-005-3384-9","journal-title":"Synthese"},{"key":"9461_CR62","doi-asserted-by":"publisher","unstructured":"van Otterloo, S., & Jonker, G. (2005). On epistemic temporal strategic logic. Electronic Notes in Theoretical Computer Science, 126, 77\u201392. 2nd Workshop on Logic and Communication in Multi-Agent Systems (2004). https:\/\/doi.org\/10.1016\/j.entcs.2004.11.014.","DOI":"10.1016\/j.entcs.2004.11.014."}],"container-title":["Journal of Logic, Language and Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-026-09461-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10849-026-09461-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-026-09461-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,29]],"date-time":"2026-08-29T11:02:58Z","timestamp":1788001378000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10849-026-09461-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,11]]},"references-count":62,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["9461"],"URL":"https:\/\/doi.org\/10.1007\/s10849-026-09461-3","relation":{},"ISSN":["0925-8531","1572-9583"],"issn-type":[{"value":"0925-8531","type":"print"},{"value":"1572-9583","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,11]]},"assertion":[{"value":"23 February 2026","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2026","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"All authors have no conflicts of interest.","order":1,"name":"Ethics","label":"Conflicts of Interest","group":{"name":"EthicsHeading","label":"Declarations"}}]}}