Discovering Responsibilities with Dynamic Condition Response Graphs
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Declarative process discovery is the art of using historical data to better understand the responsibilities of an organisation: its governing business rules and goals. These rules and goals can be described using declarative process notations, such as Dynamic Condition Response (DCR) Graphs, which has seen widespread industrial adoption within Denmark, in particular through its integration in a case management solution used by 70% of central government institutions. In this paper, we introduce ParNek: a novel, effective, and extensible miner for the discovery of DCR Graphs. We empirically evaluate ParNek and show that it significantly outperforms the state-of-the-art in DCR discovery and performs at least comparably to the state-of-the-art in Declare discovery. Notably, the miner can be configured to sacrifice relatively little precision in favour of significant gains in simplicity, making it the first miner able to produce understandable DCR Graphs for real-life logs.
Originalsprog | Engelsk |
---|---|
Titel | Advanced Information Systems Engineering : 31st International Conference, CAiSE 2019, Rome, Italy, June 3–7, 2019, Proceedings |
Redaktører | Paolo Giorgini, Barbara Weber |
Antal sider | 15 |
Forlag | Springer |
Publikationsdato | 3 jun. 2019 |
Udgave | 31 |
Sider | 595-610 |
ISBN (Trykt) | 978-3-030-21289-6 |
ISBN (Elektronisk) | 978-3-030-21290-2 |
DOI | |
Status | Udgivet - 3 jun. 2019 |
Begivenhed | 31th International Conference on Advanced Information Systems Engineering (CAiSE 2019) - Rome, Italien Varighed: 3 jun. 2019 → 7 jun. 2019 |
Konference
Konference | 31th International Conference on Advanced Information Systems Engineering (CAiSE 2019) |
---|---|
Land | Italien |
By | Rome |
Periode | 03/06/2019 → 07/06/2019 |
Navn | Lecture Notes in Computer Science |
---|---|
Vol/bind | 11483 |
ISSN | 0302-9743 |
- Det Natur- og Biovidenskabelige Fakultet
Forskningsområder
ID: 222547291