{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:54:27Z","timestamp":1743134067618,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031196843"},{"type":"electronic","value":"9783031196850"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-19685-0_9","type":"book-chapter","created":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T15:04:53Z","timestamp":1666019093000},"page":"115-135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Formal Algebraic Approach for\u00a0the\u00a0Quantitative Modeling of\u00a0Connectors in\u00a0Architectures"],"prefix":"10.1007","author":[{"given":"Christina Chrysovalanti","family":"Fountoukidou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Pittou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,18]]},"reference":[{"issue":"3","key":"9_CR1","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":"9_CR2","doi-asserted-by":"publisher","unstructured":"Bernardo, M., Ciancarini, P., Donatiello, L.: On the formalization of architectural types with process algebras. In: Knight, J.C., Rosenblum, D.S. (eds.) ACM SIGSOFT, pp. 140\u2013148. ACM (2000). https:\/\/doi.org\/10.1145\/355045.355064","DOI":"10.1145\/355045.355064"},{"issue":"10","key":"9_CR3","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. Computers 57(10), 1315\u20131330 (2008). https:\/\/doi.org\/10.1109\/TC.2008.26","journal-title":"IEEE Trans. Computers"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/978-3-540-85361-9_39","volume-title":"CONCUR 2008 - Concurrency Theory","author":"S Bliudze","year":"2008","unstructured":"Bliudze, S., Sifakis, J.: A notion of glue expressiveness for component-based systems. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 508\u2013522. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85361-9_39"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-22045-6_4","volume-title":"Software Composition","author":"S Bliudze","year":"2011","unstructured":"Bliudze, S., Sifakis, J.: Synthesizing glue operators from glue constraints for the construction of component-based systems. In: Apel, S., Jackson, E. (eds.) SC 2011. LNCS, vol. 6708, pp. 51\u201367. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22045-6_4"},{"issue":"1\u20132","key":"9_CR6","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.tcs.2006.07.005","volume":"366","author":"R Bruni","year":"2006","unstructured":"Bruni, R., Lanese, I., Montanari, U.: A basic algebra of stateless connectors. Theor. Comput. Sci. 366(1\u20132), 98\u2013120 (2006). https:\/\/doi.org\/10.1016\/j.tcs.2006.07.005","journal-title":"Theor. Comput. Sci."},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-35887-6_3","volume-title":"Formal Methods for Components and Objects","author":"R Bruni","year":"2013","unstructured":"Bruni, R., Melgratti, H., Montanari, U.: A survey on basic connectors and buffers. In: Beckert, B., Damiani, F., de Boer, F.S., Bonsangue, M.M. (eds.) FMCO 2011. LNCS, vol. 7542, pp. 49\u201368. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35887-6_3"},{"key":"9_CR8","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":"9_CR9","unstructured":"Fountoukidou, C.C., Pittou, M.: A formal algebraic approach for the quantitative modeling of connectors in architectures (2022). arXiv:2202.06594"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"H\u00e1jek, P. (ed.): Metamathematics of Fuzzy Logic. Kluwer Academic Publishers (1998). https:\/\/doi.org\/10.1007\/978-94-011-5300-3","DOI":"10.1007\/978-94-011-5300-3"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-030-31517-7_5","volume-title":"Fundamentals of Software Engineering","author":"MS Nawaz","year":"2019","unstructured":"Nawaz, M.S., Sun, M.: Using PVS for modeling and verification of probabilistic connectors. In: Hojjat, H., Massink, M. (eds.) FSEN 2019. LNCS, vol. 11761, pp. 61\u201376. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31517-7_5"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Paraponiari, P., Rahonis, G.: Weighted propositional configuration logics: A specification language for architectures with quantitative features. Inform. Comput. 282 (2022). https:\/\/doi.org\/10.1016\/j.ic.2020.104647","DOI":"10.1016\/j.ic.2020.104647"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-030-00856-7_13","volume-title":"Model and Data Engineering","author":"Q Rouland","year":"2018","unstructured":"Rouland, Q., Hamid, B., Jaskolka, J.: Formalizing reusable communication models for distributed systems architecture. In: Abdelwahed, E.H., Bellatreche, L., Golfarelli, M., M\u00e9ry, D., Ordonez, C. (eds.) MEDI 2018. LNCS, vol. 11163, pp. 198\u2013216. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00856-7_13"},{"issue":"4","key":"9_CR14","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1561\/1000000034","volume":"6","author":"J Sifakis","year":"2013","unstructured":"Sifakis, J.: Rigorous systems design. Found. Trends Signal Process. 6(4), 293\u2013362 (2013). https:\/\/doi.org\/10.1561\/1000000034","journal-title":"Found. Trends Signal Process."},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-030-00151-3_8","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"M Sun","year":"2018","unstructured":"Sun, M., Zhang, X.: A relational model for probabilistic connectors based on timed data distribution streams. In: Jansen, D.N., Prabhakar, P. (eds.) FORMATS 2018. LNCS, vol. 11022, pp. 125\u2013141. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00151-3_8"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-19685-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,17]],"date-time":"2022-10-17T15:07:53Z","timestamp":1666019273000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-19685-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031196843","9783031196850"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-19685-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"18 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algebraic Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cai2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cai2022.math.auth.gr\/","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":"17","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":"12","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":"71% - 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":"3.1","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":"2","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 volume consist of 2 abstracts, 3 full papers of invited speakers","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)"}}]}}