{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T16:10:44Z","timestamp":1772122244631,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031367083","type":"print"},{"value":"9783031367090","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-36709-0_11","type":"book-chapter","created":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T18:03:02Z","timestamp":1689271382000},"page":"204-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Formalization and\u00a0Analysis of\u00a0BPMN Using Graph Transformation Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1795-0611","authenticated-orcid":false,"given":"Tim","family":"Kr\u00e4uter","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4158-1644","authenticated-orcid":false,"given":"Adrian","family":"Rutle","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6304-6311","authenticated-orcid":false,"given":"Harald","family":"K\u00f6nig","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9196-1779","authenticated-orcid":false,"given":"Yngve","family":"Lamo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,12]]},"reference":[{"key":"11_CR1","unstructured":"Camunda services GmbH: BPMN 2.0 implementation reference. https:\/\/docs.camunda.org\/manual\/7.16\/reference\/bpmn20\/, March 2023"},{"key":"11_CR2","unstructured":"Camunda services GmbH: Bpmn-js token simulation. https:\/\/github.com\/bpmn-io\/bpmn-js-token-simulation, March 2023"},{"key":"11_CR3","unstructured":"Camunda services GmbH: Bpmnlint. https:\/\/github.com\/bpmn-io\/bpmnlint, March 2023"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"111007","DOI":"10.1016\/j.jss.2021.111007","volume":"180","author":"F Corradini","year":"2021","unstructured":"Corradini, F., Fornari, F., Polini, A., Re, B., Tiezzi, F., Vandin, A.: A formal approach for the analysis of BPMN collaboration models. J. Syst. Softw. 180, 111007 (2021). https:\/\/doi.org\/10.1016\/j.jss.2021.111007","journal-title":"J. Syst. Softw."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"101459","DOI":"10.1016\/j.is.2019.101459","volume":"103","author":"F Corradini","year":"2022","unstructured":"Corradini, F., Muzi, C., Re, B., Rossi, L., Tiezzi, F.: Formalising and animating multiple instances in BPMN collaborations. Inf. Syst. 103, 101459 (2022). https:\/\/doi.org\/10.1016\/j.is.2019.101459","journal-title":"Inf. Syst."},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.4204\/EPTCS.276.5","volume":"276","author":"F Corradini","year":"2018","unstructured":"Corradini, F., Muzi, C., Re, B., Tiezzi, F.: A classification of BPMN collaborations based on safeness and soundness notions. Electron. Proc. Theor. Comput. Sci. 276, 37\u201352 (2018). https:\/\/doi.org\/10.4204\/EPTCS.276.5","journal-title":"Electron. Proc. Theor. Comput. Sci."},{"issue":"12","key":"11_CR7","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1016\/j.infsof.2008.02.006","volume":"50","author":"RM Dijkman","year":"2008","unstructured":"Dijkman, R.M., Dumas, M., Ouyang, C.: Semantics and analysis of business process models in BPMN. Inf. Softw. Technol. 50(12), 1281\u20131294 (2008). https:\/\/doi.org\/10.1016\/j.infsof.2008.02.006","journal-title":"Inf. Softw. Technol."},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-319-59746-1_12","volume-title":"Coordination Models and Languages","author":"F Dur\u00e1n","year":"2017","unstructured":"Dur\u00e1n, F., Sala\u00fcn, G.: Verifying timed BPMN processes using Maude. In: Jacquet, J.-M., Massink, M. (eds.) COORDINATION 2017. Lecture Notes in Computer Science, vol. 10319, pp. 219\u2013236. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59746-1_12"},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Ehrig, H., Heckel, R., Korff, M., L\u00f6we, M., Ribeiro, L., Wagner, A., Corradini, A.: Algebraic approaches to graph transformation \u2013 part ii: single pushout approach and comparison with double pushout approach, pp. 247\u2013312. World Scientific, February 1997. https:\/\/doi.org\/10.1142\/9789812384720_0004","DOI":"10.1142\/9789812384720_0004"},{"key":"11_CR10","unstructured":"El-Saber, N.A.S.: CMMI-CM compliance checking of formal BPMN models using Maude. Ph.D. thesis, University of Leicester, January 2015"},{"key":"11_CR11","unstructured":"Freund, J., R\u00fccker, B.: Real-Life BPMN: using BPMN and DMN to analyze, Improve, and automate processes in your company. Berlin, 4th edn, Camunda (2019)"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Heckel, R., Taentzer, G.: Graph transformation for software engineers: with applications to model-based development and domain-specific language engineering. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43916-3","DOI":"10.1007\/978-3-030-43916-3"},{"key":"11_CR13","unstructured":"Hofstede, A., Aalst, W.: Workflow patterns: on the expressive power of (petri-net-based) workflow languages. In: Proceedings of Fourth Workshop on the Practical Use of Coloured Petri Nets and CPN Tools (CPN 2002), vol. 560, August 2002"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"101765","DOI":"10.1016\/j.is.2021.101765","volume":"104","author":"S Houhou","year":"2022","unstructured":"Houhou, S., Baarir, S., Poizat, P., Qu\u00e9innec, P., Kahloul, L.: A first-order logic verification framework for communication-parametric and time-aware BPMN collaborations. Inf. Syst. 104, 101765 (2022). https:\/\/doi.org\/10.1016\/j.is.2021.101765","journal-title":"Inf. Syst."},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/11691617_19","volume-title":"Model Checking Software","author":"H Kastenberg","year":"2006","unstructured":"Kastenberg, H., Rensink, A.: Model checking dynamic states in GROOVE. In: Valmari, A. (ed.) SPIN 2006. LNCS, vol. 3925, pp. 299\u2013305. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11691617_19"},{"key":"11_CR16","unstructured":"Kr\u00e4uter, T.: Artifacts - ICGT. https:\/\/github.com\/timKraeuter\/ICGT-2023, October 2023"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-11245-9_1","volume-title":"Software Language Engineering","author":"B Meyers","year":"2014","unstructured":"Meyers, B., Deshayes, R., Lucio, L., Syriani, E., Vangheluwe, H., Wimmer, M.: ProMoBox: a framework for generating domain-specific property languages. In: Combemale, B., Pearce, D.J., Barais, O., Vinju, J.J. (eds.) SLE 2014. LNCS, vol. 8706, pp. 1\u201320. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11245-9_1"},{"key":"11_CR18","unstructured":"Object management group: business process model and notation (BPMN), Version 2.0.2. https:\/\/www.omg.org\/spec\/BPMN\/, December 2013"},{"key":"11_CR19","unstructured":"Peter, D.: Hyperfine (2022)"},{"key":"11_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-540-25959-6_40","volume-title":"Applications of Graph Transformations with Industrial Relevance","author":"A Rensink","year":"2004","unstructured":"Rensink, A.: The GROOVE simulator: a\u00a0tool for state space generation. In: Pfaltz, J.L., Nagl, M., B\u00f6hlen, B. (eds.) AGTIVE 2003. LNCS, vol. 3062, pp. 479\u2013485. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25959-6_40"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11841883_1","volume-title":"Graph Transformations","author":"A Rensink","year":"2006","unstructured":"Rensink, A.: Nested quantification in graph transformation rules. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 1\u201313. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11841883_1"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-319-68270-9_10","volume-title":"ModelEd, TestEd, TrustEd","author":"A Rensink","year":"2017","unstructured":"Rensink, A.: How much are your geraniums? Taking graph conditions beyond first order. In: Katoen, J.-P., Langerak, R., Rensink, A. (eds.) ModelEd, TestEd, TrustEd. LNCS, vol. 10500, pp. 191\u2013213. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68270-9_10"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-02674-4_3","volume-title":"Model Driven Architecture - Foundations and Applications","author":"M Tisi","year":"2009","unstructured":"Tisi, M., Jouault, F., Fraternali, P., Ceri, S., B\u00e9zivin, J.: On the use of higher-order model transformations. In: Paige, R.F., Hartman, A., Rensink, A. (eds.) ECMDA-FA 2009. LNCS, vol. 5562, pp. 18\u201333. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02674-4_3"},{"key":"11_CR24","doi-asserted-by":"publisher","unstructured":"Van Gorp, P., Dijkman, R.: A visual token-based formalization of BPMN 2.0 based on in-place transformations. Inf. Softw. Technol. 55(2), 365\u2013394 (2013). https:\/\/doi.org\/10.1016\/j.infsof.2012.08.014","DOI":"10.1016\/j.infsof.2012.08.014"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36709-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T18:04:03Z","timestamp":1689271443000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36709-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031367083","9783031367090"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36709-0_11","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":"12 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Graph Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Leicester","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"19 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/icgt-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":"29","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":"14","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":"2","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":"48% - 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":"3.78","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)"}}]}}