Norm Compliance in Business Process Modeling

Governatori, Guido; Rotolo, Antonino

doi:10.1007/978-3-642-16289-3_17

Cited by 59 publications

(55 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some solutions like [7] provides a linear time algorithm to check whether a single trace is compliant, and [9] gives approximate solutions in linear time.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Algorithms for Basic Compliance Problems

Tosatto¹,

Kharbili²,

Governatori

et al. 2013

2013 IEEE Sixth International Conference on Software Testing, Verification and Validation Workshops

Self Cite

View full text Add to dashboard Cite

Abstract-The present paper focuses on the problems of verifying compliance for global achievement and maintenance obligations. We first introduce the elements needed to identify and study compliance to these two classes of obligations in processes. Additionally, we define procedures and algorithms to efficiently deal with the identified compliance problem. We finally show that both algorithms proposed in the paper belong to the complexity class P.

show abstract

“…Some solutions like [7] provides a linear time algorithm to check whether a single trace is compliant, and [9] gives approximate solutions in linear time.…”

Section: Discussionmentioning

confidence: 99%

“…There are two different types of global obligations: achievement and maintenance. We use a subset of Process Compliance Logic (PCL) [7] to specify the global obligations.…”

Section: B Obligationsmentioning

confidence: 99%

Algorithms for Basic Compliance Problems

Tosatto¹,

Kharbili²,

Governatori

et al. 2013

2013 IEEE Sixth International Conference on Software Testing, Verification and Validation Workshops

Self Cite

View full text Add to dashboard Cite

show abstract

“…À k }, where À i represents an obligation. We use a subset of Process Compliance Logic (PCL) [13] to specify the obligations.…”

Section: Regulatory Frameworkmentioning

confidence: 99%

Business Process Regulatory Compliance is Hard

Tosatto

Governatori

Kelsen

2015

IEEE Trans. Serv. Comput.

Self Cite

View full text Add to dashboard Cite

Abstract-Verifying whether a business process is compliant with a regulatory framework is a difficult task. In the present paper we prove the hardness of the business process regulatory compliance problem by taking into account a sub-problem of the general problem. This limited problem allows to verify only the compliance of structured processes with respect to a regulatory framework composed of a set of conditional obligations including a deadline. Experimental evidence from existing studies shows that compliance is a difficult task. In this paper, despite considering a sub-problem of the general problem, we provide some theoretical evidence of the difficulty of the task. In particular we show that the source of the complexity lies in the core language of verifying conditional obligations with a deadline. We prove that for this simplified case verifying partial compliance belongs to the class of NP-complete problems, and verifying full compliance belongs to the class of coNP-complete problems. Thus by proving the difficulty of a simplified compliance problem we prove that the general problem of verifying business process regulatory compliance is hard.

show abstract

“…Other works like [20] and [24] provide solutions in linear time, however the first verifies the compliance of a trace, instead of a process, and the second provides an approximate solution.…”

Section: Conclusion and Related Workmentioning

confidence: 99%