Detecting deadlock and multiple termination in BPMN model using process automata
The Business Process Modeling Notation (BPMN) has been widely used as a tool for business process modeling. Despite of its popular, the BPMN does not contain a precise semantics. The incompatible constructs can cause the behavioral error such as deadlock. This paper proposed an automata-based formal...
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | Conference or Workshop Item |
| 語言: | English |
| 出版: |
2014
|
| 在線閱讀: | http://www.scopus.com/inward/record.url?eid=2-s2.0-77954895601&partnerID=40&md5=ab0461be7952574edf5e8caaa07b0608 http://cmuir.cmu.ac.th/handle/6653943832/6235 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Chiang Mai University |
| 語言: | English |
| 總結: | The Business Process Modeling Notation (BPMN) has been widely used as a tool for business process modeling. Despite of its popular, the BPMN does not contain a precise semantics. The incompatible constructs can cause the behavioral error such as deadlock. This paper proposed an automata-based formalism for verification of the single source BPMN model. We first introduce the transformation of the BPMN model to the process automata. Then, we verify the compatibility of the transition function. The BPMN model is considered to be correct if there exists at least one process sequence that is accepted by the process automata. Deadlock and multiple termination problems are chosen to illustrate our approach. The experimental results show that we can detect both problems (if any). |
|---|