{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T04:23:36Z","timestamp":1745987016249,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642369759"},{"type":"electronic","value":"9783642369766"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36976-6_13","type":"book-chapter","created":{"date-parts":[[2013,3,5]],"date-time":"2013-03-05T11:26:58Z","timestamp":1362482818000},"page":"182-205","source":"Crossref","is-referenced-by-count":2,"title":["Interpreted Systems Semantics for Process Algebra with Identity Annotations"],"prefix":"10.1007","author":[{"given":"Francien","family":"Dechesne","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Reza Mousavi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-642-29320-7_3","volume-title":"Fundamentals of Software Engineering","author":"L. Aceto","year":"2012","unstructured":"Aceto, L., Birgisson, A., Ing\u00f3lfsd\u00f3ttir, A., Mousavi, M.: Decompositional Reasoning about the History of Parallel Processes. In: Arbab, F., Sirjani, M. (eds.) FSEN 2011. LNCS, vol.\u00a07141, pp. 32\u201347. Springer, Heidelberg (2012)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/11539452_16","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"M. Bhargava","year":"2005","unstructured":"Bhargava, M., Palamidessi, C.: Probabilistic Anonymity. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 171\u2013185. Springer, Heidelberg (2005)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Baeten, J.C.M., Basten, T., Reniers, M.A.: Process Algebra: Equational Theories of Communicating Processes. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195003"},{"issue":"5","key":"13_CR4","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10992-008-9099-x","volume":"38","author":"J. Benthem van","year":"2009","unstructured":"van Benthem, J., Gerbrandy, J., Hoshi, T., Pacuit, E.: Merging frameworks for interaction. Journal of Philosophical Logic\u00a038(5), 491\u2013526 (2009)","journal-title":"Journal of Philosophical Logic"},{"issue":"4","key":"13_CR5","doi-asserted-by":"publisher","first-page":"463","DOI":"10.3166\/jancl.19.463-487","volume":"19","author":"I. Boureanu","year":"2009","unstructured":"Boureanu, I., Cohen, M., Lomuscio, A.: A Compilation Method for the Verification of Temporal-Epistemic Properties of Cryptographic Protocols. Journal of Applied Non-Classical Logics\u00a019(4), 463\u2013487 (2009)","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-02138-1_12","volume-title":"Formal Techniques for Distributed Systems","author":"R. Chadha","year":"2009","unstructured":"Chadha, R., Delaune, S., Kremer, S.: Epistemic Logic for the Applied Pi Calculus. In: Lee, D., Lopes, A., Poetzsch-Heffter, A. (eds.) FMOODS 2009. LNCS, vol.\u00a05522, pp. 182\u2013197. Springer, Heidelberg (2009)"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-95891-8_17","volume-title":"SOFSEM 2009: Theory and Practice of Computer Science","author":"K. Chatzikokolakis","year":"2009","unstructured":"Chatzikokolakis, K., Knight, S., Panangaden, P.: Epistemic Strategies and Games on Concurrent Processes. In: Nielsen, M., Ku\u010dera, A., Miltersen, P.B., Palamidessi, C., T\u016fma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol.\u00a05404, pp. 153\u2013166. Springer, Heidelberg (2009)"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D. Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology\u00a01, 65\u201375 (1988)","journal-title":"Journal of Cryptology"},{"key":"13_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-540-75560-9_18","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"F. Dechesne","year":"2007","unstructured":"Dechesne, F., Mousavi, M.R., Orzan, S.: Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol.\u00a04790, pp. 226\u2013241. Springer, Heidelberg (2007)"},{"key":"13_CR10","unstructured":"Dechesne, F., Mousavi, M.R., Orzan, S.: Operational and epistemic approaches to protocol analysis: bridging the gap. Technical Report CSR-07-15, Department of Computer Science, Eindhoven University of Technology (2007)"},{"key":"13_CR11","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.: To know or not to know: epistemic approaches to security protocol verification. Synthese\u00a0177, 51\u201376 (2010)","journal-title":"Synthese"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/10722777_6","volume-title":"Issues in Agent Communication","author":"R. Eijk van","year":"2000","unstructured":"van Eijk, R., de Boer, F., van der Hoek, W., Meyer, J.-J.C.: Operational Semantics for Agent Communication Languages. In: Dignum, F.P.M., Greaves, M. (eds.) Issues in Agent Communication. LNCS, vol.\u00a01916, pp. 80\u201395. Springer, Heidelberg (2000)"},{"key":"13_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-44972-0_5","volume-title":"Communication in Multiagent Systems","author":"R.M. Eijk van","year":"2003","unstructured":"van Eijk, R.M., de Boer, F.S., van der Hoek, W., Meyer, J.-J.Ch.: Process Algebra for Agent Communication: A General Semantic Approach. In: Huget, M.-P. (ed.) Communication in Multiagent Systems. LNCS (LNAI), vol.\u00a02650, pp. 113\u2013128. Springer, Heidelberg (2003)"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. MIT Press (1995)","DOI":"10.7551\/mitpress\/5803.001.0001"},{"key":"#cr-split#-13_CR15.1","doi-asserted-by":"crossref","unstructured":"Halpern, J.Y., Moses, Y.: Knowledge and Common Knowledge in a distributed environment. In: Proceedings of the 3rd ACM Conference on Principles of Distributed Computing, pp. 50-61. ACM (1984)","DOI":"10.1145\/800222.806735"},{"key":"#cr-split#-13_CR15.2","unstructured":"Reprinted in the Journal of the Association for Computing Machinery 37(3), 549-587 (1990)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Halpern, J.Y., O\u2019Neill, K.R.: Anonymity and information hiding in multiagent systems. Journal of Computer Security, 483\u2013514 (2005)","DOI":"10.3233\/JCS-2005-13305"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Halpern, J., Vardi, M.Y.: Reasoning about knowledge and time in asynchronous systems. In: Proceedings of STOC 1988, pp. 53\u201365. ACM Press (1988)","DOI":"10.1145\/62212.62218"},{"issue":"1","key":"13_CR18","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. J. ACM\u00a032(1), 137\u2013161 (1985)","journal-title":"J. ACM"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Hoare, T.: Communicating Sequential Processes. Prentice-Hall (1985)","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/3-540-56596-5_37","volume-title":"Semantics: Foundations and Applications","author":"W. Hoek van der","year":"1993","unstructured":"van der Hoek, W., van Hulst, M., Meyer, J.-J.Ch.: Towards an Epistemic Approach to Reasoning about Concurrent Programs. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1992. LNCS, vol.\u00a0666, pp. 261\u2013287. Springer, Heidelberg (1993)"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s10849-009-9116-7","volume":"19","author":"T. Hoshi","year":"2010","unstructured":"Hoshi, T.: Merging DEL and ETL. J. of Logic, Lang. and Inf.\u00a019, 413\u2013430 (2010)","journal-title":"J. of Logic, Lang. and Inf."},{"issue":"1","key":"13_CR22","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/JCS-2004-12102","volume":"12","author":"D. Hughes","year":"2004","unstructured":"Hughes, D., Shmatikov, V.: Information hiding, anonymity and privacy: A modular approach. Journal of Computer Security\u00a012(1), 3\u201336 (2004)","journal-title":"Journal of Computer Security"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"van Hulst, M., Meyer, J.-J.Ch.: An epistemic proof system for parallel processes: extended abstract. In: Proceeding of TARK 1994, pp. 243\u2013254. ACM Press (1994)","DOI":"10.1016\/B978-1-4832-1453-5.50021-0"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Katz, S., Taubenfeld, G.: What Processes Know: Definitions and Proof Methods. In: Proceedings of PODC 1986, pp. 249\u2013262. ACM Press (1986)","DOI":"10.1145\/10590.10612"},{"issue":"4","key":"13_CR25","doi-asserted-by":"publisher","first-page":"489","DOI":"10.3166\/jancl.19.489-516","volume":"19","author":"S. Kramer","year":"2009","unstructured":"Kramer, S., Palamidessi, C., Segala, R., Turrini, A., Braun, C.: A quantitative doxastic logic for probabilistic processes and applications to information-hiding. The Journal of Applied Non-Classical Logic\u00a019(4), 489\u2013516 (2009)","journal-title":"The Journal of Applied Non-Classical Logic"},{"key":"13_CR26","unstructured":"Lomuscio, A., Ryan, M.: Ideal agents sharing (some!) knowledge. In: Proceedings of ECAI 1998, pp. 557\u2013561. John Wiley and Sons (1998)"},{"key":"13_CR27","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":"13_CR28","doi-asserted-by":"crossref","unstructured":"van der Meyden, R., Su, K.: Symbolic model checking the knowledge of the dining cryptographers. In: Proceedings of CSFW 2004, pp. 280\u2013291. IEEE (2004)","DOI":"10.1109\/CSFW.2004.1310747"},{"key":"13_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communication Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"key":"13_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-15648-8_21","volume-title":"Logics of Programs","author":"R. Parikh","year":"1985","unstructured":"Parikh, R., Ramanujam, R.: Distributed Processes and the Logic of Knowledge. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol.\u00a0193, pp. 256\u2013268. Springer, Heidelberg (1985)"},{"key":"13_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D.M.R. Park","year":"1981","unstructured":"Park, D.M.R.: Concurrency and Automata on Infinite Sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"key":"13_CR32","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jlap.2004.03.009","volume":"60","author":"G.D. Plotkin","year":"2004","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. Journal of Logic and Algebraic Programming\u00a060, 17\u2013139 (2004)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"13_CR33","doi-asserted-by":"crossref","unstructured":"Raimondi, F., Lomuscio, A.: A tool for specification and verification of epistemic properties in interpreted systems. Electronic Notes in Theoretical Computer Science\u00a085(4) (2004)","DOI":"10.1016\/S1571-0661(05)82609-X"},{"key":"13_CR34","doi-asserted-by":"crossref","unstructured":"Richards, S., Sadrzadeh, M.: Aximo: Automated axiomatic reasoning for information update. In: Proceedings of M4M5 2007. ENTCS, vol.\u00a0231, pp. 211\u2013225. Elsevier (2009)","DOI":"10.1016\/j.entcs.2009.02.037"},{"key":"13_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/3-540-61770-1_38","volume-title":"Computer Security - ESORICS 96","author":"S. Schneider","year":"1996","unstructured":"Schneider, S., Sidiropoulos, A.: CSP and Anonymity. In: Martella, G., Kurth, H., Montolivo, E., Bertino, E. (eds.) ESORICS 1996. LNCS, vol.\u00a01146, pp. 198\u2013218. Springer, Heidelberg (1996)"},{"key":"13_CR36","doi-asserted-by":"crossref","unstructured":"Toninho, B., Caires, L.: A spatial-epistemic logic for reasoning about security protocols. In: Proceedings of SecCo 2010. EPTCS, vol.\u00a051, pp. 1\u201315 (2010)","DOI":"10.4204\/EPTCS.51.1"},{"key":"13_CR37","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-44637-0_2","volume-title":"Intelligent Agents: Specification, Modeling, and Application","author":"W. Vries de","year":"2001","unstructured":"de Vries, W., de Boer, F.S., van der Hoek, W., Meyer, J.-J.Ch.: A Truly Concurrent Model for Interacting Agents. In: Yuan, S.-T., Yokoo, M. (eds.) PRIMA 2001. LNCS (LNAI), vol.\u00a02132, pp. 16\u201330. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36976-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T23:06:28Z","timestamp":1745967988000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36976-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642369759","9783642369766"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36976-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}