CoCoMoT: Conformance Checking of Multi-Perspective Processes via SMT
(Extended Version)
- URL: http://arxiv.org/abs/2103.10507v1
- Date: Thu, 18 Mar 2021 20:22:50 GMT
- Title: CoCoMoT: Conformance Checking of Multi-Perspective Processes via SMT
(Extended Version)
- Authors: Paolo Felli and Alessandro Gianola and Marco Montali and Andrey Rivkin
and Sarah Winkler
- Abstract summary: We introduce the CoCoMoT (Computing Conformance Modulo Theories) framework.
First, we show how SAT-based encodings studied in the pure control-flow setting can be lifted to our data-aware case.
Second, we introduce a novel preprocessing technique based on a notion of property-preserving clustering.
- Score: 62.96267257163426
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Conformance checking is a key process mining task for comparing the expected
behavior captured in a process model and the actual behavior recorded in a log.
While this problem has been extensively studied for pure control-flow
processes, conformance checking with multi-perspective processes is still at
its infancy. In this paper, we attack this challenging problem by considering
processes that combine the data and control-flow dimensions. In particular, we
adopt data Petri nets (DPNs) as the underlying reference formalism, and show
how solid, well-established automated reasoning techniques can be effectively
employed for computing conformance metrics and data-aware alignments. We do so
by introducing the CoCoMoT (Computing Conformance Modulo Theories) framework,
with a fourfold contribution. First, we show how SAT-based encodings studied in
the pure control-flow setting can be lifted to our data-aware case, using SMT
as the underlying formal and algorithmic framework. Second, we introduce a
novel preprocessing technique based on a notion of property-preserving
clustering, to speed up the computation of conformance checking outputs. Third,
we provide a proof-of-concept implementation that uses a state-of-the-art SMT
solver and report on preliminary experiments. Finally, we discuss how CoCoMoT
directly lends itself to a number of further tasks, like multi- and
anti-alignments, log analysis by clustering, and model repair.
Related papers
- Disperse-Then-Merge: Pushing the Limits of Instruction Tuning via Alignment Tax Reduction [75.25114727856861]
Large language models (LLMs) tend to suffer from deterioration at the latter stage ofSupervised fine-tuning process.
We introduce a simple disperse-then-merge framework to address the issue.
Our framework outperforms various sophisticated methods such as data curation and training regularization on a series of standard knowledge and reasoning benchmarks.
arXiv Detail & Related papers (2024-05-22T08:18:19Z) - Online Variational Sequential Monte Carlo [49.97673761305336]
We build upon the variational sequential Monte Carlo (VSMC) method, which provides computationally efficient and accurate model parameter estimation and Bayesian latent-state inference.
Online VSMC is capable of performing efficiently, entirely on-the-fly, both parameter estimation and particle proposal adaptation.
arXiv Detail & Related papers (2023-12-19T21:45:38Z) - Object-Centric Conformance Alignments with Synchronization (Extended Version) [57.76661079749309]
We present a new formalism that combines the ability of object-centric Petri nets to capture one-to-many relations and the one of Petri nets with identifiers to compare and synchronize objects based on their identity.
We propose a conformance checking approach for such nets based on an encoding in satisfiability modulo theories (SMT)
arXiv Detail & Related papers (2023-12-13T21:53:32Z) - Relational Action Bases: Formalization, Effective Safety Verification,
and Invariants (Extended Version) [67.99023219822564]
We introduce the general framework of relational action bases (RABs)
RABs generalize existing models by lifting both restrictions.
We demonstrate the effectiveness of this approach on a benchmark of data-aware business processes.
arXiv Detail & Related papers (2022-08-12T17:03:50Z) - Conformance Checking with Uncertainty via SMT (Extended Version) [66.58864135810981]
We show how to solve the problem of checking conformance of uncertain logs against data-aware reference processes.
Our approach is modular, in that it homogeneously accommodates for different types of uncertainty.
We show the correctness of our approach and witness feasibility through a proof-of-concept implementation.
arXiv Detail & Related papers (2022-06-15T11:39:45Z) - Soundness of Data-Aware Processes with Arithmetic Conditions [8.914271888521652]
Data Petri nets (DPNs) have gained increasing popularity thanks to their ability to balance simplicity with expressiveness.
The interplay of data and control-flow makes checking the correctness of such models, specifically the well-known property of soundness, crucial and challenging.
We provide a framework for assessing soundness of DPNs enriched with arithmetic data conditions.
arXiv Detail & Related papers (2022-03-28T14:46:10Z) - Conformance Checking Over Stochastically Known Logs [7.882975068446842]
Data logs may become uncertain due to, e.g., sensor reading inaccuracies or incorrect interpretation of readings by processing programs.
In this work we focus on conformance checking, which compares a process model with an event log.
We mathematically define a trace model, a synchronous product, and a cost function that reflects the uncertainty of events in a log.
arXiv Detail & Related papers (2022-03-14T21:33:06Z) - Conformance Checking of Mixed-paradigm Process Models [1.8122712065585906]
Mixed-paradigm process models integrate strengths of procedural and declarative representations like Petri nets and Declare.
A key research challenge for the proliferation of mixed-paradigm models for process mining is the lack of corresponding conformance checking techniques.
We devise the first approach that works with intertwined state spaces of mixed-paradigm models.
arXiv Detail & Related papers (2020-11-23T17:04:33Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.