{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,19]],"date-time":"2026-11-19T07:04:32Z","timestamp":1795071872965,"version":"4.10.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>The Business Process Modeling Notation (BPMN) is a widely used standard\nnotation for defining intra- and inter-organizational workflows. However, the\ninformal description of the BPMN execution semantics leads to different\ninterpretations of BPMN elements and difficulties in checking behavioral\nproperties. In this article, we propose a formalization of the execution\nsemantics of BPMN that, compared to existing approaches, covers more BPMN\nelements while also facilitating property checking. Our approach is based on a\nhigher-order transformation from BPMN models to graph transformation systems.\nTo show the capabilities of our approach, we implemented it as an open-source\nweb-based tool.<\/jats:p>","DOI":"10.46298\/lmcs-20(4:4)2024","type":"journal-article","created":{"date-parts":[[2024,10,7]],"date-time":"2024-10-07T19:35:06Z","timestamp":1728329706000},"source":"Crossref","is-referenced-by-count":7,"title":["A higher-order transformation approach to the formalization and analysis of BPMN using graph transformation systems"],"prefix":"10.46298","volume":"Volume 20, Issue 4","author":[{"given":"Tim","family":"Kr\u00e4uter","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adrian","family":"Rutle","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Harald","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yngve","family":"Lamo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"25203","published-online":{"date-parts":[[2024,10,7]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/14410\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/14410\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,7]],"date-time":"2024-10-07T19:35:07Z","timestamp":1728329707000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/12533"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,7]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-20(4:4)2024","relation":{"has-preprint":[{"id-type":"arxiv","id":"2311.05243v5","asserted-by":"subject"},{"id-type":"arxiv","id":"2311.05243v4","asserted-by":"subject"},{"id-type":"arxiv","id":"2311.05243v3","asserted-by":"subject"},{"id-type":"arxiv","id":"2311.05243v2","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2311.05243","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2311.05243","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,7]]},"article-number":"12533"}}