{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T00:05:29Z","timestamp":1774915529063,"version":"3.50.1"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031336195","type":"print"},{"value":"9783031336201","type":"electronic"}],"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-33620-1_22","type":"book-chapter","created":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T08:02:05Z","timestamp":1685174525000},"page":"417-439","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Transforming Dynamic Condition Response Graphs to\u00a0Safe Petri Nets"],"prefix":"10.1007","author":[{"given":"Vlad Paul","family":"Cosma","sequence":"first","affiliation":[]},{"given":"Thomas T.","family":"Hildebrandt","sequence":"additional","affiliation":[]},{"given":"Tijs","family":"Slaats","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,28]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"van der Aalst, W.M.P., Pesic, M.: DecSerFlow: towards a truly declarative service flow language. In: Bravetti, M., Nunez, M., Zavattaro, G. (eds.) Proceedings of Web Services and Formal Methods (WS-FM 2006), vol. 4184, pp. 1\u201323 (2006)","DOI":"10.1007\/11841197_1"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Agerwala, T.: A complete model for representing the coordination of asynchronous processes. Hopkins Computer Research Report 32 (1974)","DOI":"10.2172\/4242290"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Back, C.O., Slaats, T., Hildebrandt, T.T., Marquard, M.: Discover: accurate and efficient discovery of declarative process models. Int. J. Soft. Tools Technol. Transfer 24, 563\u2013587 (2022)","DOI":"10.1007\/s10009-021-00616-0"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/3-540-44618-4_32","volume-title":"CONCUR 2000 \u2014 Concurrency Theory","author":"P Baldan","year":"2000","unstructured":"Baldan, P., Busi, N., Corradini, A., Michele Pinna, G.: Functional concurrent semantics for Petri nets with read and inhibitor arcs. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 442\u2013457. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44618-4_32"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1007\/978-3-642-10373-5_36","volume-title":"Formal Methods and Software Engineering","author":"J Byg","year":"2009","unstructured":"Byg, J., J\u00f8rgensen, K.Y., Srba, J.: An efficient translation of timed-arc Petri nets to networks of timed automata. In: Breitman, K., Cavalcanti, A. (eds.) ICFEM 2009. LNCS, vol. 5885, pp. 698\u2013716. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10373-5_36"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-04761-9_7","volume-title":"Automated Technology for Verification and Analysis","author":"J Byg","year":"2009","unstructured":"Byg, J., J\u00f8rgensen, K.Y., Srba, J.: TAPAAL: editor, simulator and verifier of timed-arc Petri nets. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol. 5799, pp. 84\u201389. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04761-9_7"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"De Smedt, J., Vanden Broucke, S., De Weerdt, J., Vanthienen, J.: A full r\/i-net construct lexicon for declare constraints. Available at SSRN 2572869 (2015)","DOI":"10.2139\/ssrn.2572869"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Debois, S., Hildebrandt, T.T., Slaats, T.: Replication, refinement & reachability: complexity in dynamic condition-response graphs. Acta Informatica 55(6), 489\u2013520 (2018)","DOI":"10.1007\/s00236-017-0303-8"},{"key":"22_CR9","unstructured":"Dijkman, R.M., Dumas, M., Ouyang, C.: Formal semantics and analysis of BPMN process models using petri nets. Queensland University of Technology, Tech. Rep, pp. 1\u201330 (2007)"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-319-46295-0_29","volume-title":"Service-Oriented Computing","author":"R Eshuis","year":"2016","unstructured":"Eshuis, R., Debois, S., Slaats, T., Hildebrandt, T.: Deriving consistent GSM schemas from DCR graphs. In: Sheng, Q.Z., Stroulia, E., Tata, S., Bhiri, S. (eds.) ICSOC 2016. LNCS, vol. 9936, pp. 467\u2013482. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46295-0_29"},{"key":"22_CR11","doi-asserted-by":"publisher","unstructured":"Finkel, O.: On the high complexity of Petri nets $$\\omega $$-languages. In: Janicki, R., Sidorova, N., Chatain, T. (eds.) PETRI NETS 2020. LNCS, vol. 12152, pp. 69\u201388. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51831-8_4","DOI":"10.1007\/978-3-030-51831-8_4"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Hildebrandt, T.T., Mukkamala, R.R.: Declarative event-based workflow as distributed dynamic condition response graphs. In: PLACES, pp. 59\u201373 (2010)","DOI":"10.4204\/EPTCS.69.5"},{"key":"22_CR13","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-030-94343-1_28","volume-title":"Business Process Management Workshops","author":"TT Hildebrandt","year":"2022","unstructured":"Hildebrandt, T.T., Normann, H., Marquard, M., Debois, S., Slaats, T.: Decision modelling in\u00a0timed dynamic condition response graphs with\u00a0data. In: Marrella, A., Weber, B. (eds.) BPM 2021. LNBIP, vol. 436, pp. 362\u2013374. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-94343-1_28"},{"key":"22_CR14","doi-asserted-by":"publisher","unstructured":"Hildebrandt, T., Mukkamala, R.R., Slaats, T., Zanitti, F.: Contracts for cross-organizational workflows as timed dynamic condition response graphs. J. Logic Algebraic Programm. 82(5), 164\u2013185 (2013). ISSN 1567\u20138326. https:\/\/doi.org\/10.1016\/j.jlap.2013.05.005. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1567832613000283. Formal Languages and Analysis of Contract-Oriented Software (FLACOS2011)","DOI":"10.1016\/j.jlap.2013.05.005"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-642-13675-7_20","volume-title":"Applications and Theory of Petri Nets","author":"LM Hillah","year":"2010","unstructured":"Hillah, L.M., Kordon, F., Petrucci, L., Tr\u00e8ves, N.: PNML framework: an extendable reference implementation of the petri net markup language. In: Lilius, J., Penczek, W. (eds.) PETRI NETS 2010. LNCS, vol. 6128, pp. 318\u2013327. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13675-7_20"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-642-35179-2_3","volume-title":"Transactions on Petri Nets and Other Models of Concurrency VI","author":"L-M Hillah","year":"2012","unstructured":"Hillah, L.-M., Kordon, F., Lakos, C., Petrucci, L.: Extending pnml scope: a framework to combine Petri nets types. In: Jensen, K., van der Aalst, W.M., Ajmone Marsan, M., Franceschinis, G., Kleijn, J., Kristensen, L.M. (eds.) Transactions on Petri Nets and Other Models of Concurrency VI. LNCS, vol. 7400, pp. 46\u201370. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35179-2_3"},{"key":"22_CR17","doi-asserted-by":"publisher","unstructured":"H\u00f8gnason, T., Debois, S.: DCR event-reachability via genetic algorithms. In: Daniel, F., Sheng, Q.Z., Motahari, H. (eds.) BPM 2018. LNBIP, vol. 342, pp. 301\u2013312. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11641-5_24","DOI":"10.1007\/978-3-030-11641-5_24"},{"key":"22_CR18","unstructured":"Hu, Z., Shatz, S.M.: Mapping UML diagrams to a petri net notation for system simulation. In SEKE, pp. 213\u2013219. CiteSeer (2004)"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-19589-1_1","volume-title":"Web Services and Formal Methods","author":"R Hull","year":"2011","unstructured":"Hull, R., et al.: Introducing the guard-stage-milestone approach for specifying business entity lifecycles. In: Bravetti, M., Bultan, T. (eds.) WS-FM 2010. LNCS, vol. 6551, pp. 1\u201324. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19589-1_1"},{"key":"22_CR20","unstructured":"L\u00f3pez, H.A., Debois, S., Hildebrandt, T.T., Marquard, M.: The process highlighter: from texts to declarative processes and back. In: Proceedings of the Dissertation Award and Demonstration, Industrial Track at BPM 2018, vol. 2196 (2018). https:\/\/CEUR-WS.org\/VOL-2196\/"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-23059-2_13","volume-title":"Business Process Management","author":"FM Maggi","year":"2011","unstructured":"Maggi, F.M., Montali, M., Westergaard, M., van der Aalst, W.M.P.: Monitoring business constraints with linear temporal logic: an approach based on colored automata. In: Rinderle-Ma, S., Toumani, F., Wolf, K. (eds.) BPM 2011. LNCS, vol. 6896, pp. 132\u2013147. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23059-2_13"},{"key":"22_CR22","doi-asserted-by":"publisher","unstructured":"Montali, M.: Specification and Verification of Declarative Open Interaction Models. LNBIP, vol. 56. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14538-4","DOI":"10.1007\/978-3-642-14538-4"},{"key":"22_CR23","doi-asserted-by":"publisher","unstructured":"Montali, M., Pesic, M., van der Aalst, W.M.P., Chesani, F., Mello, P., Storari, S.: Declarative specification and verification of service choreographies. ACM Trans. Web, 4(1), 1658376 (2010). ISSN 1559\u20131131. https:\/\/doi.org\/10.1145\/1658373.1658376. https:\/\/doi.org\/10.1145\/1658373.1658376","DOI":"10.1145\/1658373.1658376"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Montanari, U., Rossi, F.: Contextual nets. Acta Informatica 32, 545\u2013596 (1995)","DOI":"10.1007\/BF01178907"},{"key":"22_CR25","unstructured":"Mukkamala, R.R.: A formal model for declarative workflows: dynamic condition response graphs, Ph. D. thesis, IT University of Copenhagen (2012)"},{"key":"22_CR26","doi-asserted-by":"publisher","unstructured":"Mukkamala, R.R., Hildebrandt, T.T.: From dynamic condition response structures to b\u00fcchi automata. In: 2010 4th IEEE International Symposium on Theoretical Aspects of Software Engineering, pp. 187\u2013190, 2010. https:\/\/doi.org\/10.1109\/TASE.2010.22","DOI":"10.1109\/TASE.2010.22"},{"key":"22_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-030-85469-0_12","volume-title":"Business Process Management","author":"H Normann","year":"2021","unstructured":"Normann, H., Debois, S., Slaats, T., Hildebrandt, T.T.: Zoom and enhance: action refinement via subprocesses in timed declarative processes. In: Polyvyanyy, A., Wynn, M.T., Van Looy, A., Reichert, M. (eds.) BPM 2021. LNCS, vol. 12875, pp. 161\u2013178. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85469-0_12"},{"key":"22_CR28","doi-asserted-by":"publisher","unstructured":"Pnueli, A.: The temporal logic of programs. In 18th Annual Symposium on Foundations of Computer Science (SFCS1977), pp. 46\u201357 (1977). https:\/\/doi.org\/10.1109\/SFCS.1977.32","DOI":"10.1109\/SFCS.1977.32"},{"key":"22_CR29","doi-asserted-by":"publisher","unstructured":"Popova, V., Dumas, M.: From petri nets to guard-stage-milestone models. In: La Rosa, M., Soffer, P. (eds.) BPM 2012. LNBIP, vol. 132, pp. 340\u2013351. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36285-9_38","DOI":"10.1007\/978-3-642-36285-9_38"},{"key":"22_CR30","first-page":"162","volume":"1293","author":"J Prescher","year":"2014","unstructured":"Prescher, J., Di Ciccio, C., Mendling, J.: From declarative processes to imperative models. SIMPDA 1293, 162\u2013173 (2014)","journal-title":"SIMPDA"},{"key":"22_CR31","unstructured":"Raedts, I., et al.: Transformation of BPMN models for behaviour analysis. MSVVEIS 2007, 126\u2013137 (2007)"},{"key":"22_CR32","unstructured":"Slaats, T.: Flexible process notations for cross-organizational case management systems, Ph. D. thesis, IT University of Copenhagen (2015)"},{"key":"22_CR33","doi-asserted-by":"publisher","unstructured":"Srba, J.: Timed-arc Petri nets vs. networks of timed automata. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 385\u2013402. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11494744_22","DOI":"10.1007\/11494744_22"},{"key":"22_CR34","doi-asserted-by":"publisher","unstructured":"Staines, T.S.: Intuitive mapping of UML 2 activity diagrams into fundamental modeling concept petri net diagrams and colored petri nets. In: 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (ECBS 2008), pp. 191\u2013200 (2008). https:\/\/doi.org\/10.1109\/ECBS.2008.12","DOI":"10.1109\/ECBS.2008.12"},{"key":"22_CR35","doi-asserted-by":"publisher","unstructured":"Thapa, D., Dangol, S., Wang, G.-N.: Transformation from petri nets model to programmable logic controller using one-to-one mapping technique. In: International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC\u201906), vol. 2, pp. 228\u2013233 (2005). https:\/\/doi.org\/10.1109\/CIMCA.2005.1631473","DOI":"10.1109\/CIMCA.2005.1631473"},{"key":"22_CR36","doi-asserted-by":"crossref","unstructured":"Valk, R.: Infinite behaviour of Petri nets. Theoret. Comput. Sci. 25(3), 311\u2013341 (1983)","DOI":"10.1016\/0304-3975(83)90115-9"},{"key":"22_CR37","doi-asserted-by":"crossref","unstructured":"Verbeek, H.M.W., Wynn, M.T., van der Aalst, W.M., ter Hofstede, A.H.M.: Reduction rules for reset\/inhibitor nets. J. Comput. Syst. Sci. 76(2), 125\u2013143 (2010)","DOI":"10.1016\/j.jcss.2009.06.003"},{"key":"22_CR38","doi-asserted-by":"publisher","unstructured":"Yang, N., Yu, H., Sun, H., Qian, Z.: Modeling UML sequence diagrams using extended Petri nets. In: 2010 International Conference on Information Science and Applications, pp. 1\u20138 (2010). https:\/\/doi.org\/10.1109\/ICISA.2010.5480384","DOI":"10.1109\/ICISA.2010.5480384"},{"key":"22_CR39","doi-asserted-by":"publisher","unstructured":"Zaitsev, D.A.: Toward the minimal universal petri net. IEEE Trans. Syst. Man Cybern. Syst. 44(1), 47\u201358 (2014). https:\/\/doi.org\/10.1109\/TSMC.2012.2237549","DOI":"10.1109\/TSMC.2012.2237549"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33620-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,17]],"date-time":"2023-06-17T23:09:56Z","timestamp":1687043396000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33620-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031336195","9783031336201"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33620-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PETRI NETS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applications and Theory of Petri Nets and Concurrency","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"25 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/petrinets2023.deec.fct.unl.pt\/","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":"21","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":"45% - 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":"4","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)"}}]}}