Name
Abstract | ||
|---|---|---|
Business processes support the design and implementation of software as workflows of local and inter-organisation activities. Tools provide the business process designer with modelling and execution facilities, but they barely provide formal analysis techniques. When one makes a process evolve, for example by refactoring it or by adding new features in it, it is important to be able to check whether, and how, this process has changed, and possibly correct evolution flaws. To reach this objective, we first present a model transformation from the BPMN standard notation to the LNT process algebra and LTS formal models. We then propose a set of relations for comparing business processes at the formal model level. With reference to related work, we propose a richer set of comparison primitives supporting renaming, refinement, property and context-awareness. We also support BPMN processes containing unbalanced structures among gateways. In order to make the checking of evolution convenient for business process designers, we have implemented tool support for our approach as a web application. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.scico.2018.09.007 | Science of Computer Programming |
Keywords | Field | DocType |
Business processes,Evolution,Automated verification,BPMN | Notation,Model transformation,Programming language,Business process,Computer science,Web application,Process calculus,Workflow,Code refactoring,Business Process Model and Notation | Journal |
Volume | ISSN | Citations |
170 | 0167-6423 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ajay Krishna | 1 | 2 | 4.10 |
| Pascal Poizat | 2 | 535 | 31.30 |
| Gwen Salaün | 3 | 988 | 71.03 |