Business Process Full Compliance with Respect to a Set of Conditional Obligation in Polynomial Time
In this paper, we present a new methodology to evaluate whether a business process model is fully compliant with a regulatory framework composed of a set of conditional obligations. The methodology is based failure delta-constraints that are evaluated on bottom-up aggregations of a tree-like represe...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In this paper, we present a new methodology to evaluate whether a business
process model is fully compliant with a regulatory framework composed of a set
of conditional obligations. The methodology is based failure delta-constraints
that are evaluated on bottom-up aggregations of a tree-like representation of
business process models. While the generic problem of proving full compliance
is in coNP-complete, we show that verifying full compliance can be done in
polynomial time using our methodology, for an acyclic structured process model
given a regulatory framework composed by a set of conditional obligations,
whose elements are restricted to be represented by propositional literals |
---|---|
DOI: | 10.48550/arxiv.2001.10148 |