Towards Process Mining with Graph Transformation Systems

Reference

H.J. Sander Bruggink. Towards process mining with graph transformation systems. In Proceedings of ICGT 2014, 2014.

Abstract

This paper is about process mining with graph transformation systems (GTSs). Given a set of observed transition sequences, the goal is to find a GTS – that is a finite set of graph transformation rules – that models these transition sequences as well as possible. In this paper the focus is on real-word processes such as business processes or (human) problem solving strategies, with the aim of better understanding such processes. The observed behaviour is not assumed to be either complete or error-free and the given model is expected to generalize the observed behaviour and be robust to erroneous input. The paper presents some basic algorithms that obtain textscgtss from observed transition sequences and gives a method to compare the resulting GTS.

Suggested BibTeX entry:

@inproceedings{b:mining2014,
    author = {H.J. Sander Bruggink},
    booktitle = {Proceedings of ICGT 2014},
    title = {Towards Process Mining with Graph Transformation Systems},
    year = {2014}
}

This work is not available online here.