TY - JOUR
T1 - Business process verification with constraint temporal answer set programming
AU - Giordano, Laura
AU - Martelli, Alberto
AU - Spiotta, Matteo
AU - Dupré, Daniele Theseider
N1 - Funding Information:
This research has been partially supported by Regione Piemonte, Project ICT4LAW, and by the Compagnia di San Paolo.
PY - 2013/7/1
Y1 - 2013/7/1
N2 - The paper provides a framework for the verification of business processes, based on an extension of answer set programming (ASP) with temporal logic and constraints. The framework allows to capture expressive fluent annotations as well as data awareness in a uniform way. It allows for a declarative specification of a business process but also for encoding processes specified in conventional workflow languages. Verification of temporal properties of a business process, including verification of compliance to business rules, is performed by bounded model checking techniques in Answer Set Programming, extended with constraint solving for dealing with conditions on numeric data.
AB - The paper provides a framework for the verification of business processes, based on an extension of answer set programming (ASP) with temporal logic and constraints. The framework allows to capture expressive fluent annotations as well as data awareness in a uniform way. It allows for a declarative specification of a business process but also for encoding processes specified in conventional workflow languages. Verification of temporal properties of a business process, including verification of compliance to business rules, is performed by bounded model checking techniques in Answer Set Programming, extended with constraint solving for dealing with conditions on numeric data.
UR - http://www.scopus.com/inward/record.url?scp=84884805292&partnerID=8YFLogxK
U2 - 10.1017/S1471068413000409
DO - 10.1017/S1471068413000409
M3 - Article
SN - 1471-0684
VL - 13
SP - 641
EP - 655
JO - Theory and Practice of Logic Programming
JF - Theory and Practice of Logic Programming
IS - 4-5
ER -