Business Process Compliance with impact constraints

IF 3 2区计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS

Information Systems Pub Date : 2024-12-10 DOI:10.1016/j.is.2024.102505

Tewabe Chekole Workneh, Pietro Sala, Romeo Rizzi, Matteo Cristani

{"title":"Business Process Compliance with impact constraints","authors":"Tewabe Chekole Workneh, Pietro Sala, Romeo Rizzi, Matteo Cristani","doi":"10.1016/j.is.2024.102505","DOIUrl":null,"url":null,"abstract":"<div><div>Business Process Compliance is a family of methods to evaluate Business Processes in terms of the existence of <em>one execution</em> (one trace) that does not violate constraints superimposed on the process itself. The dual version is formulated as the superimposition of a set of constraints and consequent evaluation of the process for <em>all the executions</em>. These problems are relevant to a large part of actual applications, especially those in the context of <em>regulatory compliance</em> where we aim at verifying the process against a normative background (including, for instance, soft ones, such as guidelines, product specification, and product standards) or goals fixed by the owner of the process. In this paper we discuss one new type of compliance, that is <em>impact compliance</em>, devised to verify when a process respects a set of constraints, to establish that certain amounts, measuring the undesired effects of the tasks executed to implement the process, are <em>below given limits</em>.</div><div>In the current literature on Business Process Management, Business Process Analysis, and Business Process Compliance, this type of compliance checking process has not yet been addressed. As we demonstrate in this paper, this problem is significant and complex to address.</div><div>In particular, we show that the checking problems described above are, under certain structural conditions, polynomially solvable on deterministic machines. In general, however, the first problem is NP-complete whilst the second is polynomially solvable on deterministic machines.</div></div>","PeriodicalId":50363,"journal":{"name":"Information Systems","volume":"129 ","pages":"Article 102505"},"PeriodicalIF":3.0000,"publicationDate":"2024-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information Systems","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0306437924001637","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

Abstract

Business Process Compliance is a family of methods to evaluate Business Processes in terms of the existence of one execution (one trace) that does not violate constraints superimposed on the process itself. The dual version is formulated as the superimposition of a set of constraints and consequent evaluation of the process for all the executions. These problems are relevant to a large part of actual applications, especially those in the context of regulatory compliance where we aim at verifying the process against a normative background (including, for instance, soft ones, such as guidelines, product specification, and product standards) or goals fixed by the owner of the process. In this paper we discuss one new type of compliance, that is impact compliance, devised to verify when a process respects a set of constraints, to establish that certain amounts, measuring the undesired effects of the tasks executed to implement the process, are below given limits.

In the current literature on Business Process Management, Business Process Analysis, and Business Process Compliance, this type of compliance checking process has not yet been addressed. As we demonstrate in this paper, this problem is significant and complex to address.

In particular, we show that the checking problems described above are, under certain structural conditions, polynomially solvable on deterministic machines. In general, however, the first problem is NP-complete whilst the second is polynomially solvable on deterministic machines.

查看原文本刊更多论文

业务流程遵从性与影响约束

业务流程遵从性是根据不违反叠加在流程本身上的约束的一个执行（一个跟踪）的存在性来评估业务流程的一系列方法。双重版本被表述为一组约束的叠加和对所有执行过程的后续评估。这些问题与实际应用程序的很大一部分相关，特别是那些在法规遵从性的环境中，我们的目标是根据规范背景（包括，例如，软背景，如指导方针、产品规范和产品标准）或过程所有者确定的目标来验证过程。在本文中，我们讨论了一种新的遵从性类型，即影响遵从性，用于验证过程何时尊重一组约束，以确定某些数量，测量为实现过程而执行的任务的不期望效果，低于给定的限制。在当前关于业务流程管理、业务流程分析和业务流程遵从性的文献中，还没有提到这种类型的遵从性检查过程。正如我们在本文中所展示的，这个问题很重要，而且解决起来很复杂。特别地，我们证明了在一定的结构条件下，上述校验问题在确定性机器上是多项式可解的。然而，一般来说，第一个问题是np完全的，而第二个问题在确定性机器上是多项式可解的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Information Systems 工程技术-计算机：信息系统

CiteScore

9.40

自引率

2.70%

发文量

112

审稿时长

53 days

期刊介绍： Information systems are the software and hardware systems that support data-intensive applications. The journal Information Systems publishes articles concerning the design and implementation of languages, data models, process models, algorithms, software and hardware for information systems. Subject areas include data management issues as presented in the principal international database conferences (e.g., ACM SIGMOD/PODS, VLDB, ICDE and ICDT/EDBT) as well as data-related issues from the fields of data mining/machine learning, information retrieval coordinated with structured data, internet and cloud data management, business process management, web semantics, visual and audio information systems, scientific computing, and data science. Implementation papers having to do with massively parallel data management, fault tolerance in practice, and special purpose hardware for data-intensive systems are also welcome. Manuscripts from application domains, such as urban informatics, social and natural science, and Internet of Things, are also welcome. All papers should highlight innovative solutions to data management problems such as new data models, performance enhancements, and show how those innovations contribute to the goals of the application.