{"id":78,"date":"2019-04-12T12:00:23","date_gmt":"2019-04-12T10:00:23","guid":{"rendered":"https:\/\/blog.rwth-aachen.de\/pads\/?p=78"},"modified":"2019-04-09T14:52:11","modified_gmt":"2019-04-09T12:52:11","slug":"finding-complex-process-structures-by-exploiting-the-token-game","status":"publish","type":"post","link":"https:\/\/blog.rwth-aachen.de\/pads\/2019\/04\/12\/finding-complex-process-structures-by-exploiting-the-token-game\/","title":{"rendered":"Finding Complex Process-Structures by Exploiting the Token-game"},"content":{"rendered":"\n<p><em>This post is by <a href=\"http:\/\/www.pads.rwth-aachen.de\/cms\/PADS\/Die-Organisationseinheit\/Team\/Wissenschaftliche-Mitarbeiter\/~rnmh\/Lisa-Mannel\/lidx\/1\/\">Lisa Mannel<\/a>, Scientific Assistant in the Process And Data Science group at RWTH Aachen University. Contact her via email for further inquiries.<\/em><\/p>\n\n\n\n<p>Our paper \u201eFinding Complex Process-Structures by Exploiting the Token-game\u201c has been accepted for publication by the <strong>40th International Conference on Applications and Theory of Petri Nets and Concurrency.<\/strong><\/p>\n\n\n\n<p><strong>In our paper we present a\nnovel approach to process discovery.<\/strong><strong> <\/strong>In process discovery, the goal is to\nfind, for a given event log, the model describing the underlying process. While\nprocess models can be represented in a variety of ways, in our paper we focus\non the representation by Petri nets. Using an approach inspired by\nlanguage-based regions, we start with a Petri net without any places, and then\ninsert the maximal set of places considered fitting with respect to the\nbehavior described by the log. Traversing and evaluating the whole set of all\npossible places is not feasible, since their number is exponential in the\nnumber of activities. Therefore, we propose a strategy to drastically prune\nthis search space to a small number of candidates, while still ensuring that\nall fitting places are found. This allows us to derive complex model structures\nthat other discovery algorithms fail to discover. In contrast to traditional\nregion-based approaches this new technique can handle infrequent behavior and\ntherefore also noisy real-life event data. The drastic decrease of computation\ntime achieved by our pruning strategy, as well as our noise handling\ncapability, is demonstrated and evaluated by performing various experiments.<br><\/p>\n\n\n\n<figure class=\"wp-block-image\"><img loading=\"lazy\" decoding=\"async\" width=\"1024\" height=\"545\" src=\"https:\/\/blog.rwth-aachen.de\/pads\/files\/2019\/04\/ExampleLogModels-1024x545.png\" alt=\"\" class=\"wp-image-81\" srcset=\"https:\/\/blog.rwth-aachen.de\/pads\/files\/2019\/04\/ExampleLogModels-1024x545.png 1024w, https:\/\/blog.rwth-aachen.de\/pads\/files\/2019\/04\/ExampleLogModels-300x160.png 300w, https:\/\/blog.rwth-aachen.de\/pads\/files\/2019\/04\/ExampleLogModels-768x409.png 768w\" sizes=\"auto, (max-width: 1024px) 100vw, 1024px\" \/><figcaption> <br><em>Figure 1: Consider the model shown in the upper left and assume L to be a complete log describing the behavior of this model. There exists a variety of discovery algorithms that are able to mine a process&nbsp; model based on L.&nbsp; As illustrated, the resulting Petri nets differ significantly between the algorithms. In particular, the places connecting A to D and B to E, which ensure that the first choice implies the second choice, are rarely discovered by existing algorithms.<\/em> <\/figcaption><\/figure>\n\n\n\n<p> <br>You can download the <a href=\"https:\/\/blog.rwth-aachen.de\/pads\/files\/2019\/04\/paper15.pdf\">full text here<\/a>.<\/p>\n\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>This post is by Lisa Mannel, Scientific Assistant in the Process And Data Science group at RWTH Aachen University. Contact her via email for further inquiries. Our paper \u201eFinding Complex [&hellip;]<\/p>\n","protected":false},"author":1679,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"c2c_always_allow_admin_comments":false,"footnotes":""},"categories":[1],"tags":[],"class_list":["post-78","post","type-post","status-publish","format-standard","hentry","category-allgemein"],"_links":{"self":[{"href":"https:\/\/blog.rwth-aachen.de\/pads\/wp-json\/wp\/v2\/posts\/78","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blog.rwth-aachen.de\/pads\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.rwth-aachen.de\/pads\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.rwth-aachen.de\/pads\/wp-json\/wp\/v2\/users\/1679"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.rwth-aachen.de\/pads\/wp-json\/wp\/v2\/comments?post=78"}],"version-history":[{"count":3,"href":"https:\/\/blog.rwth-aachen.de\/pads\/wp-json\/wp\/v2\/posts\/78\/revisions"}],"predecessor-version":[{"id":89,"href":"https:\/\/blog.rwth-aachen.de\/pads\/wp-json\/wp\/v2\/posts\/78\/revisions\/89"}],"wp:attachment":[{"href":"https:\/\/blog.rwth-aachen.de\/pads\/wp-json\/wp\/v2\/media?parent=78"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.rwth-aachen.de\/pads\/wp-json\/wp\/v2\/categories?post=78"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.rwth-aachen.de\/pads\/wp-json\/wp\/v2\/tags?post=78"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}