Verifying Business Process Compliance by Reasoning about Actions

被引:0
|
作者
D'Aprile, Davide [1 ]
Giordano, Laura [1 ]
Gliozzi, Valentina [2 ]
Martelli, Alberto [2 ]
Pozzato, Gian Luca [2 ]
Dupre, Daniele Theseider [1 ]
机构
[1] Univ Piemonte Orientale, Dipartimento Informat, Alessandria, Italy
[2] Univ Toronto, Dipartimento Informat, Toronto, ON M5S 1A1, Canada
关键词
LOGIC;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper we address the problem of verifying business process compliance with norms. To this end, we employ reasoning about actions in a temporal action theory. The action theory is defined through a combination of Answer Set Programming and Dynamic Linear Time Temporal Logic (DULL). The temporal action theory allows us to formalize a business process as a temporal domain description, possibly including temporal constraints. Obligations in norms are captured by the notion of commitment, which is borrowed from the social approach to agent communication. Norms are represented using (possibly) non monotonic causal laws which (possibly) enforce new obligations. In this context, verifying compliance amounts to verify that no execution of the business process leaves some commitment unfulfilled. Compliance verification can be performed by Bounded Model Checking.
引用
收藏
页码:99 / +
页数:4
相关论文
共 50 条
  • [1] Verifying Compliance for Business Process Logs with a Hybrid Logic Model Checker
    Letia, Ioan Alfred
    Goron, Anca
    [J]. COMBINATIONS OF INTELLIGENT METHODS AND APPLICATIONS (CIMA 2014), 2016, 46 : 61 - 78
  • [2] Process algebra approach to reasoning about concurrent actions
    Yuan Feng
    Ming-Sheng Ying
    [J]. Journal of Computer Science and Technology, 2004, 19 : 364 - 373
  • [3] Process algebra approach to reasoning about concurrent actions
    Feng, Y
    Ying, MS
    [J]. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2004, 19 (03) : 364 - 373
  • [4] Reasoning about nondeterministic and concurrent actions: A process algebra approach
    Chen, XJ
    De Giacomo, G
    [J]. ARTIFICIAL INTELLIGENCE, 1999, 107 (01) : 63 - 98
  • [5] Reasoning about nondeterministic and concurrent actions: A process algebra approach
    De Giacomo, G
    Chen, XJ
    [J]. PROCEEDINGS OF THE THIRTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE, VOLS 1 AND 2, 1996, : 658 - 663
  • [6] Verifying Business Process Compatibility
    Wong, Peter Y. H.
    Gibbons, Jeremy
    [J]. QSIC 2008: PROCEEDINGS OF THE EIGHTH INTERNATIONAL CONFERENCE ON QUALITY SOFTWARE, 2008, : 126 - 131
  • [7] Reasoning about Actions with Loops
    He, Jiankun
    Shen, Yuping
    Zhao, Xishun
    [J]. ARTIFICIAL INTELLIGENCE: METHODS AND APPLICATIONS, 2014, 8445 : 504 - 509
  • [8] Verifying for Compliance to Data Constraints in Collaborative Business Processes
    Kasse, John Paul
    Xu, Lai
    deVrieze, Paul
    Bai, Yuewei
    [J]. COLLABORATIVE NETWORKS AND DIGITAL TRANSFORMATION, 2019, : 259 - 270
  • [9] Representation and reasoning about evolutions of the world in the context of reasoning about actions
    Baral C.
    Tran N.
    [J]. Studia Logica, 2005, 79 (1) : 33 - 46
  • [10] Massively parallel reasoning about actions
    Bornscheuer, Sven-Erik
    Seiler, Torsten
    [J]. Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science), 1996, 1137