{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:31:57Z","timestamp":1725568317878},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642165603"},{"type":"electronic","value":"9783642165610"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16561-0_28","type":"book-chapter","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T09:50:50Z","timestamp":1288691450000},"page":"278-292","source":"Crossref","is-referenced-by-count":5,"title":["Towards a Connector Algebra"],"prefix":"10.1007","author":[{"given":"Marco","family":"Autili","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Chilton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paola","family":"Inverardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marta","family":"Kwiatkowska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimo","family":"Tivoli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"CONNECT consortium. CONNECT Deliverable D2.1: Capturing functional and non-functional connector behaviours. CONNECT EU project no. 231167, http:\/\/connect-forever.eu\/","key":"28_CR1"},{"issue":"3","key":"28_CR2","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1145\/258077.258078","volume":"6","author":"R. Allen","year":"1997","unstructured":"Allen, R., Garlan, D.: A Formal Basis for Architectural Connection. ACM Trans. Softw. Eng. Methodol.\u00a06(3), 213\u2013249 (1997)","journal-title":"ACM Trans. Softw. Eng. Methodol."},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BFb0055622","volume-title":"CONCUR \u201998 Concurrency Theory","author":"R. Alur","year":"1998","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O., Vardi, M.Y.: Alternating Refinement Relations. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 163\u2013178. Springer, Heidelberg (1998)"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-642-02053-7_14","volume-title":"Coordination Models and Languages","author":"F. Arbab","year":"2009","unstructured":"Arbab, F., Chothia, T., Mei, R., Meng, S., Moon, Y., Verhoef, C.: From coordination to stochastic models of QoS. In: Field, J., Vasconcelos, V.T. (eds.) COORDINATION 2009. LNCS, vol.\u00a05521, pp. 268\u2013287. Springer, Heidelberg (2009)"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-540-72794-1_16","volume-title":"Coordination Models and Languages","author":"F. Arbab","year":"2007","unstructured":"Arbab, F., Chothia, T., Meng, S., Moon, Y.-J.: Component connectors with QoS guarantees. In: Murphy, A.L., Vitek, J. (eds.) COORDINATION 2007. LNCS, vol.\u00a04467, pp. 286\u2013304. Springer, Heidelberg (2007)"},{"issue":"10","key":"28_CR6","first-page":"1718","volume":"11","author":"C. Baier","year":"2005","unstructured":"Baier, C.: Probabilistic models for reo connector circuits. Journal of Universal Computer Science\u00a011(10), 1718\u20131748 (2005)","journal-title":"Journal of Universal Computer Science"},{"issue":"2","key":"28_CR7","first-page":"75","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. SCP\u00a061(2), 75\u2013113 (2006)","journal-title":"SCP"},{"issue":"2","key":"28_CR8","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s00165-007-0045-4","volume":"20","author":"P. Bhaduri","year":"2008","unstructured":"Bhaduri, P., Ramesh, S.: Interface synthesis and protocol conversion. Form. Asp. Comput.\u00a020(2), 205\u2013224 (2008)","journal-title":"Form. Asp. Comput."},{"issue":"10","key":"28_CR9","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 Transactions on Computers\u00a057(10), 1315\u20131330 (2008)","journal-title":"IEEE Transactions on Computers"},{"doi-asserted-by":"crossref","unstructured":"David, A., Larsen, K.G., Legay, A., Nyman, U., Wasowski, A.: Timed I\/O Automata: A Complete Specification Theory for Real-time Systems. In: HSCC 2010, pp. 91\u2013100 (2010)","key":"28_CR10","DOI":"10.1145\/1755952.1755967"},{"key":"28_CR11","series-title":"NATO Science Series: Mathematics, Physics, and Chemistry","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. Alfaro de","year":"2005","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface-based Design. In: Engineering Theories of Software-intensive Systems. NATO Science Series: Mathematics, Physics, and Chemistry, vol.\u00a0195, pp. 83\u2013104. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Rewrite Systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Formal Models and Sematics, vol.\u00a0B, pp. 243\u2013320. Elsevier, MIT Press (1990)","key":"28_CR12","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"28_CR13","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"2007","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Prentice-Hall, Englewood Cliffs (2007)"},{"key":"28_CR14","series-title":"LNCS","first-page":"236","volume-title":"ISoLA 2010, Part II","author":"P. Inverardi","year":"2010","unstructured":"Inverardi, P., Issarny, V., Spalazzese, R.: A Theory of Mediators for Eternal Connectors. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010, Part II. LNCS, vol.\u00a06416, pp. 236\u2013250. Springer, Heidelberg (2010)"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/3-540-52148-8_19","volume-title":"Automatic Verification Methods for Finite State Systems","author":"K.G. Larsen","year":"1990","unstructured":"Larsen, K.G.: Modal specifications. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol.\u00a0407, pp. 232\u2013246. Springer, Heidelberg (1990)"},{"key":"28_CR16","first-page":"219","volume":"2","author":"N.A. Lynch","year":"1989","unstructured":"Lynch, N.A., Tuttle, M.R.: An Introduction to Input\/Output Automata. CWI Quarterly\u00a02, 219\u2013246 (1989)","journal-title":"CWI Quarterly"},{"key":"28_CR17","first-page":"87","volume-title":"EMSOFT 2009","author":"J.-B. Raclet","year":"2009","unstructured":"Raclet, J.-B., Badouel, E., Benveniste, A., Caillaud, B., Legay, A., Passerone, R.: Modal interfaces: unifying interface automata and modal specifications. In: EMSOFT 2009, pp. 87\u201396. ACM, New York (2009)"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-31794-4_9","volume-title":"Global Computing","author":"A. Schmitt","year":"2005","unstructured":"Schmitt, A., Stefani, J.-B.: The kell calculus: A family of higher-order distributed process calculi. In: Priami, C., Quaglia, P. (eds.) GC 2004. LNCS, vol.\u00a03267, pp. 146\u2013178. Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Spalazzese, R., Inverardi, P.: Mediating connector patterns for components interoperability. In: ECSA 2010, LNCS (to appear, 2010)","key":"28_CR19","DOI":"10.1007\/978-3-642-15114-9_26"},{"issue":"1-2","key":"28_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00056-X","volume":"176","author":"S.-H. Wu","year":"1997","unstructured":"Wu, S.-H., Smolka, S.A., Stark, E.W.: Composition and Behaviors of Probabilistic I\/O Automata. Theor. Comput. Sci.\u00a0176(1-2), 1\u201338 (1997)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Xu, D.N., G\u00f6ssler, G., Girault, A.: Probabilistic Contracts for Component-based Design. In: ATVA 2010 (to appear, 2010)","key":"28_CR21","DOI":"10.1007\/978-3-642-15643-4_24"}],"container-title":["Lecture Notes in Computer Science","Leveraging Applications of Formal Methods, Verification, and Validation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16561-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T21:08:07Z","timestamp":1559768887000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16561-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642165603","9783642165610"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16561-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}