Reference : Algorithms for tractable compliance problems

	Document type :	Scientific journals : Article
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/19556

Title :	Algorithms for tractable compliance problems
Language :	English
Author, co-author :	Colombo Tosatto, Silvano [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
	Kelsen, Pierre [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
	Ma, Qin [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
	el Kharbili, Marwane [University of Luxembourg]
	Governatori, Guido [NICTA]
	van der Torre, Leon [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Publication date :	2015
Journal title :	Frontiers of Computer Science
Volume :	9
Issue/season :	1
Pages :	55-74
Peer reviewed :	Yes
Audience :	International
Keywords :	[en] Compliance ; Business Processes ; Algorithms
Abstract :	[en] 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. 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.
Permalink :	http://hdl.handle.net/10993/19556

	File(s) associated to this reference
	Fulltext file(s): File Commentary Version Size Access Limited access fcs2014.pdf Publisher postprint 551.95 kB Request a copy

All documents in ORBi^lu are protected by a user license.

 

University of Luxembourg Library |  Feedback |  Legal notices Site Map