| Full text | |
| Author(s): |
Oikawa, Marcio K.
;
Ferreira, Joao E.
;
Malkowski, Simon
;
Pu, Calton
;
Dayal, U
;
Eder, J
;
Koehler, J
;
Reijers, HA
Total Authors: 8
|
| Document type: | Journal article |
| Source: | Lecture Notes in Computer Science; v. 5701, p. 4-pg., 2009-01-01. |
| Abstract | |
Recently, a lot of work has been done oil formalization of business process specification, in particular, using Petri nets and process algebra. However, these efforts usually do not explicitly address complex business process development, which necessitates the specification, coordination, and synchronization of a large number of business steps. It is imperative that these atomic tasks are associated correctly and monitored for countless dependencies. Moreover, as these business processes grow, they become critically reliant on a large number of split and merge points, which additionally increases modeling complexity. Therefore, one of the central challenges in complex business process modeling is the composition of dependent business steps. We address this challenge and introduce a formally correct method for automated composition of algebraic expressions in complex business process modeling based on acyclic directed graph reductions. We show that our method generates all equivalent algebraic expression from an appropriate acyclic directed graph if the graph is well-formed and series-parallel. Additionally, we encapsulate the reductions in an algorithm that transforms business step dependencies described by users into digraphs, recognizes structural conflicts, identifies Wheatstone bridges, and finally generates algebraic expressions. (AU) | |
| FAPESP's process: | 06/00375-0 - Large scale order processing using the navigation plan concept |
| Grantee: | João Eduardo Ferreira |
| Support Opportunities: | Regular Research Grants |