{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:33:01Z","timestamp":1743107581037,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030223960"},{"type":"electronic","value":"9783030223977"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-22397-7_14","type":"book-chapter","created":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T18:14:14Z","timestamp":1559672054000},"page":"237-249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["DiRPOMS: Automatic Checker of Distributed Realizability of POMSets"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Guanciale","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,5]]},"reference":[{"issue":"7","key":"14_CR1","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1109\/TSE.2003.1214326","volume":"29","author":"R Alur","year":"2003","unstructured":"Alur, R., Etessami, K., Yannakakis, M.: Inference of message sequence charts. IEEE Trans. Softw. Eng. 29(7), 623\u2013633 (2003). https:\/\/doi.org\/10.1109\/TSE.2003.1214326","journal-title":"IEEE Trans. Softw. Eng."},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-642-54833-8_26","volume-title":"Programming Languages and Systems","author":"L Bocchi","year":"2014","unstructured":"Bocchi, L., Melgratti, H., Tuosto, E.: Resolving non-determinism in choreographies. In: Shao, Z. (ed.) ESOP 2014. LNCS, vol. 8410, pp. 493\u2013512. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54833-8_26"},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.entcs.2006.12.041","volume":"171","author":"M Carbone","year":"2007","unstructured":"Carbone, M., Honda, K., Yoshida, N.: A calculus of global interaction based on session types. Electron Notes Theor. Comput. Sci. 171(3), 127\u2013151 (2007). https:\/\/doi.org\/10.1016\/j.entcs.2006.12.041","journal-title":"Electron Notes Theor. Comput. Sci."},{"key":"14_CR4","unstructured":"Gaifman, H., Pratt, V.R.: Partial order models of concurrency and the computation of functions. In: LICS, pp. 72\u201385 (1987)"},{"key":"14_CR5","unstructured":"Guanciale, R., Tuosto, E.: Realisability of pomsets via communicating automata. CoRR abs\/1810.02469 (2018). http:\/\/arxiv.org\/abs\/1810.02469"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/3-540-45319-9_34","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"EL Gunter","year":"2001","unstructured":"Gunter, E.L., Muscholl, A., Peled, D.A.: Compositional message sequence charts. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 496\u2013511. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45319-9_34"},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/2827695","volume":"63","author":"K Honda","year":"2016","unstructured":"Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. J. ACM 63(1), 9:1\u20139:67 (2016). https:\/\/doi.org\/10.1145\/2827695. Extended version of a paper presented at POPL08","journal-title":"J. ACM"},{"issue":"1","key":"14_CR8","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1145\/2775051.2676964","volume":"50","author":"Julien Lange","year":"2015","unstructured":"Lange, J., Tuosto, E., Yoshida, N.: From communicating machines to graphical choreographies. In: POPL 2015, pp. 221\u2013232 (2015)","journal-title":"ACM SIGPLAN Notices"},{"issue":"3","key":"14_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v046.i03","volume":"46","author":"E Schulte","year":"2012","unstructured":"Schulte, E., Davison, D., Dye, T., Dominik, C., et al.: A multi-language computing environment for literate programming and reproducible research. J. Stat. Softw. 46(3), 1\u201324 (2012)","journal-title":"J. Stat. Softw."},{"key":"14_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19345-3","volume-title":"Process Mining: Discovery, Conformance and Enhancement of Business Processes","author":"W Van Der Aalst","year":"2011","unstructured":"Van Der Aalst, W.: Process Mining: Discovery, Conformance and Enhancement of Business Processes, vol. 2. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19345-3"},{"key":"14_CR11","unstructured":"WSCDL Version 1.0 (2005). https:\/\/www.w3.org\/TR\/ws-cdl-10\/"}],"container-title":["Lecture Notes in Computer Science","Coordination Models and Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22397-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T00:03:22Z","timestamp":1685837002000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-22397-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030223960","9783030223977"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22397-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"5 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COORDINATION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Coordination Languages and Models","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kongens Lyngby","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","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":"coordination2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.discotec.org\/2019\/coordination","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}