{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T16:37:43Z","timestamp":1790354263556,"version":"4.1.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031955884","type":"print"},{"value":"9783031955891","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-95589-1_2","type":"book-chapter","created":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T14:48:35Z","timestamp":1750171715000},"page":"30-49","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Formalizing Errors in\u00a0CCS with\u00a03-Valued Logic"],"prefix":"10.1007","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\/0000-0003-1556-2623","authenticated-orcid":false,"given":"Claudio Antares","family":"Mezzina","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,6,18]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/147508.147527","volume":"39","author":"L Aceto","year":"1992","unstructured":"Aceto, L., Hennessy, M.: Termination, deadlock, and divergence. J. ACM 39(1), 147\u2013187 (1992). https:\/\/doi.org\/10.1145\/147508.147527","journal-title":"J. ACM"},{"issue":"16","key":"2_CR2","doi-asserted-by":"publisher","first-page":"2933","DOI":"10.1002\/sec.1220","volume":"8","author":"A Aldini","year":"2015","unstructured":"Aldini, A.: Modeling and verification of trust and reputation systems. Secur. Commun. Netw. 8(16), 2933\u20132946 (2015). https:\/\/doi.org\/10.1002\/sec.1220","journal-title":"Secur. Commun. Netw."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Avron, A., Konikowska, B.: Proof systems for reasoning about computation errors. Stud. Log.: Int. J. Symb. Log. 91, 273\u2013293 (2009). http:\/\/www.jstor.org\/stable\/40269036","DOI":"10.1007\/s11225-009-9175-4"},{"issue":"1\u20133","key":"2_CR4","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"JA Bergstra","year":"1984","unstructured":"Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Inf. Control 60(1\u20133), 109\u2013137 (1984). https:\/\/doi.org\/10.1016\/S0019-9958(84)80025-X","journal-title":"Inf. Control"},{"issue":"4","key":"2_CR5","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1305\/NDJFL\/1039118863","volume":"39","author":"JA Bergstra","year":"1998","unstructured":"Bergstra, J.A., Ponse, A.: Bochvar-McCarthy logic and process algebra. Notre Dame J. Formal Log. 39(4), 464\u2013484 (1998). https:\/\/doi.org\/10.1305\/NDJFL\/1039118863","journal-title":"Notre Dame J. Formal Log."},{"issue":"8","key":"2_CR6","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1109\/TSE.2017.2707089","volume":"44","author":"FA Bianchi","year":"2018","unstructured":"Bianchi, F.A., Margara, A., Pezz\u00e8, M.: A survey of recent trends in testing concurrent software systems. IEEE Trans. Softw. Eng. 44(8), 747\u2013783 (2018). https:\/\/doi.org\/10.1109\/TSE.2017.2707089","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"1\u20132","key":"2_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1080\/01445348108837023","volume":"2","author":"DA Bochvar","year":"1981","unstructured":"Bochvar, D.A., Bergmann, M.: On a three-valued logical calculus and its application to the analysis of the paradoxes of the classical extended functional calculus. Hist. Philos. Log. 2(1\u20132), 87\u2013112 (1981). https:\/\/doi.org\/10.1080\/01445348108837023","journal-title":"Hist. Philos. Log."},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"de\u00a0Boer, F.S., Coenen, J., Gerth, R.: Exception handling in process algebra. In: Purushothaman, S., Zwarico, A.E. (eds.) NAPAW92. Workshops in Computing, pp. 86\u2013100. Springer, London (1992). https:\/\/doi.org\/10.1007\/978-1-4471-3217-2_6","DOI":"10.1007\/978-1-4471-3217-2_6"},{"key":"2_CR9","unstructured":"Bonzio, S., John, G.S.: On the structure and theory of McCarthy algebras (2025). https:\/\/arxiv.org\/abs\/2503.10816"},{"issue":"3","key":"2_CR10","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/j.tcs.2004.10.005","volume":"330","author":"A Carayol","year":"2005","unstructured":"Carayol, A., Hirschkoff, D., Sangiorgi, D.: On the representation of McCarthy\u2019s amb in the $$\\pi $$-calculus. Theoret. Comput. Sci. 330(3), 439\u2013473 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2004.10.005","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"2_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/11663081.2014.909631","volume":"24","author":"P Cobreros","year":"2014","unstructured":"Cobreros, P., \u00c9gr\u00e9, P., Ripley, D., van Rooij, R.: Foreword: three-valued logics and their applications. J. Appl. Non-Classical Log. 24(1\u20132), 1\u201311 (2014). https:\/\/doi.org\/10.1080\/11663081.2014.909631","journal-title":"J. Appl. Non-Classical Log."},{"issue":"2","key":"2_CR12","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/J.JLAP.2004.05.006","volume":"63","author":"N Dragoni","year":"2005","unstructured":"Dragoni, N., Gaspari, M.: An object based algebra for specifying a fault tolerant software architecture. J. Log. Algebraic Methods Program. 63(2), 271\u2013297 (2005). https:\/\/doi.org\/10.1016\/J.JLAP.2004.05.006","journal-title":"J. Log. Algebraic Methods Program."},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Epstein, J., Black, A.P., Jones, S.L.P.: Towards Haskell in the cloud. In: Claessen, K. (ed.) Proceedings of the 4th ACM SIGPLAN Symposium on Haskell, pp. 118\u2013129. ACM (2011). https:\/\/doi.org\/10.1145\/2034675.2034690","DOI":"10.1145\/2034675.2034690"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Esposito, A., Aldini, A., Bernardo, M.: Branching bisimulation semantics enables noninterference analysis of reversible systems. In: Huisman, M., Ravara, A. (eds.) FORTE 2023. LNCS, vol. 13910, pp. 57\u201374. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-35355-0_5","DOI":"10.1007\/978-3-031-35355-0_5"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Esposito, A., Aldini, A., Bernardo, M., Rossi, S.: Noninterference analysis of reversible systems: An approach based on branching bisimilarity. Log. Methods Comput. Sci. 21(1) (2025). https:\/\/doi.org\/10.46298\/lmcs-21(1:6)2025","DOI":"10.46298\/lmcs-21(1:6)2025"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-319-93767-0_6","volume-title":"Distributed Applications and Interoperable Systems","author":"A Francalanza","year":"2018","unstructured":"Francalanza, A., Mezzina, C.A., Tuosto, E.: Reversible choreographies via monitoring in erlang. In: Bonomi, S., Rivi\u00e8re, E. (eds.) DAIS 2018. LNCS, vol. 10853, pp. 75\u201392. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93767-0_6"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-54804-8_26","volume-title":"Fundamental Approaches to Software Engineering","author":"E Giachino","year":"2014","unstructured":"Giachino, E., Lanese, I., Mezzina, C.A.: Causal-consistent reversible debugging. In: Gnesi, S., Rensink, A. (eds.) FASE 2014. LNCS, vol. 8411, pp. 370\u2013384. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54804-8_26"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Gorrieri, R., Versari, C.: Introduction to Concurrency Theory - Transition systems and CCS. Texts in Theoretical Computer Science. An EATCS Series. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-21491-7","DOI":"10.1007\/978-3-319-21491-7"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-10003-2_79","volume-title":"Automata, Languages and Programming","author":"M Hennessy","year":"1980","unstructured":"Hennessy, M., Milner, R.: On observing nondeterminism and concurrency. In: de Bakker, J., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 299\u2013309. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10003-2_79"},{"key":"2_CR20","unstructured":"Kleene, S.C.: Introduction to Metamathematics. D. van Nostrand (1952)"},{"issue":"2","key":"2_CR21","doi-asserted-by":"publisher","first-page":"167","DOI":"10.3233\/FI-1996-26205","volume":"26","author":"B Konikowska","year":"1996","unstructured":"Konikowska, B.: McCarthy algebras: a model of McCarthy\u2019s logical calculus. Fund. Inform. 26(2), 167\u2013203 (1996). https:\/\/doi.org\/10.3233\/FI-1996-26205","journal-title":"Fund. Inform."},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/J.TCS.2016.02.019","volume":"625","author":"I Lanese","year":"2016","unstructured":"Lanese, I., Mezzina, C.A., Stefani, J.: Reversibility in the higher-order $$\\pi $$-calculus. Theor. Comput. Sci. 625, 25\u201384 (2016). https:\/\/doi.org\/10.1016\/J.TCS.2016.02.019","journal-title":"Theor. Comput. Sci."},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-642-11957-6_20","volume-title":"Programming Languages and Systems","author":"I Lanese","year":"2010","unstructured":"Lanese, I., Vaz, C., Ferreira, C.: On the expressive power of primitives for compensation handling. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol. 6012, pp. 366\u2013386. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11957-6_20"},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"McCarthy, J.: A basis for a mathematical theory of computation. In: Braffort, P., Hirschberg, D. (eds.) Computer Programming and Formal Systems, Studies in Logic and the Foundations of Mathematics, vol.\u00a026, pp. 33\u201370. Elsevier (1959). https:\/\/doi.org\/10.1016\/S0049-237X(09)70099-0","DOI":"10.1016\/S0049-237X(09)70099-0"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","year":"1980","unstructured":"Milner, R. (ed.): A Calculus of Communicating Systems. Lecture Notes in Computer Science, vol. 92. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10235-3"},{"issue":"1\u20132","key":"2_CR26","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/J.JLAP.2006.11.002","volume":"73","author":"I Phillips","year":"2007","unstructured":"Phillips, I., Ulidowski, I.: Reversing algebraic process calculi. J. Log. Algebraic Methods Program. 73(1\u20132), 70\u201396 (2007). https:\/\/doi.org\/10.1016\/J.JLAP.2006.11.002","journal-title":"J. Log. Algebraic Methods Program."},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D., Walker, D.: The Pi-Calculus - A Theory of Mobile Processes. Cambridge University Press (2001)","DOI":"10.1017\/9781316134924"},{"key":"2_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40447-4_1","volume-title":"Trends in Functional Programming","author":"DA Turner","year":"2013","unstructured":"Turner, D.A.: Some history of functional programming languages. In: Loidl, H.-W., Pe\u00f1a, R. (eds.) TFP 2012. LNCS, vol. 7829, pp. 1\u201320. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40447-4_1"}],"container-title":["Lecture Notes in Computer Science","Coordination Models and Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-95589-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T14:52:38Z","timestamp":1778165558000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-95589-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031955884","9783031955891"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-95589-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COORDINATION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Coordination Models and Languages","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lille","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"coordination2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.discotec.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}