SAP R/3 business blueprint: understanding the business process reference model
SAP R/3 business blueprint: understanding the business process reference model
Analyzing process models using graph reduction techniques
Information Systems - The 11th international conference on advanced information systems engineering (CAiSE*
Aris-Business Process Modeling
Aris-Business Process Modeling
MDA Explained: The Model Driven Architecture: Practice and Promise
MDA Explained: The Model Driven Architecture: Practice and Promise
ERP modeling: a comprehensive approach
Information Systems
On the semantics of EPCs: resolving the vicious circle
Data & Knowledge Engineering - Special issue: Business process management
A configurable reference modelling language
Information Systems
XOTcl: an object-oriented scripting language
TCLTK'00 Proceedings of the 7th conference on USENIX Tcl/Tk - Volume 7
Verification of EPCs: using reduction rules and petri nets
CAiSE'05 Proceedings of the 17th international conference on Advanced Information Systems Engineering
Questionnaire-driven configuration of reference process models
CAiSE'07 Proceedings of the 19th international conference on Advanced information systems engineering
Faulty EPCs in the SAP reference model
BPM'06 Proceedings of the 4th international conference on Business Process Management
Model-driven enterprise systems configuration
CAiSE'06 Proceedings of the 18th international conference on Advanced Information Systems Engineering
Hi-index | 0.00 |
Process reference models play an important role for the alignment and configuration of commercial off-the-shelf Enterprise Systems to requirements of an organization. Recently, Configurable Event-driven Process Chains (C-EPCs) have been proposed as a language to support the model-driven configuration of such Enterprise Systems. While some problems of generating correct EPCs from a configured C-EPC have been discussed, up to now there is no implementation of an algorithm available to automate the configuration task. This paper presents a configuration algorithm that is guided by a minimality criterion. It details and extends a previous algorithm that has only been sketched so far. As a proof-of-concept the algorithm has been implemented.