{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,17]],"date-time":"2026-10-17T16:23:58Z","timestamp":1792254238975,"version":"4.4.0"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030217587","type":"print"},{"value":"9783030217594","type":"electronic"}],"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-21759-4_8","type":"book-chapter","created":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T23:30:20Z","timestamp":1559518220000},"page":"129-147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Declarative Choreographies and Liveness"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7435-5563","authenticated-orcid":false,"given":"Thomas T.","family":"Hildebrandt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6244-6970","authenticated-orcid":false,"given":"Tijs","family":"Slaats","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5162-7936","authenticated-orcid":false,"given":"Hugo A.","family":"L\u00f3pez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4385-1409","authenticated-orcid":false,"given":"S\u00f8ren","family":"Debois","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9479-2632","authenticated-orcid":false,"given":"Marco","family":"Carbone","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,5,29]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11841197_1","volume-title":"Web Services and Formal Methods","author":"WMP van der Aalst","year":"2006","unstructured":"van der Aalst, W.M.P., Pesic, M.: DecSerFlow: towards a truly declarative service flow language. In: Bravetti, M., N\u00fa\u00f1ez, M., Zavattaro, G. (eds.) WS-FM 2006. LNCS, vol. 4184, pp. 1\u201323. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11841197_1"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Bartoletti, M., Scalas, A., Tuosto, E., Zunino, R.: Honesty by typing. Log. Methods Comput. Sci. 12(4) (2016)","DOI":"10.2168\/LMCS-12(4:7)2016"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-38592-6_5","volume-title":"Formal Techniques for Distributed Systems","author":"L Bocchi","year":"2013","unstructured":"Bocchi, L., Chen, T.-C., Demangeon, R., Honda, K., Yoshida, N.: Monitoring networks through multiparty session types. In: Beyer, D., Boreale, M. (eds.) FMOODS\/FORTE -2013. LNCS, vol. 7892, pp. 50\u201365. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38592-6_5"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.4204\/EPTCS.69.3","volume":"69","author":"Marco Carbone","year":"2011","unstructured":"Carbone, M., Grohmann, D., Hildebrandt, T.T., L\u00f3pez, H.A.: A logic for choreographies. In: PLACES. EPTCS, vol. 69, pp. 29\u201343 (2010)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-71316-6_2","volume-title":"Programming Languages and Systems","author":"M Carbone","year":"2007","unstructured":"Carbone, M., Honda, K., Yoshida, N.: Structured communication-centred programming for web services. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 2\u201317. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71316-6_2"},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"8:1","DOI":"10.1145\/2220365.2220367","volume":"34","author":"M Carbone","year":"2012","unstructured":"Carbone, M., Honda, K., Yoshida, N.: Structured communication-centered programming for web services. ACM Trans. Program. Lang. Syst. 34(2), 8:1\u20138:78 (2012)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Carbone, M., Montesi, F.: Deadlock-freedom-by-design: multiparty asynchronous global programming. In: Symposium on Principles of Programming Languages, POPL 2013 pp. 263\u2013274. ACM, New York (2013)","DOI":"10.1145\/2480359.2429101"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Cruz-Filipe, L., Montesi, F., Peressotti, M.: Communications in choreographies, revisited. In: ACM Symposium on Applied Computing, pp. 1248\u20131255. ACM (2018)","DOI":"10.1145\/3167132.3167267"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-319-19249-9_10","volume-title":"FM 2015: Formal Methods","author":"S Debois","year":"2015","unstructured":"Debois, S., Hildebrandt, T., Slaats, T.: Safety, liveness and run-time refinement for modular process-aware information systems with dynamic sub processes. In: Bj\u00f8rner, N., de Boer, F. (eds.) FM 2015. LNCS, vol. 9109, pp. 143\u2013160. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19249-9_10"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-319-23063-4_5","volume-title":"Business Process Management","author":"S Debois","year":"2015","unstructured":"Debois, S., Hildebrandt, T., Slaats, T.: Concurrency and asynchrony in declarative workflows. In: Motahari-Nezhad, H.R., Recker, J., Weidlich, M. (eds.) BPM 2015. LNCS, vol. 9253, pp. 72\u201389. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23063-4_5"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Debois, S., Hildebrandt, T.T., Slaats, T., Yoshida, N.: Type-checking liveness for collaborative processes with bounded and unbounded recursion. Log. Methods Comput. Sci. 12(1) (2016)","DOI":"10.2168\/LMCS-12(1:1)2016"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Debois, S., Hildebrandt, T.: The DCR workbench: declarative choreographies for collaborative processes. In: Gay, S., Ravara, A. (eds.) Behavioural Types: from Theory to Tools, pp. 99\u2013124. River Publishers, June 2017","DOI":"10.1201\/9781003337331-5"},{"issue":"6","key":"8_CR13","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s00236-017-0303-8","volume":"55","author":"S Debois","year":"2018","unstructured":"Debois, S., Hildebrandt, T.T., Slaats, T.: Replication, refinement & reachability: complexity in dynamic condition-response graphs. Acta Inform. 55(6), 489\u2013520 (2018)","journal-title":"Acta Inform."},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"59","DOI":"10.4204\/EPTCS.69.5","volume":"69","author":"Thomas T. Hildebrandt","year":"2011","unstructured":"Hildebrandt, T.T., Mukkamala, R.R.: Declarative event-based workflow as distributed dynamic condition response graphs. In: PLACES. EPTCS, vol. 69, pp. 59\u201373 (2010)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-32355-3_3","volume-title":"Foundations of Health Informatics Engineering and Systems","author":"T Hildebrandt","year":"2012","unstructured":"Hildebrandt, T., Mukkamala, R.R., Slaats, T.: Declarative modelling and safe distribution of healthcare workflows. In: Liu, Z., Wassyng, A. (eds.) FHIES 2011. LNCS, vol. 7151, pp. 39\u201356. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32355-3_3"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-642-29320-7_23","volume-title":"Fundamentals of Software Engineering","author":"T Hildebrandt","year":"2012","unstructured":"Hildebrandt, T., Mukkamala, R.R., Slaats, T.: Nested dynamic condition response graphs. In: Arbab, F., Sirjani, M. (eds.) FSEN 2011. LNCS, vol. 7141, pp. 343\u2013350. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29320-7_23"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-642-24690-6_17","volume-title":"Software Engineering and Formal Methods","author":"T Hildebrandt","year":"2011","unstructured":"Hildebrandt, T., Mukkamala, R.R., Slaats, T.: Safe distribution of declarative processes. In: Barthe, G., Pardo, A., Schneider, G. (eds.) SEFM 2011. LNCS, vol. 7041, pp. 237\u2013252. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24690-6_17"},{"issue":"5\u20137","key":"8_CR18","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.jlap.2013.05.005","volume":"82","author":"TT Hildebrandt","year":"2013","unstructured":"Hildebrandt, T.T., Mukkamala, R.R., Slaats, T., Zanitti, F.: Contracts for cross-organizational workflows as timed dynamic condition response graphs. J. Logic Algebraic Program. 82(5\u20137), 164\u2013185 (2013)","journal-title":"J. Logic Algebraic Program."},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-19056-8_4","volume-title":"Distributed Computing and Internet Technology","author":"K Honda","year":"2011","unstructured":"Honda, K., Mukhamedov, A., Brown, G., Chen, T.-C., Yoshida, N.: Scribbling interactions with a formal foundation. In: Natarajan, R., Ojo, A. (eds.) ICDCIT 2011. LNCS, vol. 6536, pp. 55\u201375. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19056-8_4"},{"issue":"1","key":"8_CR20","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)","journal-title":"J. ACM"},{"key":"8_CR21","unstructured":"ITU recommendation z.120 : Message Sequence Chart (MSC), August 2011. https:\/\/www.itu.int\/rec\/T-REC-Z.120-201102-I\/en"},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.scico.2017.10.006","volume":"155","author":"D Kouzapas","year":"2018","unstructured":"Kouzapas, D., Dardha, O., Perera, R., Gay, S.J.: Typechecking protocols with Mungo and StMungo: a session type toolchain for Java. Sci. Comput. Program. 155, 52\u201375 (2018)","journal-title":"Sci. Comput. Program."},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Lanese, I., Guidi, C., Montesi, F., Zavattaro, G.: Bridging the gap between interaction- and process-oriented choreographies. In: International Conference on Software Engineering and Formal Methods, SEFM, pp. 323\u2013332 (2008)","DOI":"10.1109\/SEFM.2008.11"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Lange, J., Ng, N., Toninho, B., Yoshida, N.: Fencing off go: liveness and safety for channel-based programming. In: POPL, pp. 748\u2013761. ACM (2017)","DOI":"10.1145\/3093333.3009847"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Lange, J., Tuosto, E., Yoshida, N.: From communicating machines to graphical choreographies. In: POPL, pp. 221\u2013232. ACM (2015)","DOI":"10.1145\/2775051.2676964"},{"issue":"10","key":"8_CR26","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1145\/2858965.2814302","volume":"50","author":"Hugo A. L\u00f3pez","year":"2015","unstructured":"L\u00f3pez, H.A., et al.: Protocol-based verification of message-passing parallel programs. In: OOPSLA, pp. 280\u2013298. ACM (2015)","journal-title":"ACM SIGPLAN Notices"},{"key":"8_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-319-39570-8_13","volume-title":"Formal Techniques for Distributed Objects, Components, and Systems","author":"HA L\u00f3pez","year":"2016","unstructured":"L\u00f3pez, H.A., Nielson, F., Nielson, H.R.: Enforcing availability in failure-aware communicating systems. In: Albert, E., Lanese, I. (eds.) FORTE 2016. LNCS, vol. 9688, pp. 195\u2013211. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39570-8_13"},{"key":"8_CR28","unstructured":"Mukkamala, R.R.: A formal model for declarative workflows: dynamic condition response graphs. Ph.D. thesis, IT University of Copenhagen, June 2012"},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Mukkamala, R.R., Hildebrandt, T., Slaats, T.: Towards trustworthy adaptive case management with dynamic condition response graphs. In: EDOC, pp. 127\u2013136. IEEE (2013)","DOI":"10.1109\/EDOC.2013.22"},{"key":"8_CR30","unstructured":"Object Management Group BPMN Technical Committee: Business Process Model and Notation, version 2.0.2 (2014). http:\/\/www.omg.org\/spec\/BPMN\/2.0.2\/PDF"},{"key":"8_CR31","unstructured":"Object Management Group UML Technical Committee: Unified Modeling Language, version 2.5.1 (2017). http:\/\/www.omg.org\/spec\/UML\/2.5.1\/"},{"key":"8_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-662-43376-8_10","volume-title":"Coordination Models and Languages","author":"L Padovani","year":"2014","unstructured":"Padovani, L., Vasconcelos, V.T., Vieira, H.T.: Typing liveness in multiparty communicating systems. In: K\u00fchn, E., Pugliese, R. (eds.) COORDINATION 2014. LNCS, vol. 8459, pp. 147\u2013162. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43376-8_10"},{"key":"8_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-642-40176-3_26","volume-title":"Business Process Management","author":"HA Reijers","year":"2013","unstructured":"Reijers, H.A., Slaats, T., Stahl, C.: Declarative modeling\u2013an academic dream or the future for BPM? In: Daniel, F., Wang, J., Weber, B. (eds.) BPM 2013. LNCS, vol. 8094, pp. 307\u2013322. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40176-3_26"},{"key":"8_CR34","unstructured":"Slaats, T.: Flexible process notations for cross-organizational case management systems. Ph.D. thesis, IT University of Copenhagen, January 2015"},{"key":"8_CR35","unstructured":"Str\u00f8msted, R., L\u00f3pez, H.A., Debois, S., Marquard, M.: Dynamic evaluation forms using declarative modeling. In: Proceedings of the Dissertation Award and Demonstration, Industrial Track at BPM 2018 (2018). CEUR-WS.org"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21759-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,17]],"date-time":"2023-09-17T03:58:17Z","timestamp":1694923097000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21759-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030217587","9783030217594"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21759-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"29 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORTE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Techniques for Distributed Objects, Components, and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","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":"39","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"forte2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.discotec.org\/2019\/forte","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":"42","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":"15","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":"3","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":"36% - 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":"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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}