{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T22:43:39Z","timestamp":1763765019693,"version":"3.40.3"},"publisher-location":"Cham","reference-count":134,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031626968"},{"type":"electronic","value":"9783031626975"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-62697-5_10","type":"book-chapter","created":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T21:01:23Z","timestamp":1718053283000},"page":"161-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Team Automata: Overview and\u00a0Roadmap"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2930-6367","authenticated-orcid":false,"given":"Maurice H.","family":"ter Beek","sequence":"first","affiliation":[]},{"given":"Rolf","family":"Hennicker","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0971-8919","authenticated-orcid":false,"given":"Jos\u00e9","family":"Proen\u00e7a","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Apel, S., Batory, D., K\u00e4stner, C., Saake, G.: Feature-Oriented Software Product Lines: Concepts and Implementation. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37521-7","DOI":"10.1007\/978-3-642-37521-7"},{"issue":"3","key":"10_CR2","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1017\/S0960129504004153","volume":"14","author":"F Arbab","year":"2004","unstructured":"Arbab, F.: Reo: a channel-based coordination model for component composition. Math. Struct. Comput. Sci. 14(3), 329\u2013366 (2004). https:\/\/doi.org\/10.1017\/S0960129504004153","journal-title":"Math. Struct. Comput. Sci."},{"key":"10_CR3","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-88479-8_9","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation","author":"F Arbab","year":"2008","unstructured":"Arbab, F., Kokash, N., Meng, S.: Towards using Reo for compliance-aware business process modeling. In: Margaria, T., Steffen, B. (eds.) ISoLA 2008. CCIS, vol. 17, pp. 108\u2013123. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88479-8_9"},{"key":"10_CR4","unstructured":"Arbab, F., Krause, C., Maraikar, Z., Moon, Y.J., Proen\u00e7a, J.: Modeling, testing and executing Reo connectors with the Eclipse coordination tools. Tool demo session of FACS 2008 (2008)"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Atif, M., Groote, J.F.: Understanding Behaviour of Distributed Systems Using mCRL2. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-23008-0","DOI":"10.1007\/978-3-031-23008-0"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Attie, P.C., Bensalem, S., Bozga, M., Jaber, M., Sifakis, J., Zaraket, F.A.: Global and local deadlock freedom in BIP. ACM Trans. Softw. Eng. Methodol. 26(3), 9:1\u20139:48 (2018). https:\/\/doi.org\/10.1145\/3152910","DOI":"10.1145\/3152910"},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/J.SCICO.2005.10.008","volume":"61","author":"C Baier","year":"2006","unstructured":"Baier, C., Sirjani, M., Arbab, F., Rutten, J.J.M.M.: Modeling component connectors in Reo by constraint automata. Sci. Comput. Program. 61(2), 75\u2013113 (2006). https:\/\/doi.org\/10.1016\/J.SCICO.2005.10.008","journal-title":"Sci. Comput. Program."},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Baranov, E., Bliudze, S.: Expressiveness of component-based frameworks: a study of the expressiveness of BIP. Acta Inform. 57, 761\u2013800 (2020). https:\/\/doi.org\/10.1007\/s00236-019-00337-7","DOI":"10.1007\/s00236-019-00337-7"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Barbanera, F., de\u2019Liguoro, U., Hennicker, R.: Connecting open systems of communicating finite state machines. J. Log. Algebr. Methods Program. 109 (2019). https:\/\/doi.org\/10.1016\/j.jlamp.2019.07.004","DOI":"10.1016\/j.jlamp.2019.07.004"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-030-50029-0_6","volume-title":"Coordination Models and Languages","author":"F Barbanera","year":"2020","unstructured":"Barbanera, F., Lanese, I., Tuosto, E.: Choreography automata. In: Bliudze, S., Bocchi, L. (eds.) COORDINATION 2020. LNCS, vol. 12134, pp. 86\u2013106. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-50029-0_6"},{"key":"10_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-031-08143-9_8","volume-title":"COORDINATION 2022","author":"F Barbanera","year":"2022","unstructured":"Barbanera, F., Lanese, I., Tuosto, E.: Formal choreographic languages. In: ter Beek, M.H., Sirjani, M. (eds.) COORDINATION 2022. LNCS, vol. 13271, pp. 121\u2013139. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-08143-9_8"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Barbanera, F., Lanese, I., Tuosto, E.: A theory of formal choreographic languages. Log. Meth. Comp. Sci. 19(3), 9:1\u20139:36 (2023). https:\/\/doi.org\/10.46298\/LMCS-19(3:9)2023","DOI":"10.46298\/LMCS-19(3:9)2023"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-319-25527-9_9","volume-title":"Programming Languages with Applications to Biology and Security","author":"M Bartoletti","year":"2015","unstructured":"Bartoletti, M., Cimoli, T., Zunino, R.: Compliance in behavioural contracts: a brief survey. In: Bodei, C., Ferrari, G.-L., Priami, C. (eds.) Programming Languages with Applications to Biology and Security. LNCS, vol. 9465, pp. 103\u2013121. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25527-9_9"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Basile, D., ter Beek, M.H.: Contract automata library. Sci. Comput. Program. 221 (2022). https:\/\/doi.org\/10.1016\/j.scico.2022.102841","DOI":"10.1016\/j.scico.2022.102841"},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Basile, D., et al.: Controller synthesis of service contracts with variability. Sci. Comput. Program. 187 (2020). https:\/\/doi.org\/10.1016\/j.scico.2019.102344","DOI":"10.1016\/j.scico.2019.102344"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Basile, D., ter Beek, M.H., Di Giandomenico, F., Gnesi, S.: Orchestration of dynamic service product lines with featured modal contract automata. In: Proceedings of the 21st International Systems and Software Product Line Conference (SPLC 2017), vol.\u00a02, pp. 117\u2013122. ACM (2017). https:\/\/doi.org\/10.1145\/3109729.3109741","DOI":"10.1145\/3109729.3109741"},{"issue":"16","key":"10_CR17","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s11334-019-00353-3","volume":"2","author":"D Basile","year":"2020","unstructured":"Basile, D., ter Beek, M.H., Legay, A.: Timed service contract automata. Innov. Syst. Softw. Eng. 2(16), 199\u2013214 (2020). https:\/\/doi.org\/10.1007\/s11334-019-00353-3","journal-title":"Innov. Syst. Softw. Eng."},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Basile, D., Degano, P., Ferrari, G.L.: Automata for specifying and orchestrating service contracts. Log. Meth. Comp. Sci. 12(4:6), 1\u201351 (2016). https:\/\/doi.org\/10.2168\/LMCS-12(4:6)2016","DOI":"10.2168\/LMCS-12(4:6)2016"},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"Basile, D., Di Giandomenico, F., Gnesi, S., Degano, P., Ferrari, G.L.: Specifying variability in service contracts. In: Proceedings of the 11th International Workshop on Variability Modelling of Software-intensive Systems (VaMoS 2017), pp. 20\u201327. ACM (2017). https:\/\/doi.org\/10.1145\/3023956.3023965","DOI":"10.1145\/3023956.3023965"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-030-78142-2_14","volume-title":"Coordination Models and Languages","author":"D Basile","year":"2021","unstructured":"Basile, D., ter Beek, M.H.: A clean and efficient implementation of choreography synthesis for behavioural contracts. In: Damiani, F., Dardha, O. (eds.) COORDINATION 2021. LNCS, vol. 12717, pp. 225\u2013238. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-78142-2_14"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Basile, D., ter Beek, M.H.: Advancing orchestration synthesis for contract automata. J. Log. Algebr. Methods Program. (2024)","DOI":"10.1016\/j.jlamp.2024.100998"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-030-22397-7_8","volume-title":"Coordination Models and Languages","author":"D Basile","year":"2019","unstructured":"Basile, D., ter Beek, M.H., Pugliese, R.: Bridging the gap between supervisory control and coordination of services: synthesis of orchestrations and choreographies. In: Riis Nielson, H., Tuosto, E. (eds.) COORDINATION 2019. LNCS, vol. 11533, pp. 129\u2013147. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-22397-7_8"},{"key":"10_CR23","doi-asserted-by":"publisher","unstructured":"Basile, D., ter Beek, M.H., Pugliese, R.: Synthesis of orchestrations and choreographies: bridging the gap between supervisory control and coordination of services. Log. Meth. Comp. Sci. 16(2), 9:1\u20139:29 (2020). https:\/\/doi.org\/10.23638\/LMCS-16(2:9)2020","DOI":"10.23638\/LMCS-16(2:9)2020"},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"Basile, D., Degano, P., Ferrari, G., Tuosto, E.: From orchestration to choreography through contract automata. In: Lanese, I., Lluch Lafuente, A., Sokolova, A., Torres Vieira, H. (eds.) Proceedings of the 7th Interaction and Concurrency Experience (ICE 2014). EPTCS, vol.\u00a0166, pp. 67\u201385 (2014). https:\/\/doi.org\/10.4204\/EPTCS.166.8","DOI":"10.4204\/EPTCS.166.8"},{"issue":"3","key":"10_CR25","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/J.JLAMP.2015.09.011","volume":"85","author":"D Basile","year":"2016","unstructured":"Basile, D., Degano, P., Ferrari, G., Tuosto, E.: Relating two automata-based models of orchestration and choreography. J. Log. Algebr. Methods Program. 85(3), 425\u2013446 (2016). https:\/\/doi.org\/10.1016\/J.JLAMP.2015.09.011","journal-title":"J. Log. Algebr. Methods Program."},{"key":"10_CR26","doi-asserted-by":"publisher","unstructured":"Basu, A., Bozga, M., Sifakis, J.: Modeling heterogeneous real-time components in BIP. In: Proceedings of the 4th IEEE International Conference on Software Engineering and Formal Methods (SEFM 2006), pp. 3\u201312. IEEE (2006). https:\/\/doi.org\/10.1109\/SEFM.2006.27","DOI":"10.1109\/SEFM.2006.27"},{"issue":"3","key":"10_CR27","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/MS.2011.27","volume":"28","author":"A Basu","year":"2011","unstructured":"Basu, A., et al.: Rigorous component-based system design using the BIP framework. IEEE Softw. 28(3), 41\u201348 (2011). https:\/\/doi.org\/10.1109\/MS.2011.27","journal-title":"IEEE Softw."},{"key":"10_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-642-12002-2_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"SS Bauer","year":"2010","unstructured":"Bauer, S.S., Mayer, P., Schroeder, A., Hennicker, R.: On weak modal compatibility, refinement, and the MIO workbench. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 175\u2013189. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12002-2_15"},{"key":"10_CR29","unstructured":"ter Beek, M., Lenzini, G., Petrocchi, M.: Team Automata for Security Analysis of Multicast\/Broadcast Communication. In: Proceedings of the ICATPN Workshop on Issues in Security and Petri Nets (WISP 2003). pp. 57\u201371. Eindhoven University of Technology (2003)"},{"key":"10_CR30","unstructured":"ter Beek, M.H.: Team automata\u2014a formal approach to the modeling of collaboration between system components. Ph.D. thesis, Leiden University (2003). https:\/\/hdl.handle.net\/1887\/29570"},{"key":"10_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-319-59746-1_14","volume-title":"Coordination Models and Languages","author":"MH ter Beek","year":"2017","unstructured":"ter Beek, M.H., Carmona, J., Hennicker, R., Kleijn, J.: Communication requirements for team automata. In: Jacquet, J.-M., Massink, M. (eds.) COORDINATION 2017. LNCS, vol. 10319, pp. 256\u2013277. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59746-1_14"},{"key":"10_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1007\/978-3-319-47166-2_55","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation: Foundational Techniques","author":"MH ter Beek","year":"2016","unstructured":"ter Beek, M.H., Carmona, J., Kleijn, J.: Conditions for compatibility of components. In: Margaria, T., Steffen, B. (eds.) ISoLA 2016. LNCS, vol. 9952, pp. 784\u2013805. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-47166-2_55"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"ter Beek, M.H., Cledou, G., Hennicker, R., Proen\u00e7a, J.: Featured team automata. Technical report, arXiv (2021). https:\/\/doi.org\/10.48550\/arXiv.2108.01784","DOI":"10.1007\/978-3-030-90870-6_26"},{"key":"10_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-030-90870-6_26","volume-title":"Formal Methods","author":"MH ter Beek","year":"2021","unstructured":"ter Beek, M.H., Cledou, G., Hennicker, R., Proen\u00e7a, J.: Featured team automata. In: Huisman, M., P\u0103s\u0103reanu, C., Zhan, N. (eds.) FM 2021. LNCS, vol. 13047, pp. 483\u2013502. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90870-6_26"},{"key":"10_CR35","doi-asserted-by":"publisher","unstructured":"ter Beek, M.H., Cledou, G., Hennicker, R., Proen\u00e7a, J.: Can we communicate? Using dynamic logic to verify team automata (extended version). Technical report, Zenodo (2022). https:\/\/doi.org\/10.5281\/zenodo.7418074","DOI":"10.5281\/zenodo.7418074"},{"key":"10_CR36","doi-asserted-by":"publisher","unstructured":"ter Beek, M.H., Cledou, G., Hennicker, R., Proen\u00e7a, J.: Can we communicate? Using dynamic logic to verify team automata. In: Chechik, M., Katoen, J.P., Leucker, M. (eds.) FM 2023. LNCS, vol. 14000, pp. 122\u2013141. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-27481-7_9","DOI":"10.1007\/978-3-031-27481-7_9"},{"issue":"2","key":"10_CR37","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1080\/00207160310001650099","volume":"81","author":"MH ter Beek","year":"2004","unstructured":"ter Beek, M.H., Csuhaj-Varj\u00fa, E., Mitrana, V.: Teams of pushdown automata. Int. J. Comput. Math. 81(2), 141\u2013156 (2004). https:\/\/doi.org\/10.1080\/00207160310001650099","journal-title":"Int. J. Comput. Math."},{"key":"10_CR38","unstructured":"ter Beek, M.H., Ellis, C.A., Kleijn, J., Rozenberg, G.: Synchronizations in team automata for groupware systems. Technical report, TR-99-12, Leiden Institute of Advanced Computer Science, Leiden University (1999)"},{"key":"10_CR39","unstructured":"ter Beek, M.H., Ellis, C.A., Kleijn, J., Rozenberg, G.: Team automata for CSCW. In: Proceedings of the 2nd International Colloquium on Petri Net Technologies for Modelling Communication Based Systems, pp. 1\u201320. Fraunhofer ISST (2001)"},{"key":"10_CR40","doi-asserted-by":"publisher","unstructured":"ter Beek, M.H., Ellis, C.A., Kleijn, J., Rozenberg, G.: Team automata for spatial access control. In: Prinz, W., Jarke, M., Rogers, Y., Schmidt, K., Wulf, V. (eds.) Proceedings of the 7th European Conference on Computer-Supported Cooperative Work (ECSCW 2001), pp. 59\u201377. Kluwer (2001). https:\/\/doi.org\/10.1007\/0-306-48019-0_4","DOI":"10.1007\/0-306-48019-0_4"},{"key":"10_CR41","doi-asserted-by":"publisher","unstructured":"ter Beek, M.H., Ellis, C.A., Kleijn, J., Rozenberg, G.: Synchronizations in team automata for groupware systems. Comput. Sup. Coop. Work 12(1), 21\u201369 (2003). https:\/\/doi.org\/10.1023\/A:1022407907596","DOI":"10.1023\/A:1022407907596"},{"key":"10_CR42","unstructured":"ter Beek, M.H., Gadducci, F., Janssens, D.: A calculus for team automata. In: Ribeiro, L., Moreira, A.M. (eds.) Proceedings of the 9th Brazilian Symposium on Formal Methods (SBMF 2006), pp. 59\u201372. Istituto de Informatica da UFRGS, Porto Alegre (2006)"},{"key":"10_CR43","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.entcs.2007.08.022","volume":"195","author":"MH ter Beek","year":"2008","unstructured":"ter Beek, M.H., Gadducci, F., Janssens, D.: A calculus for team automata. Electron. Notes Theor. Comput. Sci. 195, 41\u201355 (2008). https:\/\/doi.org\/10.1016\/j.entcs.2007.08.022","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-030-64276-1_11","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2020","author":"MH ter Beek","year":"2020","unstructured":"ter Beek, M.H., Hennicker, R., Kleijn, J.: Compositionality of safe communication in systems of team automata. In: Pun, V.K.I., Stolz, V., Simao, A. (eds.) ICTAC 2020. LNCS, vol. 12545, pp. 200\u2013220. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64276-1_11"},{"key":"10_CR45","doi-asserted-by":"publisher","unstructured":"ter Beek, M.H., Hennicker, R., Kleijn, J.: Compositionality of safe communication in systems of team automata. Technical report, Zenodo (2020). https:\/\/doi.org\/10.5281\/zenodo.4050293","DOI":"10.5281\/zenodo.4050293"},{"key":"10_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-030-50029-0_5","volume-title":"Coordination Models and Languages","author":"MH ter Beek","year":"2020","unstructured":"ter Beek, M.H., Hennicker, R., Kleijn, J.: Team Automata@Work: on safe communication. In: Bliudze, S., Bocchi, L. (eds.) COORDINATION 2020. LNCS, vol. 12134, pp. 77\u201385. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-50029-0_5"},{"key":"10_CR47","doi-asserted-by":"publisher","unstructured":"ter Beek, M.H., Hennicker, R., Proen\u00e7a, J.: Realisability of global models of interaction. In: \u00c1brah\u00e1m, E., Dubslaff, C., Tapia Tarifa, S.L. (eds.) ICTAC 2023. LNCS, vol. 14446, pp. 236\u2013255. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-47963-2_15","DOI":"10.1007\/978-3-031-47963-2_15"},{"key":"10_CR48","doi-asserted-by":"publisher","unstructured":"ter Beek, M.H., Hennicker, R., Proen\u00e7a, J.: Realisability of global models of interaction (extended version). Technical report, Zenodo (2023). https:\/\/doi.org\/10.5281\/zenodo.8377188","DOI":"10.5281\/zenodo.8377188"},{"key":"10_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-540-45236-2_22","volume-title":"FME 2003: Formal Methods","author":"MH ter Beek","year":"2003","unstructured":"ter Beek, M.H., Kleijn, J.: Team automata satisfying compositionality. In: Araki, K., Gnesi, S., Mandrioli, D. (eds.) FME 2003. LNCS, vol. 2805, pp. 381\u2013400. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45236-2_22"},{"issue":"5","key":"10_CR50","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/j.ipl.2005.05.012","volume":"95","author":"MH ter Beek","year":"2005","unstructured":"ter Beek, M.H., Kleijn, J.: Modularity for teams of I\/O automata. Inf. Process. Lett. 95(5), 487\u2013495 (2005). https:\/\/doi.org\/10.1016\/j.ipl.2005.05.012","journal-title":"Inf. Process. Lett."},{"issue":"3\u20134","key":"10_CR51","doi-asserted-by":"publisher","first-page":"437","DOI":"10.3233\/FI-2009-0051","volume":"91","author":"MH ter Beek","year":"2009","unstructured":"ter Beek, M.H., Kleijn, J.: Associativity of infinite synchronized shuffles and team automata. Fundam. Inform. 91(3\u20134), 437\u2013461 (2009). https:\/\/doi.org\/10.3233\/FI-2009-0051","journal-title":"Fundam. Inform."},{"key":"10_CR52","doi-asserted-by":"publisher","unstructured":"ter Beek, M.H., Kleijn, J.: Vector team automata. Theor. Comput. Sci. 429, 21\u201329 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2011.12.020","DOI":"10.1016\/j.tcs.2011.12.020"},{"key":"10_CR53","doi-asserted-by":"publisher","unstructured":"ter Beek, M.H., Kleijn, J.: On distributed cooperation and synchronised collaboration. J. Autom. Lang. Comb. 19(1-4), 17\u201332 (2014). https:\/\/doi.org\/10.25596\/jalc-2014-017","DOI":"10.25596\/jalc-2014-017"},{"key":"10_CR54","doi-asserted-by":"publisher","unstructured":"ter Beek, M.H., Lenzini, G., Petrocchi, M.: Team automata for security \u2013 a survey. Electron. Notes Theor. Comput. Sci. 128, 105\u2013119 (2005). https:\/\/doi.org\/10.1016\/j.entcs.2004.11.044","DOI":"10.1016\/j.entcs.2004.11.044"},{"key":"10_CR55","doi-asserted-by":"publisher","unstructured":"ter Beek, M.H., Lenzini, G., Petrocchi, M.: A team automaton scenario for the analysis of security properties in communication protocols. J. Autom. Lang. Comb. 11(4), 345\u2013374 (2006). https:\/\/doi.org\/10.25596\/jalc-2006-345","DOI":"10.25596\/jalc-2006-345"},{"key":"10_CR56","doi-asserted-by":"publisher","unstructured":"ter Beek, M.H., Cledou, G., Hennicker, R., Proen\u00e7a, J.: Can we Communicate? Using Dynamic Logic to Verify Team Automata (Software Artefact) (2022). https:\/\/doi.org\/10.5281\/zenodo.7338440. http:\/\/arcatools.org\/feta","DOI":"10.5281\/zenodo.7338440"},{"key":"10_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-30080-9_7","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"G Behrmann","year":"2004","unstructured":"Behrmann, G., David, A., Larsen, K.G.: A tutorial on Uppaal. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 200\u2013236. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30080-9_7"},{"key":"10_CR58","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2009.06.002","volume":"241","author":"A Bejleri","year":"2008","unstructured":"Bejleri, A., Yoshida, N.: Synchronous multiparty session types. Electr. Notes Theor. Comput. Sci. 241, 3\u201333 (2008). https:\/\/doi.org\/10.1016\/j.entcs.2009.06.002","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"5","key":"10_CR59","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1093\/logcom\/4.5.811","volume":"4","author":"J van Benthem","year":"1994","unstructured":"van Benthem, J., van Eijck, J., Stebletsova, V.: Modal logic, transition systems and processes. J. Log. Comput. 4(5), 811\u2013855 (1994). https:\/\/doi.org\/10.1093\/logcom\/4.5.811","journal-title":"J. Log. Comput."},{"key":"10_CR60","doi-asserted-by":"publisher","unstructured":"Best, E., Devillers, R.: Petri Net Primer: A Compendium on the Core Model, Analysis, and Synthesis. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-48278-6","DOI":"10.1007\/978-3-031-48278-6"},{"key":"10_CR61","doi-asserted-by":"publisher","unstructured":"Bliudze, S., van\u00a0den Bos, P., Huisman, M., Rubbens, R., Safina, L.: JavaBIP meets VerCors: towards the safety of concurrent software systems in Java. In: Lambers, L., Uchitel, S. (eds.) FASE 2023. LNCS, vol. 13991, pp. 143\u2013150. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30826-0_8","DOI":"10.1007\/978-3-031-30826-0_8"},{"key":"10_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-319-24953-7_25","volume-title":"Automated Technology for Verification and Analysis","author":"S Bliudze","year":"2015","unstructured":"Bliudze, S., et al.: Formal verification of infinite-state BIP models. In: Finkbeiner, B., Pu, G., Zhang, L. (eds.) ATVA 2015. LNCS, vol. 9364, pp. 326\u2013343. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24953-7_25"},{"issue":"11","key":"10_CR63","doi-asserted-by":"publisher","first-page":"1801","DOI":"10.1002\/spe.2495","volume":"47","author":"S Bliudze","year":"2017","unstructured":"Bliudze, S., Mavridou, A., Szymanek, R., Zolotukhina, A.: Exogenous coordination of concurrent software components with JavaBIP. Softw. Pract. Exper. 47(11), 1801\u20131836 (2017). https:\/\/doi.org\/10.1002\/spe.2495","journal-title":"Softw. Pract. Exper."},{"issue":"10","key":"10_CR64","doi-asserted-by":"publisher","first-page":"1315","DOI":"10.1109\/TC.2008.26","volume":"57","author":"S Bliudze","year":"2008","unstructured":"Bliudze, S., Sifakis, J.: The algebra of connectors: structuring interaction in BIP. IEEE Trans. Comput. 57(10), 1315\u20131330 (2008). https:\/\/doi.org\/10.1109\/TC.2008.26","journal-title":"IEEE Trans. Comput."},{"key":"10_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-540-31811-8_2","volume-title":"Technologies for E-Services","author":"L Bordeaux","year":"2005","unstructured":"Bordeaux, L., Sala\u00fcn, G., Berardi, D., Mecella, M.: When are two web services compatible? In: Shan, M.-C., Dayal, U., Hsu, M. (eds.) TES 2004. LNCS, vol. 3324, pp. 15\u201328. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31811-8_2"},{"issue":"2","key":"10_CR66","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D Brand","year":"1983","unstructured":"Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM 30(2), 323\u2013342 (1983). https:\/\/doi.org\/10.1145\/322374.322380","journal-title":"J. ACM"},{"key":"10_CR67","doi-asserted-by":"publisher","unstructured":"Brim, L., Cern\u00e1, I., Varekov\u00e1, P., Zimmerova, B.: Component-interaction automata as a verification-oriented component-based system specification. ACM Softw. Eng. Notes 31(2) (2006). https:\/\/doi.org\/10.1145\/1118537.1123063","DOI":"10.1145\/1118537.1123063"},{"key":"10_CR68","unstructured":"Carmona, J., Kleijn, J.: Interactive behaviour of multi-component systems. In: Proceedings of the ICATPN Workshop on Token-Based Computing (ToBaCo 2004), pp. 27\u201331. Universit\u00e0 di Bologna (2004)"},{"key":"10_CR69","doi-asserted-by":"publisher","unstructured":"Carmona, J., Kleijn, J.: Compatibility in a multi-component environment. Theor. Comput. Sci. 484, 1\u201315 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2013.03.006","DOI":"10.1016\/j.tcs.2013.03.006"},{"key":"10_CR70","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/3-540-36126-X_22","volume-title":"Formal Methods in Computer-Aided Design","author":"J Carmona","year":"2002","unstructured":"Carmona, J., Cortadella, J.: Input\/Output compatibility of reactive systems. In: Aagaard, M.D., O\u2019Leary, J.W. (eds.) FMCAD 2002. LNCS, vol. 2517, pp. 360\u2013377. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36126-X_22"},{"key":"10_CR71","doi-asserted-by":"publisher","unstructured":"Castagna, G., Gesbert, N., Padovani, L.: A theory of contracts for web services. ACM Trans. Program. Lang. Syst. 31(5), 19:1\u201319:61 (2009). https:\/\/doi.org\/10.1145\/1538917.1538920","DOI":"10.1145\/1538917.1538920"},{"key":"10_CR72","doi-asserted-by":"publisher","unstructured":"Castagna, G., Dezani-Ciancaglini, M., Padovani, L.: On global types and multi-party sessions. Log. Meth. Comp. Sci. 8(1), 24:1\u201324:45 (2012). https:\/\/doi.org\/10.2168\/LMCS-8(1:24)2012","DOI":"10.2168\/LMCS-8(1:24)2012"},{"key":"10_CR73","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-46691-6_17","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"I Castellani","year":"1999","unstructured":"Castellani, I., Mukund, M., Thiagarajan, P.S.: Synthesizing distributed transition systems from global specifications. In: Rangan, C.P., Raman, V., Ramanujam, R. (eds.) FSTTCS 1999. LNCS, vol. 1738, pp. 219\u2013231. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-46691-6_17"},{"key":"10_CR74","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-540-92188-2_10","volume-title":"Formal Methods for Components and Objects","author":"D Clarke","year":"2008","unstructured":"Clarke, D.: Coordination: Reo, nets, and logic. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2007. LNCS, vol. 5382, pp. 226\u2013256. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92188-2_10"},{"issue":"4\u20136","key":"10_CR75","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1051\/ita\/1998324-600991","volume":"32","author":"F Corradini","year":"1998","unstructured":"Corradini, F., Gorrieri, R., Marchignoli, D.: Towards parallelization of concurrent systems. RAIRO Theor. Informatics Appl. 32(4\u20136), 99\u2013125 (1998). https:\/\/doi.org\/10.1051\/ita\/1998324-600991","journal-title":"RAIRO Theor. Informatics Appl."},{"key":"10_CR76","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-030-04771-9_25","volume-title":"Software Technologies: Applications and Foundations","author":"R Cruz","year":"2018","unstructured":"Cruz, R., Proen\u00e7a, J.: ReoLive: analysing connectors in your browser. In: Mazzara, M., Ober, I., Sala\u00fcn, G. (eds.) STAF 2018. LNCS, vol. 11176, pp. 336\u2013350. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04771-9_25"},{"key":"10_CR77","doi-asserted-by":"publisher","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface automata. In: Proceedings of the 8th European Software Engineering Conference held jointly with 9th ACM SIGSOFT International Symposium on Foundations of Software Engineering (ESEC\/FSE 2001), pp. 109\u2013120. ACM (2001). https:\/\/doi.org\/10.1145\/503209.503226","DOI":"10.1145\/503209.503226"},{"key":"10_CR78","doi-asserted-by":"publisher","unstructured":"Dokter, K., Arbab, F.: Treo: textual syntax for Reo connectors. In: Bliudze, S., Bensalem, S. (eds.) Proceedings of the 1st International Workshop on Methods and Tools for Rigorous System Design (MeTRiD 2018). EPTCS, vol.\u00a0272, pp. 121\u2013135 (2018). https:\/\/doi.org\/10.4204\/EPTCS.272.10","DOI":"10.4204\/EPTCS.272.10"},{"issue":"7\u20138","key":"10_CR79","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1016\/j.scico.2011.03.009","volume":"77","author":"F Dur\u00e1n","year":"2012","unstructured":"Dur\u00e1n, F., Ouederni, M., Sala\u00fcn, G.: A generic framework for $$n$$-protocol compatibility checking. Sci. Comput. Program. 77(7\u20138), 870\u2013886 (2012). https:\/\/doi.org\/10.1016\/j.scico.2011.03.009","journal-title":"Sci. Comput. Program."},{"key":"10_CR80","doi-asserted-by":"publisher","unstructured":"Edixhoven, L., Jongmans, S.S., Proen\u00e7a, J., Castellani, I.: Branching pomsets: design, expressiveness and applications to choreographies. J. Log. Algebr. Methods Program. 136 (2024). https:\/\/doi.org\/10.1016\/j.jlamp.2023.100919","DOI":"10.1016\/j.jlamp.2023.100919"},{"key":"10_CR81","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.entcs.2004.12.046","volume":"142","author":"L Egidi","year":"2006","unstructured":"Egidi, L., Petrocchi, M.: Modelling a secure agent with team automata. Electron. Notes Theor. Comput. Sci. 142, 111\u2013127 (2006). https:\/\/doi.org\/10.1016\/j.entcs.2004.12.046","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"10_CR82","doi-asserted-by":"publisher","unstructured":"Ellis, C.A.: Team automata for groupware systems. In: Proceedings of the International ACM SIGGROUP Conference on Supporting Group Work: The Integration Challenge (GROUP 1997), pp. 415\u2013424. ACM (1997). https:\/\/doi.org\/10.1145\/266838.267363","DOI":"10.1145\/266838.267363"},{"key":"10_CR83","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-45711-9_15","volume-title":"Formal and Natural Computing","author":"G Engels","year":"2002","unstructured":"Engels, G., Groenewegen, L.: Towards team-automata-driven object-oriented collaborative work. In: Brauer, W., Ehrig, H., Karhum\u00e4ki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol. 2300, pp. 257\u2013276. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45711-9_15"},{"key":"10_CR84","doi-asserted-by":"publisher","unstructured":"G\u00f6ssler, G., Sifakis, J.: Composition for component-based modeling. Sci. Comput. Program. 55, 161\u2013183 (2005). https:\/\/doi.org\/10.1016\/j.scico.2004.05.014","DOI":"10.1016\/j.scico.2004.05.014"},{"key":"10_CR85","doi-asserted-by":"crossref","unstructured":"Groote, J.F., Mousavi, M.R.: Modeling and Analysis of Communicating Systems. MIT Press, Cambridge (2014)","DOI":"10.7551\/mitpress\/9946.001.0001"},{"key":"10_CR86","doi-asserted-by":"publisher","unstructured":"Groote, J.F., Moller, F.: Verification of parallel systems via decomposition. In: Cleaveland, R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630, pp. 62\u201376. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/BFb0084783","DOI":"10.1007\/BFb0084783"},{"key":"10_CR87","doi-asserted-by":"publisher","unstructured":"Guanciale, R., Tuosto, E.: Realisability of pomsets. J. Log. Algebr. Methods Program. 108, 69\u201389 (2019). https:\/\/doi.org\/10.1016\/J.JLAMP.2019.06.003","DOI":"10.1016\/J.JLAMP.2019.06.003"},{"key":"10_CR88","doi-asserted-by":"publisher","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. Foundations of Computing. MIT Press, Cambridge (2000). https:\/\/doi.org\/10.7551\/mitpress\/2516.001.0001","DOI":"10.7551\/mitpress\/2516.001.0001"},{"key":"10_CR89","doi-asserted-by":"publisher","unstructured":"Harel, D., Thiagarajan, P.S.: Message sequence charts. In: Lavagno, L., Martin, G., Selic, B. (eds.) UML for Real: Design of Embedded Real-Time Systems, pp. 77\u2013105. Kluwer (2003). https:\/\/doi.org\/10.1007\/0-306-48738-1_4","DOI":"10.1007\/0-306-48738-1_4"},{"key":"10_CR90","doi-asserted-by":"publisher","unstructured":"Hennicker, R., Bidoit, M.: Compatibility properties of synchronously and asynchronously communicating components. Log. Meth. Comp. Sci. 14(1), 1\u201331 (2018). https:\/\/doi.org\/10.23638\/LMCS-14(1:1)2018","DOI":"10.23638\/LMCS-14(1:1)2018"},{"key":"10_CR91","unstructured":"\u2019t\u00a0Hoen, P.J., ter Beek, M.H.: A conflict-free strategy for team-based model development. In: Proceedings of the International Workshop on Process support for Distributed Team-based Software Development (PDTSD 2000), pp. 720\u2013725. IIIS (2000)"},{"key":"10_CR92","doi-asserted-by":"publisher","unstructured":"Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. In: POPL 2008, pp. 273\u2013284. ACM (2008). https:\/\/doi.org\/10.1145\/1328438.1328472","DOI":"10.1145\/1328438.1328472"},{"key":"10_CR93","unstructured":"International Telecommunication Union (ITU): Message Sequence Chart\u00a0(MSC). Recommendation ITU-T Z.120 (2011). http:\/\/www.itu.int\/rec\/T-REC-Z.120"},{"key":"10_CR94","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1007\/978-3-642-12214-9_106","volume-title":"Information Processing and Management","author":"N Jaisankar","year":"2010","unstructured":"Jaisankar, N., Veeramalai, S., Kannan, A.: Team automata based framework for spatio-temporal RBAC model. In: Das, V.V., et al. (eds.) BAIP 2010. CCIS, vol. 70, pp. 586\u2013591. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12214-9_106"},{"key":"10_CR95","doi-asserted-by":"publisher","unstructured":"Ji, Z., Wang, S., Xu, X.: Session types with multiple senders single receiver. In: Hermanns, H., Sun, J., Bu, L. (eds.) SETTA 2023. LNCS, vol. 14464, pp. 112\u2013131. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-981-99-8664-4_7","DOI":"10.1007\/978-981-99-8664-4_7"},{"issue":"1","key":"10_CR96","doi-asserted-by":"publisher","first-page":"201","DOI":"10.7561\/SACS.2012.1.201","volume":"22","author":"SSTQ Jongmans","year":"2012","unstructured":"Jongmans, S.S.T.Q., Arbab, F.: Overview of thirty semantic formalisms for Reo. Sci. Ann. Comput. Sci. 22(1), 201\u2013251 (2012). https:\/\/doi.org\/10.7561\/SACS.2012.1.201","journal-title":"Sci. Ann. Comput. Sci."},{"key":"10_CR97","unstructured":"Jonsson, B.: Compositional verification of distributed systems. Ph.D. thesis, Uppsala University (1987)"},{"key":"10_CR98","unstructured":"Katoen, J.P., Lambert, L.: Pomsets for message sequence charts. In: Lahav, Y., Wolisz, A., Fischer, J., Holz, E. (eds.) Proceedings of the 1st Workshop of the SDL Forum Society on SDL and MSC (SAM 1998), pp. 197\u2013207. Humboldt-Universit\u00e4t zu Berlin (1998)"},{"key":"10_CR99","doi-asserted-by":"publisher","unstructured":"Kaynar, D.K., Lynch, N., Segala, R., Vaandrager, F.: The Theory of Timed I\/O Automata, 2 edn. Synthesis Lectures on Distributed Computing Theory. Springer, Cham (2010). https:\/\/doi.org\/10.1007\/978-3-031-02003-2","DOI":"10.1007\/978-3-031-02003-2"},{"key":"10_CR100","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-540-40022-6_15","volume-title":"Petri Net Technology for Communication-Based Systems","author":"J Kleijn","year":"2003","unstructured":"Kleijn, J.: Team automata for CSCW \u2013 a survey. In: Ehrig, H., Reisig, W., Rozenberg, G., Weber, H. (eds.) Petri Net Technology for Communication-Based Systems. LNCS, vol. 2472, pp. 295\u2013320. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-40022-6_15"},{"key":"10_CR101","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-24431-5_17","volume-title":"Formal Methods for Industrial Critical Systems","author":"J Klein","year":"2011","unstructured":"Klein, J., Kl\u00fcppelholz, S., Stam, A., Baier, C.: Hierarchical modeling and formal verification. an industrial case study using Reo and Vereofy. In: Sala\u00fcn, G., Sch\u00e4tz, B. (eds.) FMICS 2011. LNCS, vol. 6959, pp. 228\u2013243. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24431-5_17"},{"key":"10_CR102","doi-asserted-by":"publisher","unstructured":"Koehler, C., Clarke, D.: Decomposing port automata. In: Shin, S.Y., Ossowski, S. (eds.) Proceedings of the 24th ACM Symposium on Applied Computing (SAC 2009), pp. 1369\u20131373. ACM (2009). https:\/\/doi.org\/10.1145\/1529282.1529587","DOI":"10.1145\/1529282.1529587"},{"key":"10_CR103","doi-asserted-by":"publisher","unstructured":"Kokash, N., Krause, C., de\u00a0Vink, E.P.: Data-aware design and verification of service compositions with Reo and mCRL2. In: Proceedings of the 25th ACM Symposium on Applied Computing (SAC 2010), pp. 2406\u20132413. ACM (2010). https:\/\/doi.org\/10.1145\/1774088.1774590","DOI":"10.1145\/1774088.1774590"},{"key":"10_CR104","doi-asserted-by":"publisher","unstructured":"Konnov, I.V., Kotek, T., Wang, Q., Veith, H., Bliudze, S., Sifakis, J.: Parameterized systems in BIP: design and model checking. In: Desharnais, J., Jagadeesan, R. (eds.) CONCUR 2016. LIPIcs, vol.\u00a059, pp. 30:1\u201330:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPICS.CONCUR.2016.30","DOI":"10.4230\/LIPICS.CONCUR.2016.30"},{"key":"10_CR105","doi-asserted-by":"publisher","unstructured":"Lange, J., Tuosto, E., Yoshida, N.: From communicating machines to graphical choreographies. In: Proceedings of the 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2015), pp. 221\u2013232. ACM (2015). https:\/\/doi.org\/10.1145\/2676726.2676964","DOI":"10.1145\/2676726.2676964"},{"key":"10_CR106","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-540-71316-6_6","volume-title":"Programming Languages and Systems","author":"KG Larsen","year":"2007","unstructured":"Larsen, K.G., Nyman, U., W\u0105sowski, A.: Modal I\/O automata for interface and product line theories. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 64\u201379. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71316-6_6"},{"key":"10_CR107","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-319-95582-7_2","volume-title":"Formal Methods","author":"K Guldstrand Larsen","year":"2018","unstructured":"Guldstrand Larsen, K., Lorber, F., Nielsen, B.: 20\u00a0years of real real time model validation. In: Havelund, K., Peleska, J., Roscoe, B., de Vink, E. (eds.) FM 2018. LNCS, vol. 10951, pp. 22\u201336. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-95582-7_2"},{"key":"10_CR108","doi-asserted-by":"publisher","unstructured":"Lauenroth, K., Pohl, K., T\u00f6hning, S.: Model checking of domain artifacts in product line engineering. In: Proceedings of the 24th International Conference on Automated Software Engineering (ASE 2009), pp. 269\u2013280. IEEE (2009). https:\/\/doi.org\/10.1109\/ASE.2009.16","DOI":"10.1109\/ASE.2009.16"},{"key":"10_CR109","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.tcs.2015.10.013","volume":"612","author":"B Luttik","year":"2016","unstructured":"Luttik, B.: Unique parallel decomposition in branching and weak bisimulation semantics. Theor. Comput. Sci. 612, 29\u201344 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2015.10.013","journal-title":"Theor. Comput. Sci."},{"key":"10_CR110","unstructured":"Lynch, N.A., Tuttle, M.R.: An introduction to Input\/Output automata. CWI Q. 2(3), 219\u2013246 (1989). https:\/\/ir.cwi.nl\/pub\/18164"},{"key":"10_CR111","doi-asserted-by":"publisher","unstructured":"Mavridou, A., Baranov, E., Bliudze, S., Sifakis, J.: Architecture diagrams: a graphical language for architecture style specification. In: Proceedings of the 9th Interaction and Concurrency Experience (ICE 2016). EPTCS, vol.\u00a0223, pp. 83\u201397 (2016). https:\/\/doi.org\/10.4204\/EPTCS.223.6","DOI":"10.4204\/EPTCS.223.6"},{"issue":"2","key":"10_CR112","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/0304-3975(93)90176-T","volume":"107","author":"R Milner","year":"1993","unstructured":"Milner, R., Moller, F.: Unique decomposition of processes. Theor. Comput. Sci. 107(2), 357\u2013363 (1993). https:\/\/doi.org\/10.1016\/0304-3975(93)90176-T","journal-title":"Theor. Comput. Sci."},{"key":"10_CR113","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-642-24690-6_22","volume-title":"Software Engineering and Formal Methods","author":"R Muschevici","year":"2011","unstructured":"Muschevici, R., Proen\u00e7a, J., Clarke, D.: Modular modelling of software product lines with feature nets. In: Barthe, G., Pardo, A., Schneider, G. (eds.) SEFM 2011. LNCS, vol. 7041, pp. 318\u2013333. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24690-6_22"},{"issue":"4","key":"10_CR114","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1007\/s10270-015-0475-z","volume":"15","author":"R Muschevici","year":"2016","unstructured":"Muschevici, R., Proen\u00e7a, J., Clarke, D.: Feature nets: behavioural modelling of software product lines. Softw. Sys. Model. 15(4), 1181\u20131206 (2016). https:\/\/doi.org\/10.1007\/s10270-015-0475-z","journal-title":"Softw. Sys. Model."},{"key":"10_CR115","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains. Part I. Theor. Comput. Sci. 13, 85\u2013108 (1981). https:\/\/doi.org\/10.1016\/0304-3975(81)90112-2","journal-title":"Part I. Theor. Comput. Sci."},{"key":"10_CR116","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-540-40981-6_4","volume-title":"Formal Aspects of Security","author":"D Oheimb","year":"2003","unstructured":"Oheimb, D.: Interacting state machines: a stateful approach to proving security. In: Abdallah, A.E., Ryan, P., Schneider, S. (eds.) FASec 2002. LNCS, vol. 2629, pp. 15\u201332. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-40981-6_4"},{"key":"10_CR117","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-030-90636-8_5","volume-title":"Formal Aspects of Component Software","author":"S Orlando","year":"2021","unstructured":"Orlando, S., Pasquale, V.D., Barbanera, F., Lanese, I., Tuosto, E.: Corinne, a tool for choreography automata. In: Sala\u00fcn, G., Wijs, A. (eds.) FACS 2021. LNCS, vol. 13077, pp. 82\u201392. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90636-8_5"},{"key":"10_CR118","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-030-31517-7_13","volume-title":"Fundamentals of Software Engineering","author":"J Proen\u00e7a","year":"2019","unstructured":"Proen\u00e7a, J., Madeira, A.: Taming hierarchical connectors. In: Hojjat, H., Massink, M. (eds.) FSEN 2019. LNCS, vol. 11761, pp. 186\u2013193. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31517-7_13"},{"key":"10_CR119","doi-asserted-by":"publisher","unstructured":"Proen\u00e7a, J.: Overview on constrained multiparty synchronisation in team automata. In: C\u00e1mara, J., Jongmans, S.S. (eds.) FACS 2023. LNCS, vol. 14485, pp. 194\u2013205. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-52183-6_10","DOI":"10.1007\/978-3-031-52183-6_10"},{"key":"10_CR120","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.scico.2017.03.002","volume":"146","author":"J Proen\u00e7a","year":"2017","unstructured":"Proen\u00e7a, J., Clarke, D.: Typed connector families and their semantics. Sci. Comput. Program. 146, 28\u201349 (2017). https:\/\/doi.org\/10.1016\/j.scico.2017.03.002","journal-title":"Sci. Comput. Program."},{"key":"10_CR121","doi-asserted-by":"publisher","unstructured":"Proen\u00e7a, J., Clarke, D., de\u00a0Vink, E., Arbab, F.: Dreams: a framework for distributed synchronous coordination. In: Proceedings of the 27th ACM Symposium on Applied Computing (SAC 2012), pp. 1510\u20131515. ACM (2012). https:\/\/doi.org\/10.1145\/2245276.2232017","DOI":"10.1145\/2245276.2232017"},{"key":"10_CR122","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-030-50029-0_3","volume-title":"Coordination Models and Languages","author":"J Proen\u00e7a","year":"2020","unstructured":"Proen\u00e7a, J., Cledou, G.: ARx: reactive programming for synchronous connectors. In: Bliudze, S., Bocchi, L. (eds.) COORDINATION 2020. LNCS, vol. 12134, pp. 39\u201356. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-50029-0_3"},{"key":"10_CR123","unstructured":"Proen\u00e7a, J.: Synchronous coordination of distributed components. Ph.D. thesis, Leiden University (2011). https:\/\/hdl.handle.net\/1887\/17624"},{"issue":"1","key":"10_CR124","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1137\/0325013","volume":"25","author":"PJ Ramadge","year":"1987","unstructured":"Ramadge, P.J., Wonham, W.M.: Supervisory control of a class of discrete event processes. SIAM J. Control. Optim. 25(1), 206\u2013230 (1987). https:\/\/doi.org\/10.1137\/0325013","journal-title":"SIAM J. Control. Optim."},{"key":"10_CR125","doi-asserted-by":"publisher","unstructured":"Reisig, W.: Understanding Petri Nets: Modeling Techniques, Analysis Methods, Case Studies. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-33278-4","DOI":"10.1007\/978-3-642-33278-4"},{"key":"10_CR126","doi-asserted-by":"publisher","unstructured":"Scalas, A., Yoshida, N.: Less is more: multiparty session types revisited. Proc. ACM Program. Lang. 3, 30:1\u201330:29 (2019). https:\/\/doi.org\/10.1145\/3290343","DOI":"10.1145\/3290343"},{"issue":"1\u20133","key":"10_CR127","doi-asserted-by":"publisher","first-page":"267","DOI":"10.3233\/FI-2019-1863","volume":"170","author":"P Severi","year":"2019","unstructured":"Severi, P., Dezani-Ciancaglini, M.: Observational equivalence for multiparty sessions. Fundam. Inform. 170(1\u20133), 267\u2013305 (2019). https:\/\/doi.org\/10.3233\/FI-2019-1863","journal-title":"Fundam. Inform."},{"key":"10_CR128","doi-asserted-by":"publisher","unstructured":"Sharafi, M.: Extending team automata to evaluate software architectural design. In: Proceedings of the 32nd IEEE International Computer Software and Applications Conference (COMPSAC 2008), pp. 393\u2013400. IEEE (2008). https:\/\/doi.org\/10.1109\/COMPSAC.2008.57","DOI":"10.1109\/COMPSAC.2008.57"},{"key":"10_CR129","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-540-75698-9_30","volume-title":"International Symposium on Fundamentals of Software Engineering","author":"M Sharafi","year":"2007","unstructured":"Sharafi, M., Shams Aliee, F., Movaghar, A.: A review on specifying software architectures using extended automata-based models. In: Arbab, F., Sirjani, M. (eds.) FSEN 2007. LNCS, vol. 4767, pp. 423\u2013431. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75698-9_30"},{"key":"10_CR130","unstructured":"Smeyers, M.: A browser-based graphical editor for Reo networks. Master\u2019s thesis, Leiden University (2018). https:\/\/theses.liacs.nl\/1536"},{"key":"10_CR131","doi-asserted-by":"publisher","unstructured":"Teren, V., Cortadella, J., Villa, T.: Decomposition of transition systems into sets of synchronizing state machines. In: Proceedings of the 24th Euromicro Conference on Digital System Design (DSD 2021), pp. 77\u201381. IEEE (2021). https:\/\/doi.org\/10.1109\/DSD53832.2021.00021","DOI":"10.1109\/DSD53832.2021.00021"},{"key":"10_CR132","doi-asserted-by":"publisher","unstructured":"Teren, V., Cortadella, J., Villa, T.: Decomposition of transition systems into sets of synchronizing Free-choice Petri Nets. In: Proceedings of the 25th Euromicro Conference on Digital System Design (DSD 2022), pp. 165\u2013173. IEEE (2022). https:\/\/doi.org\/10.1109\/DSD57027.2022.00031","DOI":"10.1109\/DSD57027.2022.00031"},{"key":"10_CR133","doi-asserted-by":"publisher","unstructured":"Winskel, G.: An introduction to event structures. In: de\u00a0Bakker, J.W., de\u00a0Roever, W.P., Rozenberg, G. (eds.) REX 1988. LNCS, vol.\u00a0354, pp. 364\u2013397. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/BFB0013026","DOI":"10.1007\/BFB0013026"},{"key":"10_CR134","doi-asserted-by":"publisher","unstructured":"Yoshida, N.: Programming language implementations with multiparty session types. In: de\u00a0Boer, F.S., Damiani, F., H\u00e4hnle, R., Johnsen, E.B., Kamburjan, E. (eds.) Active Object Languages: Current Research Trends. LNCS, vol. 14360, pp. 147\u2013165. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-51060-1_6","DOI":"10.1007\/978-3-031-51060-1_6"}],"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-62697-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T14:49:59Z","timestamp":1732200599000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62697-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031626968","9783031626975"],"references-count":134,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62697-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"11 June 2024","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":"Groningen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"coordination2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}