Abstract
We investigate process mining for the declarative Dynamic Condition Response (DCR) graphs process modelling language. We contribute (a) a process mining algorithm for DCR graphs, (b) a proposal for a set of metrics quantifying output model quality, and (c) a preliminary example-based comparison with the Declare Maps Miner. The algorithm takes a contradiction-based approach, that is, we initially assume that all possible constraints hold, subsequently removing constraints as they are observed to be violated by traces in the input log.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Symposium on Applied Computing : SAC '17 |
| Number of pages | 6 |
| Place of Publication | New York, NY, USA |
| Publisher | Association for Computing Machinery |
| Publication date | 3 Apr 2017 |
| Pages | 759-764 |
| ISBN (Print) | 978-1-4503-4486-9 |
| DOIs | |
| Publication status | Published - 3 Apr 2017 |
| Externally published | Yes |
| Event | The 32nd ACM SIGAPP Symposium On Applied Computing - Duration: 4 Apr 2017 → … Conference number: 32 |
Conference
| Conference | The 32nd ACM SIGAPP Symposium On Applied Computing |
|---|---|
| Number | 32 |
| Period | 04/04/2017 → … |