Abstract
Synthesis is the generation of a process model that fulfills a set of declarative constraints, a. k. a. properties. In this article, we study synthesis in the presence of both so-called sequential and parallel constraints. Sequential constraints state that certain tasks must occur in a specific ordering. Parallel constraints specify the maximal degree of parallelization at a certain position in a process model. Combining both sequential and parallel constraints in one approach is difficult, because their interference is complex and hard to foresee. Besides this, with large specifications, solutions which do not scale are not viable either. Our synthesis approach consists of two steps. First, we generate a model fulfilling only the sequential constraints. We then apply a novel algorithm that deparallelizes the process to fulfill the parallel constraints as well as any additional optimization criteria. We evaluate our approach using the real-world use case of commissioning in vehicle manufacturing. In particular, we compare our synthesized models to ones domain experts have generated by hand. It turns out that our synthesized models are significantly better than these reference points.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Awad, A., Goré, R., Thomson, J., Weidlich, M.: An iterative approach for business process template synthesis from compliance rules. In: Mouratidis, H., Rolland, C. (eds.) CAiSE 2011. LNCS, vol. 6741, pp. 406–421. Springer, Heidelberg (2011). doi:10.1007/978-3-642-21640-4_31
Jian, Y., et al.: Synthesizing service composition models on thebasis of temporal business rules. J. Comput. Sci. Technol. 23(6), 885–894 (2008)
Mrasek, R., Mülle, J., Böhm, K.: Automatic generation of optimized process models from declarative specifications. In: Zdravkovic, J., Kirikova, M., Johannesson, P. (eds.) CAiSE 2015. LNCS, vol. 9097, pp. 382–397. Springer, Heidelberg (2015). doi:10.1007/978-3-319-19069-3_24
Lohmann, N.: Compliance by design for artifact-centric business processes. In: Rinderle-Ma, S., Toumani, F., Wolf, K. (eds.) BPM 2011. LNCS, vol. 6896, pp. 606–618. Springer, Heidelberg (2011). doi:10.1007/978-3-642-23059-2_11
Dijkman, R.M., Dumas, M., Ouyang, C.: Semantics andanalysis of business process models in BPMN. Inf. Softw. Technol. 50(12), 1281–1294 (2008)
Mrasek, R., Mülle, J., Böhm, K.: A new verification technique for large processes based on identification of relevant tasks. Inf. Syst. 47, 82–97 (2015)
Rinderle-Ma, S., Thao, L.L., Dadam, P.: Businessprocess compliance. In: 2008 EMISA Forum, pp. 24–29 (2008)
Mrasek, R., Mülle, J., Böhm, K., Becker, M., Allmann, C.: User-friendly property specification and process verification – a case study with vehicle-commissioning processes. In: Sadiq, S., Soffer, P., Völzer, H. (eds.) BPM 2014. LNCS, vol. 8659, pp. 301–316. Springer, Heidelberg (2014). doi:10.1007/978-3-319-10172-9_19
Awad, A., Decker, G., Weske, M.: Efficient compliance checking using BPMN-Q and temporal logic. In: Dumas, M., Reichert, M., Shan, M.-C. (eds.) BPM 2008. LNCS, vol. 5240, pp. 326–341. Springer, Heidelberg (2008). doi:10.1007/978-3-540-85758-7_24
Ly, L.T., Knuplesch, D., Rinderle-Ma, S., Göser, K., Pfeifer, H., Reichert, M., Dadam, P.: SeaFlows Toolset – compliance verification made easy for process-aware information systems. In: Soffer, P., Proper, E. (eds.) CAiSE Forum 2010. LNBIP, vol. 72, pp. 76–91. Springer, Heidelberg (2011). doi:10.1007/978-3-642-17722-4_6
Dwyer, M.B., Avrunin, G.S., Corbett, J.C.: Patterns in property specifications for finite-stateverification. In: International Conference on Software Engineering, pp. 411–420 (1999)
Womack, J.P., Jones, D.T., Roos, D.: Massachusetts Institute of Technology. Machine that Changed theWorld. Free Press, London (2007)
Pešić, M., Schonenberg, H., van der Aalst, W.M.P.: DECLARE: full support for loosely-structured processes. In: 11th IEEE Intl. EDOC 2007, pp. 287–287 (2007)
Mrasek, R., Mülle, J., Böhm, K.: AutomaticGeneration of Optimized Process Models from DeclarativeSpecifications. Technical Report 2014-15. Karlsruhe: KITScientific Publishing, Nov. 2014
McConnell, R.M., de Montgolfier, F.: Linear-timemodular decomposition of directed graphs. Discrete Appl. Math. 145(2), 198–209 (2005)
Zimmermann, W., Schmidgall, R.: Bussysteme in derFahrzeugtechnik - Protokolle, Standards und Softwarearchitektur (2011)
Blazewicz, J., Lenstra, J.K., RinnooyKan, A.H.G.: Scheduling subject to resource constraints: classificationand complexity. Discrete Appl. Math. 5(1), 11–24 (1983)
Polyvyanyy, A., García-Bañuelos, L., Dumas, M.: Structuring acyclic process models. Inf. Syst. 37(6), 518–538 (2012). BPM 2010
van der Aalst, W.M.P.: Process Mining: Discovery, Conformanceand Enhancement of Business Processes, 1st edn. Springer, Heidelberg (2011)
Yu, J., Manh, T.P., Han, J., Jin, Y., Han, Y., Wang, J.: Pattern based property specification and verification for service composition. In: Aberer, K., Peng, Z., Rundensteiner, E.A., Zhang, Y., Li, X. (eds.) WISE 2006. LNCS, vol. 4255, pp. 156–168. Springer, Heidelberg (2006). doi:10.1007/11912873_18
van der Aalst, W.M.P., Weijters, A.J.M.M., Maruster, L.: Workflow mining: discovering process models from event logs. IEEE Trans. Knowl. Data Eng. 16(9), 1128–1142 (2004)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Mrasek, R., Mülle, J., Böhm, K. (2016). Process Synthesis with Sequential and Parallel Constraints. In: Debruyne, C., et al. On the Move to Meaningful Internet Systems: OTM 2016 Conferences. OTM 2016. Lecture Notes in Computer Science(), vol 10033. Springer, Cham. https://doi.org/10.1007/978-3-319-48472-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-48472-3_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-48471-6
Online ISBN: 978-3-319-48472-3
eBook Packages: Computer ScienceComputer Science (R0)