{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:31:56Z","timestamp":1775097116528,"version":"3.50.1"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030906351","type":"print"},{"value":"9783030906368","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-90636-8_4","type":"book-chapter","created":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T09:02:36Z","timestamp":1636016556000},"page":"63-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Canonical Algebra of Open Transition Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7783-5079","authenticated-orcid":false,"given":"Elena","family":"Di Lavore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4216-5199","authenticated-orcid":false,"given":"Alessandro","family":"Gianola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3158-1226","authenticated-orcid":false,"given":"Mario","family":"Rom\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2846-4475","authenticated-orcid":false,"given":"Nicoletta","family":"Sabadini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7992-9685","authenticated-orcid":false,"given":"Pawe\u0142","family":"Soboci\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,28]]},"reference":[{"key":"4_CR1","unstructured":"Abramsky, S.: What are the fundamental structures of concurrency? We still don\u2019t know! CoRR abs\/1401.4973 (2014). http:\/\/arxiv.org\/abs\/1401.4973"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Ad\u00e1mek, J., Milius, S., Velebil, J.: Elgot algebras. Log. Methods Comput. Sci. 2(5) (2006). https:\/\/doi.org\/10.2168\/LMCS-2(5:4)2006","DOI":"10.2168\/LMCS-2(5:4)2006"},{"key":"4_CR3","unstructured":"Baez, J.C., Courser, K.: Structured cospans. CoRR abs\/1911.04630 (2019)"},{"key":"4_CR4","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0074299","volume-title":"Reports of the Midwest Category Seminar","author":"J B\u00e9nabou","year":"1967","unstructured":"B\u00e9nabou, J.: Introduction to bicategories. In: Reports of the Midwest Category Seminar. LNM, vol. 47, pp. 1\u201377. Springer, Heidelberg (1967). https:\/\/doi.org\/10.1007\/BFb0074299"},{"issue":"4","key":"4_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1051\/ita:2003020","volume":"37","author":"N Benton","year":"2003","unstructured":"Benton, N., Hyland, M.: Traced premonoidal categories. RAIRO Theor. Inform. Appl. 37(4), 273\u2013299 (2003). https:\/\/doi.org\/10.1051\/ita:2003020","journal-title":"RAIRO Theor. Inform. Appl."},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration Theories - The Equational Logic of Iterative Processes. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/978-3-642-78034-9","DOI":"10.1007\/978-3-642-78034-9"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Bonchi, F., Holland, J., Piedeleu, R., Soboci\u0144ski, P., Zanasi, F.: Diagrammatic algebra: from linear to concurrent systems. Proc. ACM Program. Lang. 3(POPL), 25:1\u201325:28 (2019). https:\/\/doi.org\/10.1145\/3290338","DOI":"10.1145\/3290338"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.ic.2016.03.002","volume":"252","author":"F Bonchi","year":"2017","unstructured":"Bonchi, F., Soboci\u0144ski, P., Zanasi, F.: The calculus of signal flow diagrams I: linear relations on streams. Inf. Comput. 252, 2\u201329 (2017). https:\/\/doi.org\/10.1016\/j.ic.2016.03.002","journal-title":"Inf. Comput."},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-23217-6_21","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"R Bruni","year":"2011","unstructured":"Bruni, R., Melgratti, H., Montanari, U.: A connector algebra for P\/T nets interactions. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 312\u2013326. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23217-6_21"},{"issue":"1\u20132","key":"4_CR10","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0022-4049(87)90121-6","volume":"49","author":"A Carboni","year":"1987","unstructured":"Carboni, A., Walters, R.F.C.: Cartesian bicategories I. J. Pure Appl. Algebra 49(1\u20132), 11\u201332 (1987)","journal-title":"J. Pure Appl. Algebra"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-662-46678-0_26","volume-title":"Foundations of Software Science and Computation Structures","author":"R Clouston","year":"2015","unstructured":"Clouston, R., Bizjak, A., Grathwohl, H.B., Birkedal, L.: Programming and reasoning with guarded recursion for coinductive types. In: Pitts, A. (ed.) FoSSaCS 2015. LNCS, vol. 9034, pp. 407\u2013421. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46678-0_26"},{"key":"4_CR12","unstructured":"Eccles, W.H., Jordan, F.W.: Improvements in ionic relays. British patent number: GB 148582 (1918)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Elgot, C.C.: Monadic computation and iterative algebraic theories. In: Studies in Logic and the Foundations of Mathematics, vol. 80, pp. 175\u2013230. Elsevier (1975)","DOI":"10.1016\/S0049-237X(08)71949-9"},{"issue":"33","key":"4_CR14","first-page":"1096","volume":"30","author":"B Fong","year":"2015","unstructured":"Fong, B.: Decorated cospans. Theory Appl. Categories 30(33), 1096\u20131120 (2015)","journal-title":"Theory Appl. Categories"},{"issue":"1\u20134","key":"4_CR15","first-page":"221","volume":"171","author":"A Gianola","year":"2020","unstructured":"Gianola, A., Kasangian, S., Manicardi, D., Sabadini, N., Schiavio, F., Tini, S.: CospanSpan(Graph): a compositional description of the heart system. Fundam. Informaticae 171(1\u20134), 221\u2013237 (2020)","journal-title":"Fundam. Informaticae"},{"key":"4_CR16","unstructured":"Gianola, A., Kasangian, S., Manicardi, D., Sabadini, N., Tini, S.: Compositional modeling of biological systems in CospanSpan(Graph). In: Proceedings of ICTCS 2020. CEUR-WS (2020, to appear)"},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"Gianola, A., Kasangian, S., Sabadini, N.: Cospan\/Span(Graph): an algebra for open, reconfigurable automata networks. In: Bonchi, F., K\u00f6nig, B. (eds.) 7th Conference on Algebra and Coalgebra in Computer Science, CALCO 2017, Ljubljana, Slovenia, 12\u201316 June 2017. LIPIcs, vol. 72, pp. 2:1\u20132:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.CALCO.2017.2","DOI":"10.4230\/LIPIcs.CALCO.2017.2"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J Girard","year":"1987","unstructured":"Girard, J.: Linear logic. Theor. Comput. Sci. 50, 1\u2013102 (1987). https:\/\/doi.org\/10.1016\/0304-3975(87)90045-4","journal-title":"Theor. Comput. Sci."},{"issue":"69\u2013108","key":"4_CR19","first-page":"6","volume":"92","author":"JY Girard","year":"1989","unstructured":"Girard, J.Y.: Towards a geometry of interaction. Contemp. Math. 92(69\u2013108), 6 (1989)","journal-title":"Contemp. Math."},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-319-89366-2_17","volume-title":"Foundations of Software Science and Computation Structures","author":"S Goncharov","year":"2018","unstructured":"Goncharov, S., Schr\u00f6der, L.: Guarded traced categories. In: Baier, C., Dal Lago, U. (eds.) FoSSaCS 2018. LNCS, vol. 10803, pp. 313\u2013330. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89366-2_17"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-62688-3_37","volume-title":"Typed Lambda Calculi and Applications","author":"M Hasegawa","year":"1997","unstructured":"Hasegawa, M.: Recursion from cyclic sharing: traced monoidal categories and models of cyclic lambda calculi. In: de Groote, P., Roger Hindley, J. (eds.) TLCA 1997. LNCS, vol. 1210, pp. 196\u2013213. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62688-3_37"},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"Hasegawa, M.: The uniformity principle on traced monoidal categories. In: Blute, R., Selinger, P. (eds.) Category Theory and Computer Science, CTCS 2002, Ottawa, Canada, 15\u201317 August 2002. Electronic Notes in Theoretical Computer Science, vol. 69, pp. 137\u2013155. Elsevier (2002). https:\/\/doi.org\/10.1016\/S1571-0661(04)80563-2","DOI":"10.1016\/S1571-0661(04)80563-2"},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"Hoshino, N., Muroya, K., Hasuo, I.: Memoryful geometry of interaction: from coalgebraic components to algebraic effects. In: Henzinger, T.A., Miller, D. (eds.) Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS 2014, Vienna, Austria, 14\u201318 July 2014, pp. 52:1\u201352:10. ACM (2014). https:\/\/doi.org\/10.1145\/2603088.2603124","DOI":"10.1145\/2603088.2603124"},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Joyal, A., Street, R., Verity, D.: Traced monoidal categories. Math. Proc. Cambridge Philos. Soc. 119, 447\u2013468 (1996). https:\/\/doi.org\/10.1017\/S0305004100074338","DOI":"10.1017\/S0305004100074338"},{"key":"4_CR25","unstructured":"Kalman, R.E., Falb, P.L., Arbib, M.A.: Topics in Mathematical System Theory, vol. 1. McGraw-Hill, New York (1969)"},{"issue":"2","key":"4_CR26","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0022-4049(96)00012-6","volume":"115","author":"P Katis","year":"1997","unstructured":"Katis, P., Sabadini, N., Walters, R.F.C.: Bicategories of processes. J. Pure Appl. Algebra 115(2), 141\u2013178 (1997)","journal-title":"J. Pure Appl. Algebra"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BFb0000479","volume-title":"Algebraic Methodology and Software Technology","author":"P Katis","year":"1997","unstructured":"Katis, P., Sabadini, N., Walters, R.F.C.: Span(Graph): a categorical algebra of transition systems. In: Johnson, M. (ed.) AMAST 1997. LNCS, vol. 1349, pp. 307\u2013321. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0000479"},{"key":"4_CR28","unstructured":"Katis, P., Sabadini, N., Walters, R.F.C.: On the algebra of feedback and systems with boundary. In: Rendiconti del Seminario Matematico di Palermo (1999)"},{"key":"4_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/3-540-45263-X_17","volume-title":"Coordination Languages and Models","author":"P Katis","year":"2000","unstructured":"Katis, P., Sabadini, N., Walters, R.F.C.: A formalization of the IWIM model. In: Porto, A., Roman, G.-C. (eds.) COORDINATION 2000. LNCS, vol. 1906, pp. 267\u2013283. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45263-X_17"},{"issue":"2","key":"4_CR30","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1051\/ita:2002009","volume":"36","author":"P Katis","year":"2002","unstructured":"Katis, P., Sabadini, N., Walters, R.F.C.: Feedback, trace and fixed-point semantics. RAIRO-Theor. Inform. Appl. 36(2), 181\u2013194 (2002). https:\/\/doi.org\/10.1051\/ita:2002009","journal-title":"RAIRO-Theor. Inform. Appl."},{"key":"4_CR31","unstructured":"Katis, P., Sabadini, N., Walters, R.F.C.: A process algebra for the Span(Graph) model of concurrency. arXiv preprint arXiv:0904.3964 (2009)"},{"issue":"9","key":"4_CR32","first-page":"147","volume":"13","author":"S Lack","year":"2004","unstructured":"Lack, S.: Composing PROPs. Theory Appl. Categories 13(9), 147\u2013163 (2004)","journal-title":"Theory Appl. Categories"},{"key":"4_CR33","doi-asserted-by":"publisher","unstructured":"Mac Lane, S.: Categories for the Working Mathematician. Graduate Texts in Mathematics, Springer, New York (1978). https:\/\/doi.org\/10.1007\/978-1-4757-4721-8","DOI":"10.1007\/978-1-4757-4721-8"},{"issue":"9","key":"4_CR34","doi-asserted-by":"publisher","first-page":"1144","DOI":"10.1109\/JRPROC.1953.274449","volume":"41","author":"SJ Mason","year":"1953","unstructured":"Mason, S.J.: Feedback theory - some properties of signal flow graphs. Proc. Inst. Radio Eng. 41(9), 1144\u20131156 (1953). https:\/\/doi.org\/10.1109\/JRPROC.1953.274449","journal-title":"Proc. Inst. Radio Eng."},{"issue":"5","key":"4_CR35","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1002\/j.1538-7305.1955.tb03788.x","volume":"34","author":"GH Mealy","year":"1955","unstructured":"Mealy, G.H.: A method for synthesizing sequential circuits. Bell Syst. Tech. J. 34(5), 1045\u20131079 (1955)","journal-title":"Bell Syst. Tech. J."},{"issue":"3\u20134","key":"4_CR36","first-page":"407","volume":"150","author":"S Milius","year":"2017","unstructured":"Milius, S., Litak, T.: Guard your daggers and traces: properties of guarded (co-) recursion. Fund. Inform. 150(3\u20134), 407\u2013449 (2017)","journal-title":"Fund. Inform."},{"issue":"6","key":"4_CR37","first-page":"164","volume":"15","author":"R Rosebrugh","year":"2005","unstructured":"Rosebrugh, R., Sabadini, N., Walters, R.F.C.: Generic commutative separable algebras and cospans of graphs. Theory Appl. Categories 15(6), 164\u2013177 (2005)","journal-title":"Theory Appl. Categories"},{"key":"4_CR38","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.tcs.2016.01.028","volume":"664","author":"N Sabadini","year":"2017","unstructured":"Sabadini, N., Schiavio, F., Walters, R.F.C.: On the geometry and algebra of networks with state. Theor. Comput. Sci. 664, 144\u2013163 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR39","doi-asserted-by":"publisher","unstructured":"Selinger, P.: A survey of graphical languages for monoidal categories. In: Coecke B. (ed.) New Structures for Physics, vol. 813, pp. 289\u2013355. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12821-9_4","DOI":"10.1007\/978-3-642-12821-9_4"},{"key":"4_CR40","unstructured":"Shannon, C.E.: The Theory and Design of Linear Differential Equation Machines. Bell Telephone Laboratories (1942)"},{"key":"4_CR41","doi-asserted-by":"publisher","unstructured":"Soboci\u0144ski, P.: A non-interleaving process calculus for multi-party synchronisation. In: 2nd Interaction and Concurrency Experience: Structured Interactions, (ICE 2009). EPTCS, vol. 12 (2009). https:\/\/doi.org\/10.4204\/eptcs.12.6. http:\/\/users.ecs.soton.ac.uk\/ps\/papers\/ice09.pdf","DOI":"10.4204\/eptcs.12.6"},{"key":"4_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-642-15375-4_38","volume-title":"CONCUR 2010 - Concurrency Theory","author":"P Soboci\u0144ski","year":"2010","unstructured":"Soboci\u0144ski, P.: Representations of Petri net interactions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 554\u2013568. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15375-4_38"}],"container-title":["Lecture Notes in Computer Science","Formal Aspects of Component Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90636-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T09:03:10Z","timestamp":1636016590000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90636-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030906351","9783030906368"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90636-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"28 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FACS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Aspects of Component Software","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"facs2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/facs2021.inria.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","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":"16","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":"7","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":"1","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":"44% - 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":"1,7","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)"}}]}}