Abstract | ||
---|---|---|
Formal specifications and modeling languages can be used to provide support for Business Process (BP) analysts and designers to verify the behavior of BPs with respect to business performance indicators (i.e., service time, waiting time or queue size). This article presents the application of the Timed Automata (TA) formal language to check BPs modeled with Business Process Model and Notation (BPMN) using the model checking verification technique. Also, a set of transformation rules and two algorithms are introduced to obtain TA-networks from BPMN models, allowing the formal specification of a BP-task model equivalent to the BPMN model. The approach presented here contributes to conduct the qualitative analysis of BPMN models. |
Year | Venue | Field |
---|---|---|
2016 | SBMF | Artifact-centric business process model,Formal language,Programming language,Business process,Computer science,Formal specification,Formal methods,Business process modeling,Business Process Model and Notation,Business rule |
DocType | Citations | PageRank |
Conference | 1 | 0.38 |
References | Authors | |
6 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Luis E. Mendoza Morales | 1 | 14 | 4.86 |
Carlos Monsalve | 2 | 66 | 14.79 |
Monica Villavicencio | 3 | 14 | 3.58 |