Declarative Process Mining for DCR Graphs

Søren Debois, Thomas T. Hildebrandt, Paw Høvsgaard Laursen, Kenneth Ry Ulrik

Research output: Conference Article in Proceeding or Book/Report chapterArticle in proceedingsResearchpeer-review

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 languageEnglish
Title of host publicationProceedings of the Symposium on Applied Computing : SAC '17
Number of pages6
Place of PublicationNew York, NY, USA
PublisherAssociation for Computing Machinery
Publication date2017
Pages759-764
ISBN (Print)978-1-4503-4486-9
DOIs
Publication statusPublished - 2017
EventThe 32nd ACM SIGAPP Symposium On Applied Computing -
Duration: 4 Apr 2017 → …
Conference number: 32

Conference

ConferenceThe 32nd ACM SIGAPP Symposium On Applied Computing
Number32
Period04/04/2017 → …

Keywords

  • DCR graphs, declarative process mining

Cite this