{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T20:19:01Z","timestamp":1773433141251,"version":"3.50.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,3,21]],"date-time":"2023-03-21T00:00:00Z","timestamp":1679356800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,21]],"date-time":"2023-03-21T00:00:00Z","timestamp":1679356800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"publisher","award":["2014-2020.4.05.19-0001"],"award-info":[{"award-number":["2014-2020.4.05.19-0001"]}],"id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002301","name":"Eesti Teadusagentuur","doi-asserted-by":"publisher","award":["PRG1210"],"award-info":[{"award-number":["PRG1210"]}],"id":[{"id":"10.13039\/501100002301","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Softw Syst Model"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s10270-023-01092-7","type":"journal-article","created":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T02:45:29Z","timestamp":1679885129000},"page":"495-520","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Span(Graph): a canonical feedback algebra of open transition systems"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7783-5079","authenticated-orcid":false,"given":"Elena","family":"Di\u00a0Lavore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Gianola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Rom\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicoletta","family":"Sabadini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Soboci\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,21]]},"reference":[{"key":"1092_CR1","unstructured":"Abramsky, S.: What are the fundamental structures of concurrency? We still don\u2019t know! (2014). arxiv:1401.4973"},{"key":"1092_CR2","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-2(5:4)2006","author":"J Ad\u00e1mek","year":"2006","unstructured":"Ad\u00e1mek, J., Milius, S., Velebil, J.: Elgot algebras. Log. Methods Comput. Sci. (2006). https:\/\/doi.org\/10.2168\/LMCS-2(5:4)2006","journal-title":"Log. Methods Comput. Sci."},{"key":"1092_CR3","unstructured":"Baez, J.C., Courser, K.: Structured cospans. arXiv:1911.04630 (2019)"},{"key":"1092_CR4","doi-asserted-by":"crossref","unstructured":"B\u00e9nabou, J.: Introduction to bicategories. In: Reports of the Midwest Category Seminar. Springer, pp. 1\u201377 (1967)","DOI":"10.1007\/BFb0074299"},{"issue":"4","key":"1092_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":"1092_CR6","doi-asserted-by":"publisher","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration theories\u2014the equational logic of iterative processes. In: EATCS Monographs on Theoretical Computer Science. Springer (1993). https:\/\/doi.org\/10.1007\/978-3-642-78034-9","DOI":"10.1007\/978-3-642-78034-9"},{"issue":"POPL","key":"1092_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3290338","volume":"3","author":"F Bonchi","year":"2019","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), 1\u201328 (2019). https:\/\/doi.org\/10.1145\/3290338. (Article No.: 25)","journal-title":"Proc. ACM Program. Lang."},{"key":"1092_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":"1092_CR9","doi-asserted-by":"publisher","unstructured":"Bruni, R., Melgratti, H.C., Montanari, U.: A connector algebra for P\/T nets interactions. In: Concurrency Theory (CONCUR\u201911), vol. 6901 of LNCS. Springer, pp. 312\u2013326 (2011). https:\/\/doi.org\/10.1007\/978-3-642-23217-6_21","DOI":"10.1007\/978-3-642-23217-6_21"},{"issue":"1\u20132","key":"1092_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":"1092_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.entcs.2004.08.020","volume":"104","author":"A Cherubini","year":"2004","unstructured":"Cherubini, A., Sabadini, N., Walters, R.F.C.: Timing in the Cospan\/Span model. Electron. Notes Theor. Comput. Sci. 104, 81\u201397 (2004)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"1092_CR12","doi-asserted-by":"publisher","unstructured":"Clouston, R., Bizjak, A., Grathwohl, H.B., Birkedal, L.: Programming and reasoning with guarded recursion for coinductive types. In: Andrew, M.P. (ed.), Foundations of Software Science and Computation Structures\u201418th International Conference, FoSSaCS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, April 11\u201318, 2015. Proceedings, vol. 9034 of Lecture Notes in Computer Science. Springer, pp. 407\u2013421 (2015). https:\/\/doi.org\/10.1007\/978-3-662-46678-0_26","DOI":"10.1007\/978-3-662-46678-0_26"},{"key":"1092_CR13","doi-asserted-by":"crossref","unstructured":"de Francesco Albasini L., Sabadini, N., Walters, R.F.C.: The compositional construction of Markov processes. Appl. Categ. Struct. 19(1), 425\u2013437 (2011)","DOI":"10.1007\/s10485-010-9233-0"},{"key":"1092_CR14","doi-asserted-by":"crossref","unstructured":"de Francesco Albasini L., Sabadini, N., Walters, R.F.C.: The compositional construction of Markov processes II. RAIRO Theor. Inform. Appl. 45(1), 117\u2013142 (2011)","DOI":"10.1051\/ita\/2011015"},{"key":"1092_CR15","doi-asserted-by":"publisher","unstructured":"Dezani-Ciancaglini, M., de\u2019Liguoro, U.: Sessions and session types: An overview. In: Cosimo, L., Jianwen S. (eds.), Web Services and Formal Methods, 6th International Workshop, WS-FM 2009, Bologna, Italy, September 4\u20135, 2009, Revised Selected Papers, vol. 6194 of Lecture Notes in Computer Science. Springer, pp. 1\u201328 (2009). https:\/\/doi.org\/10.1007\/978-3-642-14458-5_1","DOI":"10.1007\/978-3-642-14458-5_1"},{"key":"1092_CR16","doi-asserted-by":"publisher","unstructured":"Di\u00a0Lavore, E., de\u00a0Felice, G., Rom\u00e1n, M.: Monoidal streams for dataflow programming. In: Proceedings of the 37th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS\u201922. Association for Computing Machinery, New York (2022). https:\/\/doi.org\/10.1145\/3531130.3533365","DOI":"10.1145\/3531130.3533365"},{"key":"1092_CR17","unstructured":"Eccles, W.H., Jordan, F.W.: Improvements in ionic relays. British Patent Number: GB 148582 (1918)"},{"key":"1092_CR18","doi-asserted-by":"crossref","unstructured":"Elgot, C.C.: Monadic computation and iterative algebraic theories. In: Studies in Logic and the Foundations of Mathematics, vol.\u00a080, pp. 175\u2013230. Elsevier (1975)","DOI":"10.1016\/S0049-237X(08)71949-9"},{"issue":"33","key":"1092_CR19","first-page":"1096","volume":"30","author":"B Fong","year":"2015","unstructured":"Fong, B.: Decorated cospans. Theory Appl. Categ. 30(33), 1096\u20131120 (2015)","journal-title":"Theory Appl. Categ."},{"key":"1092_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/9781108668804","volume-title":"An Invitation to Applied Category Theory: Seven Sketches in Compositionality","author":"B Fong","year":"2019","unstructured":"Fong, B., Spivak, D.I.: An Invitation to Applied Category Theory: Seven Sketches in Compositionality. Cambridge University Press (2019)"},{"issue":"1\u20134","key":"1092_CR21","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. Inform. 171(1\u20134), 221\u2013237 (2020)","journal-title":"Fundam. Inform."},{"key":"1092_CR22","unstructured":"Gianola, A., Kasangian, S., Manicardi, D., Sabadini, N., Tini, S.: Compositional modeling of biological systems in CospanSpan(Graph). In: Proceedings of the ICTCS. CEUR-WS (2020) (To appear)"},{"key":"1092_CR23","doi-asserted-by":"publisher","unstructured":"Gianola, A., Kasangian, S., Sabadini, N.: Cospan\/Span(Graph): an Algebra for Open, Reconfigurable Automata Networks. In: Filippo, B., Barbara K. (eds.), 7th Conference on Algebra and Coalgebra in Computer Science, CALCO 2017, June 12\u201316, 2017, Ljubljana, Slovenia, vol.\u00a072 of LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, pp. 2:1\u20132:17 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.CALCO.2017.2","DOI":"10.4230\/LIPIcs.CALCO.2017.2"},{"key":"1092_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J-Y Girard","year":"1987","unstructured":"Girard, J.-Y.: 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":"1092_CR25","first-page":"6","volume":"92","author":"J-Y Girard","year":"1989","unstructured":"Girard, J.-Y.: Towards a geometry of interaction. Contemp. Math. 92(69\u2013108), 6 (1989)","journal-title":"Contemp. Math."},{"key":"1092_CR26","doi-asserted-by":"publisher","unstructured":"Goncharov, S., Schr\u00f6der, L.: Guarded traced categories. In: Christel, B., Ugo,\u00a0D.L. (eds.), Foundations of Software Science and Computation Structures\u201421st International Conference, FOSSACS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14\u201320, 2018, Proceedings, vol. 10803 of Lecture Notes in Computer Science. Springer, pp. 313\u2013330 (2018). https:\/\/doi.org\/10.1007\/978-3-319-89366-2_17","DOI":"10.1007\/978-3-319-89366-2_17"},{"key":"1092_CR27","doi-asserted-by":"publisher","unstructured":"Hasegawa, M.: Recursion from cyclic sharing: traced monoidal categories and models of cyclic lambda calculi. In: de\u00a0Groote, P. (ed), Typed Lambda Calculi and Applications, Third International Conference on Typed Lambda Calculi and Applications, TLCA\u201997, Nancy, April 2\u20134, 1997, Proceedings, vol. 1210 of Lecture Notes in Computer Science. Springer, pp. 196\u2013213 (1997). https:\/\/doi.org\/10.1007\/3-540-62688-3_37","DOI":"10.1007\/3-540-62688-3_37"},{"key":"1092_CR28","doi-asserted-by":"publisher","unstructured":"Hasegawa, M.: The uniformity principle on traced monoidal categories. In: Richard, B., Peter, S. (eds.), Category Theory and Computer Science, CTCS 2002, Ottawa, Canada, August 15\u201317, 2002, vol.\u00a069 of Electronic Notes in Theoretical Computer Science. Elsevier, pp. 137\u2013155 (2002). https:\/\/doi.org\/10.1016\/S1571-0661(04)80563-2","DOI":"10.1016\/S1571-0661(04)80563-2"},{"key":"1092_CR29","doi-asserted-by":"publisher","unstructured":"Hoshino, N., Muroya, K., Hasuo, I.: Memoryful geometry of interaction: from coalgebraic components to algebraic effects. In Thomas\u00a0A.H., Dale, M. (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\u201914, Vienna, July 14\u201318 (2014). ACM, pp. 52:1\u201352:10 (2014). https:\/\/doi.org\/10.1145\/2603088.2603124","DOI":"10.1145\/2603088.2603124"},{"key":"1092_CR30","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1017\/S0305004100074338","volume":"119","author":"A Joyal","year":"1996","unstructured":"Joyal, A., Street, R., Verity, D.: Traced monoidal categories. Math. Proc. Camb. Philos. Soc. 119, 447\u2013468 (1996). https:\/\/doi.org\/10.1017\/S0305004100074338","journal-title":"Math. Proc. Camb. Philos. Soc."},{"key":"1092_CR31","volume-title":"Topics in Mathematical System Theory","author":"RE Kalman","year":"1969","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":"1092_CR32","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":"1092_CR33","doi-asserted-by":"publisher","unstructured":"Katis, P., Sabadini, N., Walters, R.F.C.: Span(Graph): a categorial algebra of transition systems. In: Michael, J. (ed.), Algebraic Methodology and Software Technology, 6th International Conference, AMAST\u201997, Sydney, December 13\u201317, 1997, Proceedings, vol. 1349 of Lecture Notes in Computer Science. Springer, pp. 307\u2013321 (1997). https:\/\/doi.org\/10.1007\/BFb0000479","DOI":"10.1007\/BFb0000479"},{"key":"1092_CR34","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":"1092_CR35","doi-asserted-by":"publisher","unstructured":"Katis, P., Sabadini, N., Walters, R.F.C.: A formalization of the IWIM model. In: Ant\u00f3nio, P., Gruia-Catalin, R. (eds.), Coordination Languages and Models, 4th International Conference, COORDINATION 2000, Limassol, Cyprus, September 11\u201313, 2000, Proceedings, vol. 1906 of Lecture Notes in Computer Science. Springer, pp. 267\u2013283 (2000). https:\/\/doi.org\/10.1007\/3-540-45263-X_17","DOI":"10.1007\/3-540-45263-X_17"},{"issue":"2","key":"1092_CR36","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":"1092_CR37","unstructured":"Katis, P., Sabadini, N., Walters, R.F.C.: A Process Algebra for the Span(Graph) Model of Concurrency. arXiv:0904.3964 (2009)"},{"issue":"9","key":"1092_CR38","first-page":"147","volume":"13","author":"S Lack","year":"2004","unstructured":"Lack, S.: Composing PROPs. Theory Appl. Categ. 13(9), 147\u2013163 (2004)","journal-title":"Theory Appl. Categ."},{"key":"1092_CR39","doi-asserted-by":"publisher","unstructured":"Di Lavore, E., Gianola, A., Rom\u00e1n, M., Sabadini, N., Soboci\u0144ski, P.: A canonical algebra of open transition systems. In: Gwen, S., Anton, W. (ed.), Formal Aspects of Component Software\u201417th International Conference, FACS 2021, Virtual Event, October 28\u201329, 2021, Proceedings, vol. 13077 of Lecture Notes in Computer Science. Springer, pp. 63\u201381 (2021). https:\/\/doi.org\/10.1007\/978-3-030-90636-8_4","DOI":"10.1007\/978-3-030-90636-8_4"},{"key":"1092_CR40","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4721-8","volume-title":"Categories for the Working Mathematician","author":"S Mac Lane","year":"1978","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"},{"issue":"9","key":"1092_CR41","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\u2014Some 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":"1092_CR42","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":"1092_CR43","doi-asserted-by":"publisher","first-page":"407","DOI":"10.3233\/FI-2017-1475","volume":"150","author":"S Milius","year":"2017","unstructured":"Milius, S., Litak, T.: Guard your daggers and traces: properties of guarded (co-)recursion. Fundam. Inform. 150(3\u20134), 407\u2013449 (2017)","journal-title":"Fundam. Inform."},{"issue":"1","key":"1092_CR44","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0022-4049(94)00054-M","volume":"99","author":"D Pavlovi\u0107","year":"1995","unstructured":"Pavlovi\u0107, D.: Maps I: relative to a factorisation system. J. Pure Appl. Algebra 99(1), 9\u201334 (1995)","journal-title":"J. Pure Appl. Algebra"},{"issue":"3","key":"1092_CR45","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.exmath.2013.12.003","volume":"32","author":"K Ponto","year":"2014","unstructured":"Ponto, K., Shulman, M.: Traces in symmetric monoidal categories. Expos. Math. 32(3), 248\u2013273 (2014). https:\/\/doi.org\/10.1016\/j.exmath.2013.12.003","journal-title":"Expos. Math."},{"key":"1092_CR46","doi-asserted-by":"publisher","unstructured":"Rathke, J., Soboci\u0144ski, P., Stephens, O.: Compositional reachability in petri nets. In: Jo\u00ebl, O., Igor, P., James, W. (eds.), Reachability Problems\u20148th International Workshop, RP 2014, Oxford, UK, September 22\u201324, 2014. Proceedings, vol. 8762 of Lecture Notes in Computer Science. Springer, pp. 230\u2013243 (2014). https:\/\/doi.org\/10.1007\/978-3-319-11439-2_18","DOI":"10.1007\/978-3-319-11439-2_18"},{"key":"1092_CR47","unstructured":"Rom\u00e1n, M.: Span graph via the state construction (2022). https:\/\/github.com\/mroman42\/feedback-span-graph"},{"issue":"6","key":"1092_CR48","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. Categ. 15(6), 164\u2013177 (2005)","journal-title":"Theory Appl. Categ."},{"key":"1092_CR49","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":"1092_CR50","doi-asserted-by":"publisher","unstructured":"Selinger, P.: A survey of graphical languages for monoidal categories. In: New Structures for Physics. Springer, pp. 289\u2013355 (2010). https:\/\/doi.org\/10.1007\/978-3-642-12821-9_4","DOI":"10.1007\/978-3-642-12821-9_4"},{"key":"1092_CR51","volume-title":"The Theory and Design of Linear Differential Equation Machines","author":"ES Claude","year":"1942","unstructured":"Claude, E.S.: The Theory and Design of Linear Differential Equation Machines. Bell Telephone Laboratories (1942)"},{"key":"1092_CR52","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), vol.\u00a012 of EPTCS (2009). http:\/\/users.ecs.soton.ac.uk\/ps\/papers\/ice09.pdf, https:\/\/doi.org\/10.4204\/eptcs.12.6","DOI":"10.4204\/eptcs.12.6"},{"key":"1092_CR53","doi-asserted-by":"publisher","unstructured":"Soboci\u0144ski, P.: Representations of Petri net interactions. In: Concurrency Theory, 21th International Conference, (CONCUR 2010), vol. 6269 of Lecture Notes in Computer Science. Springer, pp. 554\u2013568 (2010). https:\/\/doi.org\/10.1007\/978-3-642-15375-4_38","DOI":"10.1007\/978-3-642-15375-4_38"}],"container-title":["Software and Systems Modeling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10270-023-01092-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10270-023-01092-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10270-023-01092-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,31]],"date-time":"2023-03-31T06:12:42Z","timestamp":1680243162000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10270-023-01092-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,21]]},"references-count":53,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1092"],"URL":"https:\/\/doi.org\/10.1007\/s10270-023-01092-7","relation":{},"ISSN":["1619-1366","1619-1374"],"issn-type":[{"value":"1619-1366","type":"print"},{"value":"1619-1374","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,21]]},"assertion":[{"value":"31 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}