Formal Analysis the Executability of Semantically Annotated Process Model

Semantically annotated process model(SPM) is a process model with semantic annotations,i.e.,preconditioneffect,labeled for its activities based on the domain ontology.However,SPM analysis is challenging,since its correctness is beyond the soundness of process model and its state transition needs to care about domain state change.To assuring the correctness of SPM,the executablity analysis is essential and has also been identified as a coNP-hard problem.To tame the hardness of the executability,a dynamic semantics for SPM,based on related variables set model,is proposed for defining domain state transition;an encoding method is presented by which the semantics is encoded into formulae as well as the executability.Meanwhile,a procedure,based on SAT solver,is proposed through which the executability can be bounded model checked and diagnosed.Our method has been implemented as a tool called SPMT.The experiment results show our method is valid and SAT solver is very efficient.