The Community for Technology Leaders
2017 IEEE 21st International Enterprise Distributed Object Computing Conference (EDOC) (2017)
Quebec City, Quebec, Canada
Oct. 10, 2017 to Oct. 13, 2017
ISSN: 2325-6362
ISBN: 978-1-5090-3045-3
pp: 165-174
ABSTRACT
The debate on advantages and disadvantages of declarative versus procedural process modeling languages for different usage scenarios has been intense. Procedural languages are more suited for describing operational processes while declarative ones for expressing regulations/guidelines and, in many situations, the need of combining the benefits of the two rises. Instead of forcing modelers to use a hybrid language, we envisage to keep the two specifications separate and propose a technique that automatically adapts procedural models so as to comply with sets of declarative rules. This not only fits scenarios where, e.g., company processes have to be modified according to changing external rules, but, more in general, it presents a way to take advantage of the flexibility of declarative while maintaining the high level of support provided by procedural languages. Furthermore, by comparing the original and the resulting procedural models, the impact of rules is clearly exposed. In this paper, we frame the problem above by providing its theoretical characterization and propose an automata-based solution, which is then evaluated against approaches leveraging state-of-the-art techniques for process discovery and model repair.
INDEX TERMS
business data processing,
CITATION

R. De Masellis, C. Di Francescomarino, C. Ghidini, A. Laponin and F. M. Maggi, "Rule Propagation: Adapting Procedural Process Models to Declarative Business Rules," 2017 IEEE 21st International Enterprise Distributed Object Computing Conference (EDOC), Quebec City, Quebec, Canada, 2017, pp. 165-174.
doi:10.1109/EDOC.2017.30
431 ms
(Ver 3.3 (11022016))