{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T02:37:54Z","timestamp":1781836674664,"version":"3.54.5"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031103629","type":"print"},{"value":"9783031103636","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-10363-6_8","type":"book-chapter","created":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T12:20:21Z","timestamp":1656678021000},"page":"113-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Equivalence of\u00a0Denotational and\u00a0Operational Semantics for\u00a0Interaction Languages"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5322-4337","authenticated-orcid":false,"given":"Erwan","family":"Mahe","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6865-5108","authenticated-orcid":false,"given":"Christophe","family":"Gaston","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8955-6835","authenticated-orcid":false,"given":"Pascale Le","family":"Gall","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,7,3]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-540-85361-9_10","volume-title":"CONCUR 2008 - Concurrency Theory","author":"S Akshay","year":"2008","unstructured":"Akshay, S., Bollig, B., Gastin, P., Mukund, M., Narayan Kumar, K.: Distributed timed automata with independently evolving clocks. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 82\u201397. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85361-9_10"},{"key":"8_CR2","unstructured":"Baeten, J.: Process algebra with explicit termination. Computing science reports, Technische Universiteit Eindhoven (2000)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/11506843_9","volume-title":"SDL 2005: Model Driven","author":"C Eichner","year":"2005","unstructured":"Eichner, C., Fleischhack, H., Meyer, R., Schrimpf, U., Stehno, C.: Compositional semantics for UML 2.0 sequence diagrams using petri nets. In: Prinz, A., Reed, R., Reed, J. (eds.) SDL 2005. LNCS, vol. 3530, pp. 133\u2013148. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11506843_9"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-030-51831-8_17","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"S Haddad","year":"2020","unstructured":"Haddad, S., Khmelnitsky, I.: Dynamic recursive petri nets. In: Janicki, R., Sidorova, N., Chatain, T. (eds.) PETRI NETS 2020. LNCS, vol. 12152, pp. 345\u2013366. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51831-8_17"},{"issue":"2","key":"8_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10270-007-0054-z","volume":"7","author":"D Harel","year":"2008","unstructured":"Harel, D., Maoz, S.: Assert and negate revisited: modal semantics for UML sequence diagrams. Softw. Syst. Model. 7(2), 237\u2013252 (2008)","journal-title":"Softw. Syst. Model."},{"key":"8_CR6","volume-title":"Communicating Sequential Processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Hoboken (1985)"},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Ing\u00f3lfsd\u00f3ttir, A., Lin, H.: A symbolic approach to value-passing processes. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, pp. 427\u2013478. Elsevier Science, Amsterdam (2001). https:\/\/doi.org\/10.1016\/B978-044482830-9\/50025-4","DOI":"10.1016\/B978-044482830-9\/50025-4"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-319-15201-1_5","volume-title":"Software Engineering and Formal Methods","author":"J Jacobs","year":"2015","unstructured":"Jacobs, J., Simpson, A.: On a process algebraic representation of sequence diagrams. In: Canal, C., Idani, A. (eds.) SEFM 2014. LNCS, vol. 8938, pp. 71\u201385. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15201-1_5"},{"key":"8_CR9","unstructured":"Knapp, A., Mossakowski, T.: UML interactions meet state machines - an institutional approach. In: 7th Conference on Algebra and Coalgebra in Computer Science (CALCO). Leibniz International Proceedings in Informatics (LIPIcs), vol. 72 (2017)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-540-69489-2_6","volume-title":"Models in Software Engineering","author":"A Knapp","year":"2007","unstructured":"Knapp, A., Wuttke, J.: Model checking of UML 2.0 interactions. In: K\u00fchne, T. (ed.) MODELS 2006. LNCS, vol. 4364, pp. 42\u201351. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-69489-2_6"},{"issue":"1\u20132","key":"8_CR11","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(00)00031-1","volume":"237","author":"K Lodaya","year":"2000","unstructured":"Lodaya, K., Weil, P.: Series-parallel languages and the bounded-width property. Theor. Comput. Sci. 237(1\u20132), 347\u2013380 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(00)00031-1","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"8_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2523108","volume":"23","author":"L Lu","year":"2014","unstructured":"Lu, L., Kim, D.K.: Required behavior of sequence diagrams: semantics and conformance. ACM Trans. Softw. Eng. Methodol. 23(2), 1\u201328 (2014). https:\/\/doi.org\/10.1145\/2523108","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"8_CR13","unstructured":"Mahe, E.: Coq proof for the equivalence of the semantics. erwanm974.github.io\/coq_hibou_label_semantics_equivalence\/. Accessed 14 Oct 2021"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Mahe, E., Bannour, B., Gaston, C., Lapitre, A., Le Gall, P.: A small-step approach to multi-trace checking against interactions. In: Proceedings of the 36th Annual ACM Symposium on Applied Computing, SAC 2021, pp. 1815\u20131822. Association for Computing Machinery, New York (2021). https:\/\/doi.org\/10.1145\/3412841.3442054","DOI":"10.1145\/3412841.3442054"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-030-45234-6_24","volume-title":"Fundamental Approaches to Software Engineering","author":"E Mahe","year":"2020","unstructured":"Mahe, E., Gaston, C., Gall, P.L.: Revisiting semantics of interactions for trace validity analysis. In: FASE 2020. LNCS, vol. 12076, pp. 482\u2013501. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45234-6_24"},{"issue":"17","key":"8_CR16","doi-asserted-by":"publisher","first-page":"1785","DOI":"10.1016\/S1389-1286(99)00060-2","volume":"31","author":"S Mauw","year":"1999","unstructured":"Mauw, S., Reniers, M.A.: Operational semantics for MSC\u201996. Comput. Netw. 31(17), 1785\u20131799 (1999). https:\/\/doi.org\/10.1016\/S1389-1286(99)00060-2","journal-title":"Comput. Netw."},{"issue":"4","key":"8_CR17","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s10270-010-0157-9","volume":"10","author":"Z Micskei","year":"2011","unstructured":"Micskei, Z., Waeselynck, H.: The many meanings of UML 2 sequence diagrams: a survey. Softw. Syst. Model. 10(4), 489\u2013514 (2011)","journal-title":"Softw. Syst. Model."},{"key":"8_CR18","unstructured":"OMG: Unified Modeling Language v2.5.1, December 2017. omg.org\/spec\/UML\/2.5.1\/PDF"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Parrow, J.: An introduction to the $$\\pi $$-calculus. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 479\u2013543. Elsevier, North-Holland (2001)","DOI":"10.1016\/B978-044482830-9\/50026-6"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jlap.2004.05.001","volume":"60\u201361","author":"G Plotkin","year":"2004","unstructured":"Plotkin, G.: A structural approach to operational semantics. J. Log. Algebraic Program. 60\u201361, 17\u2013139 (2004). https:\/\/doi.org\/10.1016\/j.jlap.2004.05.001","journal-title":"J. Log. Algebraic Program."},{"key":"8_CR21","doi-asserted-by":"publisher","unstructured":"Reniers, M.: Message sequence chart: syntax and semantics. Ph.D. thesis, Mathematics and Computer Science (1999). https:\/\/doi.org\/10.6100\/IR524323","DOI":"10.6100\/IR524323"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-540-48654-1_20","volume-title":"CONCUR \u201994: Concurrency Theory","author":"A Rensink","year":"1994","unstructured":"Rensink, A., Wehrheim, H.: Weak sequential composition in process algebras. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol. 836, pp. 226\u2013241. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/978-3-540-48654-1_20"},{"key":"8_CR23","doi-asserted-by":"publisher","unstructured":"St\u00f6rrle, H.: Semantics of interactions in UML 2.0. In: 2003 Proceedings of IEEE Symposium on Human Centric Computing Languages and Environments, pp. 129\u2013136, October 2003. https:\/\/doi.org\/10.1109\/HCC.2003.1260216","DOI":"10.1109\/HCC.2003.1260216"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-10363-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,2]],"date-time":"2022-07-02T08:06:21Z","timestamp":1656749181000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-10363-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031103629","9783031103636"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-10363-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"3 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TASE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Theoretical Aspects of Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tase2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.ubbcluj.ro\/tase2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}