{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,20]],"date-time":"2025-04-20T18:02:34Z","timestamp":1745172154319,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031471148"},{"type":"electronic","value":"9783031471155"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-47115-5_2","type":"book-chapter","created":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T15:04:38Z","timestamp":1698678278000},"page":"11-29","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Refinements for\u00a0Open Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2471-8012","authenticated-orcid":false,"given":"Rab\u00e9a","family":"Ameur-Boulifa","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4218-3987","authenticated-orcid":false,"given":"Quentin","family":"Corradi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7137-3523","authenticated-orcid":false,"given":"Ludovic","family":"Henrio","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5552-5993","authenticated-orcid":false,"given":"Eric","family":"Madelaine","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,31]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511624162","volume-title":"The B-book - Assigning Programs to Meanings","author":"JR Abrial","year":"1996","unstructured":"Abrial, J.R.: The B-book - Assigning Programs to Meanings. Cambridge University Press, Cambridge (1996)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-540-39910-0_12","volume-title":"Verification: Theory and Practice","author":"L Alfaro","year":"2003","unstructured":"Alfaro, L.: Game models for open systems. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol. 2772, pp. 269\u2013289. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39910-0_12"},{"key":"2_CR3","doi-asserted-by":"publisher","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface automata. In: Tjoa, A.M., Gruhn, V. (eds.) Proceedings of the 8th European Software Engineering Conference held jointly with 9th ACM SIGSOFT International Symposium on Foundations of Software Engineering 2001, Vienna, Austria, September 10\u201314, 2001, pp. 109\u2013120. ACM (2001). https:\/\/doi.org\/10.1145\/503209.503226","DOI":"10.1145\/503209.503226"},{"key":"2_CR4","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. 1466, pp. 163\u2013178. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055622"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Ameur-Boulifa, R., Henrio, L., Kulankhina, O., Madelaine, E., Savu, A.: Behavioural semantics for asynchronous components. J. Logical Algeb. Methods Program. 89, 1\u201340 (2017). https:\/\/doi.org\/10.1016\/j.jlamp.2017.02.003, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2352220817300287","DOI":"10.1016\/j.jlamp.2017.02.003"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Ameur-Boulifa, R., Henrio, L., Madelaine, E.: Compositional equivalences based on Open pNets. J. Logical Algeb. Methods Program. 131, 100842 (2023). https:\/\/doi.org\/10.1016\/j.jlamp.2022.100842, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2352220822000955","DOI":"10.1016\/j.jlamp.2022.100842"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Back, R., Sere, K.: Stepwise refinement of parallel algorithms. Sci. Comput. Program. 13(2), 133\u2013180 (1990). https:\/\/doi.org\/10.1016\/0167-6423(90)90069-P, https:\/\/www.sciencedirect.com\/science\/article\/pii\/016764239090069P","DOI":"10.1016\/0167-6423(90)90069-P"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/3-540-46428-X_19","volume-title":"Fundamental Approaches to Software Engineering","author":"F Bellegarde","year":"2000","unstructured":"Bellegarde, F., Julliand, J., Kouchnarenko, O.: Ready-simulation is not ready to express a modular refinement relation. In: Maibaum, T. (ed.) FASE 2000. LNCS, vol. 1783, pp. 266\u2013283. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-46428-X_19"},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10270-020-00838-x","volume":"20","author":"M Bravetti","year":"2021","unstructured":"Bravetti, M., Zavattaro, G.: Asynchronous session subtyping as communicating automata refinement. Softw. Syst. Model. 20(2), 311\u2013333 (2021). https:\/\/doi.org\/10.1007\/s10270-020-00838-x","journal-title":"Softw. Syst. Model."},{"key":"2_CR10","unstructured":"Butler, M.J., Grundy, J., L\u00e5ngbacka, T., Ruksenas, R., von Wright, J.: The refinement calculator: Proof support for program refinement. In: Groves, L., Reeves, S. (eds.) Proceedings of the Conference on Formal Methods Pacific 1997, Springer Series in Discrete Mathematics and Theoretical Computer Science, 01 January 1997, pp. 40\u201361 (1997). https:\/\/eprints.soton.ac.uk\/250550\/"},{"key":"2_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2020.110598","volume":"167","author":"J Dihego","year":"2020","unstructured":"Dihego, J., Sampaio, A., Oliveira, M.: A refinement checking based strategy for component-based systems evolution. J. Syst. Softw. 167, 110598 (2020). https:\/\/doi.org\/10.1016\/j.jss.2020.110598","journal-title":"J. Syst. Softw."},{"key":"2_CR12","volume-title":"A Discipline of Programming","author":"EW Dijkstra","year":"1976","unstructured":"Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall, Englewood Cliffs (1976)"},{"issue":"4","key":"2_CR13","first-page":"297","volume":"52","author":"R Eshuis","year":"2002","unstructured":"Eshuis, R., Fokkinga, M.M.: Comparing refinements for failure and bisimulation semantics. Fundam. Inf. 52(4), 297\u2013321 (2002)","journal-title":"Fundam. Inf."},{"issue":"2\u20133","key":"2_CR14","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00236-005-0177-z","volume":"42","author":"SJ Gay","year":"2005","unstructured":"Gay, S.J., Hole, M.: Subtyping for session types in the pi calculus. Acta Informatica 42(2\u20133), 191\u2013225 (2005). https:\/\/doi.org\/10.1007\/s00236-005-0177-z","journal-title":"Acta Informatica"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Hennessy, M., Lin, H.: Symbolic bisimulations. Theoretical Computer Science 138(2), 353\u2013389 (1995). https:\/\/doi.org\/10.1016\/0304-3975(94)00172-F, https:\/\/www.sciencedirect.com\/science\/article\/pii\/030439759400172F, meeting on the mathematical foundation of programing semantics","DOI":"10.1016\/0304-3975(94)00172-F"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Henrio, L., Madelaine, E., Ameur-Boulifa, R., Corradi, Q.: Refinements for Open Automata (Extended Version). Technical report RR-9517, Inria - Research Centre Grenoble - Rh\u00f4ne-Alpes (2023), https:\/\/inria.hal.science\/hal-04193421","DOI":"10.1007\/978-3-031-47115-5_2"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-319-39570-8_12","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"L Henrio","year":"2016","unstructured":"Henrio, L., Madelaine, E., Zhang, M.: A theory for the composition of concurrent processes. In: Albert, E., Lanese, I. (eds.) FORTE 2016. LNCS, vol. 9688, pp. 175\u2013194. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39570-8_12"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Hou, Z., Madelaine, E.: Symbolic bisimulation for open and parameterized systems. In: Proceedings of the 2020 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, New York, NY, USA, pp. 14\u201326. PEPM 2020, Association for Computing Machinery (2020). https:\/\/doi.org\/10.1145\/3372884.3373161","DOI":"10.1145\/3372884.3373161"},{"issue":"1","key":"2_CR19","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF01887207","volume":"1","author":"H Jifeng","year":"1989","unstructured":"Jifeng, H.: Process simulation and refinement. Form. Asp. Comput. 1(1), 229\u2013241 (1989). https:\/\/doi.org\/10.1007\/BF01887207","journal-title":"Form. Asp. Comput."},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-540-70881-0_26","volume-title":"Perspectives of Systems Informatics","author":"O Kouchnarenko","year":"2007","unstructured":"Kouchnarenko, O., Lanoix, A.: How to verify and exploit a refinement of component-based systems. In: Virbitskaite, I., Voronkov, A. (eds.) PSI 2006. LNCS, vol. 4378, pp. 297\u2013309. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70881-0_26"},{"key":"2_CR21","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall Inc, USA (1989)"},{"key":"2_CR22","doi-asserted-by":"publisher","unstructured":"Milner, R.: A Calculus of Communicating Systems, LNCS, vol. 92. Springer, Heidelberg (1980). https:\/\/doi.org\/10.1007\/3-540-10235-3","DOI":"10.1007\/3-540-10235-3"},{"key":"2_CR23","volume-title":"Introduction to Bisimulation and Coinduction","author":"D Sangiorgi","year":"2012","unstructured":"Sangiorgi, D.: Introduction to Bisimulation and Coinduction. Cambridge University Press, Cambridge (2012) https:\/\/hal.inria.fr\/hal-00907026"},{"key":"2_CR24","unstructured":"Wang, B., Madelaine, E., Zhang, M.: Symbolic Weak Equivalences: Extension, Algorithms, and Minimization - Extended version. Research Report RR-9389, Inria & Universit\u00e9 Cote d\u2019Azur, CNRS, I3S, Sophia Antipolis, France; East China Normal University (Shanghai) (2021). https:\/\/hal.inria.fr\/hal-03126313"},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2014\/703098","volume":"2014","author":"L Zhang","year":"2014","unstructured":"Zhang, L., Meng, Q., Lo, K.: Compositional abstraction refinement for component-based systems. J. Appl. Math. 2014, 1\u201312 (2014). https:\/\/doi.org\/10.1155\/2014\/703098","journal-title":"J. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Software Engineering and Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47115-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T00:02:36Z","timestamp":1699056156000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47115-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031471148","9783031471155"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47115-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"31 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Software Engineering and Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Eindhoven","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sefm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sefm-conference.github.io\/2023\/","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":"41","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":"19","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":"46% - 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","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":"4,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)"}}]}}