Model checking of mixed-paradigm process models in a discovery context: finding the fit between declarative and procedural

The act of retrieving process models from event-based data logs can offer valuable information to business owners. Many approaches have been proposed for this purpose, mining for either a procedural or declarative outcome. A blended approach that combines both process model paradigms exists and offers a great way to deal with process environments which consist of different layers of flexibility. In this paper, it will be shown how to check such models for correctness, and how this checking can contribute to retrieving the models as well. The approach is based on intersecting both parts of the model and provides an effective way to check (i) whether the behavior is aligned, and (ii) where the model can be improved according to errors that arise along the respective paradigms. To this end, we extend the functionality of Fusion Miner, a mixed-paradigm process miner, in a way to inspect which amount of flexibility is right for the event log. The procedure is demonstrated with an implemented model checker and verified on real-life event logs

Conformance Checking of Mixed-paradigm Process Models

Mixed-paradigm process models integrate strengths of procedural and declarative representations like Petri nets and Declare. They are specifically interesting for process mining because they allow capturing complex behaviour in a compact way. A key research challenge for the proliferation of mixed-paradigm models for process mining is the lack of corresponding conformance checking techniques. In this paper, we address this problem by devising the first approach that works with intertwined state spaces of mixed-paradigm models. More specifically, our approach uses an alignment-based replay to explore the state space and compute trace fitness in a procedural way. In every state, the declarative constraints are separately updated, such that violations disable the corresponding activities. Our technique provides for an efficient replay towards an optimal alignment by respecting all orthogonal Declare constraints. We have implemented our technique in ProM and demonstrate its performance in an evaluation with real-world event logs.Comment: Accepted for publication in Information System