{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:36:33Z","timestamp":1743107793162,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030642754"},{"type":"electronic","value":"9783030642761"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64276-1_11","type":"book-chapter","created":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T07:04:38Z","timestamp":1606201478000},"page":"200-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Compositionality of Safe Communication in Systems of Team Automata"],"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-0001-9506-4071","authenticated-orcid":false,"given":"Jetty","family":"Kleijn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,25]]},"reference":[{"issue":"2","key":"11_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s00165-015-0349-8","volume":"28","author":"P Attie","year":"2015","unstructured":"Attie, P., Baranov, E., Bliudze, S., Jaber, M., Sifakis, J.: A general framework for architecture composability. Formal Aspects Comput. 28(2), 207\u2013231 (2015). https:\/\/doi.org\/10.1007\/s00165-015-0349-8","journal-title":"Formal Aspects Comput."},{"key":"11_CR2","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"},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s11334-019-00353-3","volume":"16","author":"D Basile","year":"2019","unstructured":"Basile, D., ter Beek, M.H., Legay, A.: Timed service contract automata. Innov. Syst. Softw. Eng. 16(2), 199\u2013214 (2019). https:\/\/doi.org\/10.1007\/s11334-019-00353-3","journal-title":"Innov. Syst. Softw. Eng."},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Basile, D., Degano, P., Ferrari, G.L.: Automata for specifying and orchestrating service contracts. Log. Methods Comput. 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":"11_CR5","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":"11_CR6","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":"11_CR7","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: the case of masters and slaves. 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"},{"issue":"1","key":"11_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/A:1022407907596","volume":"12","author":"MH ter Beek","year":"2003","unstructured":"ter Beek, M.H., Ellis, C.A., Kleijn, J., Rozenberg, G.: Synchronizations in team automata for groupware systems. Comput. Supp. Coop. Work 12(1), 21\u201369 (2003). https:\/\/doi.org\/10.1023\/A:1022407907596","journal-title":"Comput. Supp. Coop. Work"},{"key":"11_CR9","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, September 2020. https:\/\/doi.org\/10.5281\/zenodo.4050293","DOI":"10.5281\/zenodo.4050293"},{"key":"11_CR10","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"},{"issue":"3\u20134","key":"11_CR11","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":"11_CR12","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":"11_CR13","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":"11_CR14","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":"11_CR15","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":"11_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2013.03.006","volume":"484","author":"J Carmona","year":"2013","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","journal-title":"Theor. Comput. Sci."},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-39979-7_8","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2003","author":"C Carrez","year":"2003","unstructured":"Carrez, C., Fantechi, A., Najm, E.: Behavioural contracts for a sound assembly of components. In: K\u00f6nig, H., Heiner, M., Wolisz, A. (eds.) FORTE 2003. LNCS, vol. 2767, pp. 111\u2013126. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39979-7_8"},{"key":"11_CR18","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":"11_CR19","doi-asserted-by":"publisher","unstructured":"David, A., Larsen, K.G., Legay, A., Nyman, U., W\u0105sowski, A.: Timed I\/O automata: a complete specification theory for real-time systems. In: Proceedings of the 13th International Conference on Hybrid Systems: Computation and Control, HSCC 2010, pp. 91\u2013100. ACM (2010). https:\/\/doi.org\/10.1145\/1755952.1755967","DOI":"10.1145\/1755952.1755967"},{"key":"11_CR20","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":"11_CR21","series-title":"NATO Science Series","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/1-4020-3532-2_3","volume-title":"Engineering Theories of Software Intensive Systems","author":"L de Alfaro","year":"2005","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface-based design. In: Broy, M., Gr\u00fcnbauer, J., Harel, D., Hoare, T. (eds.) Engineering Theories of Software Intensive Systems. NSS, vol. 195, pp. 83\u2013104. Springer, Dordrecht (2005). https:\/\/doi.org\/10.1007\/1-4020-3532-2_3"},{"issue":"7\u20138","key":"11_CR22","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":"11_CR23","doi-asserted-by":"publisher","unstructured":"Ellis, C.A.: Team automata for groupware systems. In: Proceedings of the 1st 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":"11_CR24","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":"11_CR25","doi-asserted-by":"publisher","unstructured":"Hennicker, R., Bidoit, M.: Compatibility properties of synchronously and asynchronously communicating components. Log. Methods Comput. 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":"11_CR26","doi-asserted-by":"publisher","unstructured":"Hennicker, R., Knapp, A.: Moving from interface theories to assembly theories. Acta Inf. 52(2\u20133), 235\u2013268 (2015). https:\/\/doi.org\/10.1007\/s00236-015-0220-7","DOI":"10.1007\/s00236-015-0220-7"},{"key":"11_CR27","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":"11_CR28","doi-asserted-by":"publisher","unstructured":"L\u00fcttgen, G., Vogler, W., Fendrich, S.: Richer interface automata with optimistic and pessimistic compatibility. Acta Inf. 52(4-5), 305\u2013336 (2015). https:\/\/doi.org\/10.1007\/s00236-014-0211-0","DOI":"10.1007\/s00236-014-0211-0"},{"key":"11_CR29","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":"11_CR30","doi-asserted-by":"publisher","unstructured":"Mavridou, A., Baranov, E., Bliudze, S., Sifakis, J.: Architecture diagrams: a graphical language for architecture style specification. EPTCS 223, 83\u201397 (2016). https:\/\/doi.org\/10.4204\/eptcs.223.6","DOI":"10.4204\/eptcs.223.6"},{"issue":"1","key":"11_CR31","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0304-3975(84)90112-9","volume":"34","author":"G Winskel","year":"1984","unstructured":"Winskel, G.: Synchronization trees. Theor. Comput. Sci. 34(1), 33\u201382 (1984). https:\/\/doi.org\/10.1016\/0304-3975(84)90112-9","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64276-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T12:34:00Z","timestamp":1619267640000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-64276-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030642754","9783030642761"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64276-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"25 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macau","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2020","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":"ictac2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2020.github.io\/","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":"40","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":"15","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":"0","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":"38% - 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":"4","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":"5","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)"}},{"value":"The conference was planned to take place in Macau, China, and changed to a virtual format due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}