Abstract
Business process families provide an over-arching representation of the possible business processes of a target domain. They are defined by capturing the similarities and differences among the possible business processes of the target domain. To realize a business process family into a concrete business process model, the variability points of the business process family need to be bounded. The decision on how to bind these variation points boils down to the stakeholders' requirements and needs. Given specific requirements from the stakeholders, the business process family can be configured. This paper formally introduces and empirically evaluates a framework called ConfBPFM that utilizes standard techniques for identifying stakeholders' quality requirements and employs a metaheuristic search algorithm (i.e., Genetic Algorithms) to optimally configure a business process family.
Original language | English |
---|---|
Title of host publication | Proceedings - 2012 IEEE 9th International Conference on Services Computing, SCC 2012 |
Pages | 25-32 |
Number of pages | 8 |
DOIs | |
Publication status | Published - 17 Oct 2012 |
Externally published | Yes |
Event | IEEE International Conference on Services Computing 2012 - Honolulu, United States of America Duration: 24 Jun 2012 → 29 Jun 2012 Conference number: 9th https://ieeexplore.ieee.org/xpl/conhome/6273231/proceeding (Proceedings) |
Conference
Conference | IEEE International Conference on Services Computing 2012 |
---|---|
Abbreviated title | SCC 2012 |
Country/Territory | United States of America |
City | Honolulu |
Period | 24/06/12 → 29/06/12 |
Internet address |
Keywords
- business process family
- CS-AHP
- genetic algorithms
- nonfunctional requirements
- optimal configuration