{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T13:14:07Z","timestamp":1725974047578},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319900889"},{"type":"electronic","value":"9783319900896"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-90089-6_6","type":"book-chapter","created":{"date-parts":[[2018,5,4]],"date-time":"2018-05-04T00:37:52Z","timestamp":1525394272000},"page":"70-85","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Soft Constraint Automata with Memory"],"prefix":"10.1007","author":[{"given":"Kasper","family":"Dokter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Gadducci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Santini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,7]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-540-40020-2_2","volume-title":"Recent Trends in Algebraic Development Techniques","author":"F Arbab","year":"2003","unstructured":"Arbab, F., Rutten, J.J.M.M.: A coinductive calculus of component connectors. In: Wirsing, M., Pattinson, D., Hennicker, R. (eds.) WADT 2002. LNCS, vol. 2755, pp. 34\u201355. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-40020-2_2"},{"issue":"3","key":"6_CR2","doi-asserted-by":"crossref","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)","journal-title":"Math. Struct. Comput. Sci."},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-24933-4_9","volume-title":"Formal Modeling: Actors, Open Systems, Biological Systems","author":"F Arbab","year":"2011","unstructured":"Arbab, F.: Puff, the magic protocol. In: Agha, G., Danvy, O., Meseguer, J. (eds.) Formal Modeling: Actors, Open Systems, Biological Systems. LNCS, vol. 7000, pp. 169\u2013206. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24933-4_9"},{"issue":"1","key":"6_CR4","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10270-006-0009-9","volume":"6","author":"F Arbab","year":"2007","unstructured":"Arbab, F., Baier, C., de Boer, F.S., Rutten, J.J.M.M.: Models and temporal logical specifications for timed component connectors. Softw. Syst. Model. 6(1), 59\u201382 (2007)","journal-title":"Softw. Syst. Model."},{"key":"6_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. 4467, pp. 286\u2013304. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72794-1_16"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-38230-7_8","volume-title":"Web Services and Formal Methods","author":"F Arbab","year":"2013","unstructured":"Arbab, F., Santini, F.: Preference and similarity-based behavioral discovery of services. In: ter Beek, M.H., Lohmann, N. (eds.) WS-FM 2012. LNCS, vol. 7843, pp. 118\u2013133. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38230-7_8"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-19805-2_10","volume-title":"Foundations of Software Science and Computational Structures","author":"A Aristiz\u00e1bal","year":"2011","unstructured":"Aristiz\u00e1bal, A., Bonchi, F., Palamidessi, C., Pino, L., Valencia, F.: Deriving labels and bisimilarity for concurrent constraint programming. In: Hofmann, M. (ed.) FoSSaCS 2011. LNCS, vol. 6604, pp. 138\u2013152. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19805-2_10"},{"issue":"2","key":"6_CR8","doi-asserted-by":"crossref","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)","journal-title":"Sci. Comput. Program."},{"issue":"10","key":"6_CR9","first-page":"1718","volume":"11","author":"C Baier","year":"2005","unstructured":"Baier, C.: Probabilistic models for Reo connector circuits. Univers. Comput. Sci. 11(10), 1718\u20131748 (2005)","journal-title":"Univers. Comput. Sci."},{"issue":"2","key":"6_CR10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/256303.256306","volume":"44","author":"S Bistarelli","year":"1997","unstructured":"Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint satisfaction and optimization. J. ACM 44(2), 201\u2013236 (1997)","journal-title":"J. ACM"},{"key":"6_CR11","unstructured":"Bistarelli, S., Gadducci, F.: Enhancing constraints manipulation in semiring-based formalisms. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) ECAI 2006. FAIA, vol. 141, pp. 63\u201367. IOS Press (2006)"},{"issue":"3","key":"6_CR12","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/1149114.1149118","volume":"7","author":"S Bistarelli","year":"2006","unstructured":"Bistarelli, S., Montanari, U., Rossi, F.: Soft concurrent constraint programming. ACM Trans. Comput. Logic 7(3), 563\u2013589 (2006)","journal-title":"ACM Trans. Comput. Logic"},{"key":"6_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01492-5","volume-title":"Handbook of Weighted Automata","year":"2009","unstructured":"Droste, M., Kuich, W., Vogler, H. (eds.): Handbook of Weighted Automata. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01492-5"},{"key":"6_CR14","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.ipl.2016.10.002","volume":"118","author":"F Gadducci","year":"2017","unstructured":"Gadducci, F., Santini, F.: Residuation for bipolar preferences in soft constraints. Inf. Process. Lett. 118, 69\u201374 (2017)","journal-title":"Inf. Process. Lett."},{"key":"6_CR15","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.jlamp.2017.06.001","volume":"92","author":"F Gadducci","year":"2017","unstructured":"Gadducci, F., Santini, F., Pino, L.F., Valencia, F.D.: Observational and behavioural equivalences for soft concurrent constraint programming. Log. Algebr. Methods Program. 92, 45\u201363 (2017)","journal-title":"Log. Algebr. Methods Program."},{"key":"6_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-017-0383-3","volume-title":"Semirings and Affine Equations over Them: Theory and Applications","author":"J Golan","year":"2003","unstructured":"Golan, J.: Semirings and Affine Equations over Them: Theory and Applications. Kluwer, Norwell (2003)"},{"issue":"1","key":"6_CR17","first-page":"201","volume":"22","author":"STQ Jongmans","year":"2012","unstructured":"Jongmans, S.T.Q., Arbab, F.: Overview of thirty semantic formalisms for Reo. Sci. Ann. Comput. Sci. 22(1), 201\u2013251 (2012)","journal-title":"Sci. Ann. Comput. Sci."},{"key":"6_CR18","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.scico.2017.03.006","volume":"146","author":"STQ Jongmans","year":"2017","unstructured":"Jongmans, S.T.Q., Kapp\u00e9, T., Arbab, F.: Constraint automata with memory cells and their composition. Sci. Comput. Program. 146, 50\u201386 (2017)","journal-title":"Sci. Comput. Program."},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Kapp\u00e9, T., Arbab, F., Talcott, C.L.: A compositional framework for preference-aware agents. In: Kargahi, M., Trivedi, A. (eds.) V2CPS@IFM 2016. EPTCS, vol. 232, pp. 21\u201335 (2016)","DOI":"10.4204\/EPTCS.232.6"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-319-68034-7_2","volume-title":"Formal Aspects of Component Software","author":"T Kapp\u00e9","year":"2017","unstructured":"Kapp\u00e9, T., Arbab, F., Talcott, C.: A component-oriented framework for autonomous agents. In: Proen\u00e7a, J., Lumpe, M. (eds.) FACS 2017. LNCS, vol. 10487, pp. 20\u201338. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68034-7_2"},{"issue":"1","key":"6_CR21","doi-asserted-by":"crossref","first-page":"103","DOI":"10.3233\/FI-2009-144","volume":"95","author":"S Meng","year":"2009","unstructured":"Meng, S., Arbab, F.: QoS-driven service selection and composition using quantitative constraint automata. Fundamenta Informaticae 95(1), 103\u2013128 (2009)","journal-title":"Fundamenta Informaticae"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Saraswat, V.A., Rinard, M.C., Panangaden, P.: Semantic foundations of concurrent constraint programming. In: Wise, D.S. (ed.) POPL 1991, pp. 333\u2013352. ACM Press (1991)","DOI":"10.1145\/99583.99627"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-642-40561-7_11","volume-title":"Software Engineering and Formal Methods","author":"M Sargolzaei","year":"2013","unstructured":"Sargolzaei, M., Santini, F., Arbab, F., Afsarmanesh, H.: A tool for behaviour-based discovery of approximately matching web services. In: Hierons, R.M., Merayo, M.G., Bravetti, M. (eds.) SEFM 2013. LNCS, vol. 8137, pp. 152\u2013166. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40561-7_11"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-34096-8_1","volume-title":"Formal Methods for the Quantitative Evaluation of Collective Adaptive Systems","author":"C Talcott","year":"2016","unstructured":"Talcott, C., Nigam, V., Arbab, F., Kapp\u00e9, T.: Formal specification and analysis of robust adaptive distributed cyber-physical systems. In: Bernardo, M., De Nicola, R., Hillston, J. (eds.) SFM 2016. LNCS, vol. 9700, pp. 1\u201335. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-34096-8_1"}],"container-title":["Lecture Notes in Computer Science","It's All About Coordination"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-90089-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T15:15:43Z","timestamp":1604243743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-90089-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319900889","9783319900896"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-90089-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}