DocumentCode :
3538488
Title :
Executability Analysis for Semantically Annotated Process Model
Author :
Ping Gong ; Jian Min Jiang ; Shi Zhang ; Zhi Qin Chen
Author_Institution :
Comput. Sci. Dept., Fujian Normal Univ., Fuzhou, China
fYear :
2012
fDate :
6-8 Dec. 2012
Firstpage :
117
Lastpage :
124
Abstract :
Semantically annotated process model (SPM) is a process model with semantic annotations, which include the precondition and effect, labeled for its activities based on the domain ontology. Such semantic annotations can increase the model´s understanding and reusability, and facilitate its implement as well as compliance analysis. However, SPM analysis is challenging, since its correctness is beyond the soundness of process model and its formal semantics needs to consider domain state change. To assuring the correctness of SPM, the executablity analysis, i.e., whether there exists activity whose precondition is falsatisfied when it is active, is essential and has also been identified as a coNP-hard problem. To tame the hardness of the executability, we define a dynamic semantics for SPM based on a model which is proposed for defining domain state transition, present an encoding method by which the formal semantics is encoded into formulae as well as the executability, and propose a procedure which can bounded model check and diagnose the executability by using SAT solver. Our method has been implemented as a tool called SPMT and its validity is also illustrated through examples.
Keywords :
business data processing; computational complexity; formal specification; formal verification; ontologies (artificial intelligence); SAT solver; SPM reusability; SPM understanding; SPMT tool; bounded model checking; business process model; coNP-hard problem; compliance analysis; domain ontology; domain state change; executability analysis; formal semantics; satisfiability; semantically annotated process model; Analytical models; Business; Computational modeling; Ontologies; Process control; Semantics; Unified modeling language; bounded model checking; executability; semantic process model;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Services Computing Conference (APSCC), 2012 IEEE Asia-Pacific
Conference_Location :
Guilin
Print_ISBN :
978-1-4673-4825-6
Type :
conf
DOI :
10.1109/APSCC.2012.25
Filename :
6478206
Link To Document :
بازگشت