Algorithms for tractable compliance problems (bibtex)
by S. Colombo Tosatto, P. Kelsen, Q. Ma, M. el Kharbili, G. Governatori, L. van der Torre
Abstract:
In general the problem of verifying whether a structured business process is compliant with a given set of regulations is NP-hard. The present paper focuses on identifying a tractable subset of this problem, namely verifying whether a structured business process is compliant with a single global obligation. Global obligations are those whose validity spans for the entire execution of a business process. We identify two types of obligations: achievement and maintenance.\text[D?]In the present paper we firstly define an abstract framework capable to model the problem and secondly we define procedures and algorithms to deal with the compliance problem of checking the compliance of a structured business process with respect to a single global obligation. We show that the algorithms proposed in the paper run in polynomial time.
Reference:
Algorithms for tractable compliance problems (S. Colombo Tosatto, P. Kelsen, Q. Ma, M. el Kharbili, G. Governatori, L. van der Torre), In , Higher Education Press and Springer, 2014.
Bibtex Entry:
@Article{10993/19556,
  Title                    = {Algorithms for tractable compliance problems},
  Author                   = {Colombo Tosatto, S. and Kelsen, P. and Ma, Q. and el Kharbili, M. and Governatori, G. and van der Torre, L.},
  Year                     = {2014},

  Abstract                 = {In general the problem of verifying whether a structured business process is compliant with a given set of regulations is NP-hard. The present paper focuses on identifying a tractable subset of this problem, namely verifying whether a structured business process is compliant with a single global obligation. Global obligations are those whose validity spans for the entire execution of a business process. We identify two types of obligations: achievement and maintenance.\text{[D?]}In the present paper we firstly define an abstract framework capable to model the problem and secondly we define procedures and algorithms to deal with the compliance problem of checking the compliance of a structured business process with respect to a single global obligation. We show that the algorithms proposed in the paper run in polynomial time.},
  Publisher                = {Higher Education Press and Springer},
  Timestamp                = {2015.01.26}
}
Powered by bibtexbrowser