{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:49:34Z","timestamp":1742989774079,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030784270"},{"type":"electronic","value":"9783030784287"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-78428-7_8","type":"book-chapter","created":{"date-parts":[[2021,6,13]],"date-time":"2021-06-13T23:03:11Z","timestamp":1623625391000},"page":"87-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Realisability of Control-State Choreographies"],"prefix":"10.1007","author":[{"given":"Klaus-Dieter","family":"Schewe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yamine","family":"A\u00eft-Ameur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarah","family":"Benyagoub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,14]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tcs.2016.09.023","volume":"656","author":"S Basu","year":"2016","unstructured":"Basu, S., Bultan, T.: On deciding synchronizability for asynchronously communicating systems. Theor. Comput. Sci. 656, 60\u201375 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.09.023","journal-title":"Theor. Comput. Sci."},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-030-48077-6_11","volume-title":"Rigorous State-Based Methods","author":"S Benyagoub","year":"2020","unstructured":"Benyagoub, S., A\u00eft-Ameur, Y., Schewe, K.-D.: Event-B-supported choreography-defined communicating systems. In: Raschke, A., M\u00e9ry, D., Houdek, F. (eds.) ABZ 2020. LNCS, vol. 12071, pp. 155\u2013168. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-48077-6_11"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-77935-5_1","volume-title":"NASA Formal Methods","author":"S Benyagoub","year":"2018","unstructured":"Benyagoub, S., Ouederni, M., A\u00eft-Ameur, Y., Mashkoor, A.: Incremental construction of realizable choreographies. In: Dutle, A., Mu\u00f1oz, C., Narkawicz, A. (eds.) NFM 2018. LNCS, vol. 10811, pp. 1\u201319. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77935-5_1"},{"issue":"5","key":"8_CR4","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s00236-015-0249-7","volume":"53","author":"E B\u00f6rger","year":"2015","unstructured":"B\u00f6rger, E., Schewe, K.-D.: Concurrent abstract state machines. Acta Informatica 53(5), 469\u2013492 (2015). https:\/\/doi.org\/10.1007\/s00236-015-0249-7","journal-title":"Acta Informatica"},{"key":"8_CR5","unstructured":"B\u00f6rger, E., Schewe, K.D.: Communication in abstract state machines. J. UCS 23(2), 129\u2013145 (2017). http:\/\/www.jucs.org\/jucs_23_2\/communication_in_abstract_state"},{"key":"8_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18216-7","volume-title":"Abstract State Machines. A Method for High-Level System Design and Analysis","author":"E B\u00f6rger","year":"2003","unstructured":"B\u00f6rger, E., St\u00e4rk, R.F.: Abstract State Machines. A Method for High-Level System Design and Analysis. Springer, Berlin (2003). https:\/\/doi.org\/10.1007\/978-3-642-18216-7"},{"issue":"2","key":"8_CR7","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":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-540-85361-9_28","volume-title":"CONCUR 2008 - Concurrency Theory","author":"P Chambart","year":"2008","unstructured":"Chambart, P., Schnoebelen, P.: Mixing lossy and perfect fifo channels. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 340\u2013355. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85361-9_28"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-662-44584-6_20","volume-title":"CONCUR 2014 \u2013 Concurrency Theory","author":"L Clemente","year":"2014","unstructured":"Clemente, L., Herbreteau, F., Sutre, G.: Decidable topologies for communicating automata with FIFO and bag channels. In: Baldan, P., Gorla, D. (eds.) CONCUR 2014. LNCS, vol. 8704, pp. 281\u2013296. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44584-6_20"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Finkel, A., Lozes, \u00c9.: Synchronizability of communicating finite state machines is not decidable. In: Chatzigiannakis, I., et al. (eds.) 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). LIPIcs, vol. 80, pp. 122:1\u2013122:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2017.122","DOI":"10.4230\/LIPIcs.ICALP.2017.122"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Schewe, K.D., Wang, Q.: Partial updates in complex-value databases. In: Heimb\u00fcrger, A., et al. (eds.) Information and Knowledge Bases XXII, Frontiers in Artificial Intelligence and Applications, vol. 225, pp. 37\u201356. IOS Press (2011). https:\/\/doi.org\/10.3233\/978-1-60750-690-4-37","DOI":"10.3233\/978-1-60750-690-4-37"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-030-39951-1_16","volume-title":"Foundations of Information and Knowledge Systems","author":"K-D Schewe","year":"2020","unstructured":"Schewe, K.-D., A\u00eft-Ameur, Y., Benyagoub, S.: Realisability of choreographies. In: Herzig, A., Kontinen, J. (eds.) FoIKS 2020. LNCS, vol. 12012, pp. 263\u2013280. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39951-1_16"},{"key":"8_CR13","unstructured":"Schewe, K.D., Ameur, Y.A., Benyagoub, S.: Realisability of control-state choreographies. CoRR abs\/2009.03623 (2020). https:\/\/arxiv.org\/abs\/2009.03623"}],"container-title":["Lecture Notes in Computer Science","Model and Data Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78428-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,13]],"date-time":"2021-06-13T23:18:29Z","timestamp":1623626309000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78428-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030784270","9783030784287"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78428-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"14 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MEDI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Model and Data Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tallinn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Estonia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"medi2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cs.ttu.ee\/events\/medi2021\/","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":"47","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":"16","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":"8","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":"34% - 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":"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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic the event was held virtually.","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)"}}]}}