Process Synthesis with Sequential and Parallel Constraints

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.

[1]  Paolo Falcarin,et al.  Synthesizing Service Composition Models on the Basis of Temporal Business Rules , 2008, Journal of Computer Science and Technology.

[2]  Wil M. P. van der Aalst,et al.  DECLARE: Full Support for Loosely-Structured Processes , 2007, 11th IEEE International Enterprise Distributed Object Computing Conference (EDOC 2007).

[3]  Werner Zimmermann,et al.  Bussysteme in der Fahrzeugtechnik , 2014 .

[4]  Marlon Dumas,et al.  Structuring acyclic process models , 2012, Inf. Syst..

[5]  Peter Dadam,et al.  SeaFlows Toolset - Compliance Verification Made Easy for Process-Aware Information Systems , 2010, CAiSE Forum.

[6]  Wil M. P. van der Aalst,et al.  Process Mining - Discovery, Conformance and Enhancement of Business Processes , 2011 .

[7]  Jian Yu,et al.  Pattern Based Property Specification and Verification for Service Composition , 2006, WISE.

[8]  Jan Karel Lenstra,et al.  Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..

[9]  Klemens Böhm,et al.  User-Friendly Property Specification and Process Verification - A Case Study with Vehicle-Commissioning Processes , 2014, BPM.

[10]  Ahmed Awad,et al.  An Iterative Approach for Business Process Template Synthesis from Compliance Rules , 2011, CAiSE.

[11]  Remco M. Dijkman,et al.  Semantics and analysis of business process models in BPMN , 2008, Inf. Softw. Technol..

[12]  Peter Dadam,et al.  Business Process Compliance , 2008, EMISA Forum.

[13]  Mathias Weske,et al.  Efficient Compliance Checking Using BPMN-Q and Temporal Logic , 2008, BPM.

[14]  Wil M. P. van der Aalst,et al.  Workflow mining: discovering process models from event logs , 2004, IEEE Transactions on Knowledge and Data Engineering.

[15]  Ross M. McConnell,et al.  Linear-time modular decomposition of directed graphs , 2005, Discret. Appl. Math..

[16]  Klemens Böhm,et al.  Automatic Generation of Optimized Process Models from Declarative Specifications , 2015, CAiSE.

[17]  George S. Avrunin,et al.  Patterns in property specifications for finite-state verification , 1999, Proceedings of the 1999 International Conference on Software Engineering (IEEE Cat. No.99CB37002).

[18]  Niels Lohmann Compliance by design for artifact-centric business processes , 2013, Inf. Syst..

[19]  Daniel Roos,et al.  The machine that changed the world : based on the Massachusetts Institute of Technology 5-million dollar 5-year study on the future of the automobile , 1990 .

[20]  Klemens Böhm,et al.  A new verification technique for large processes based on identification of relevant tasks , 2015, Inf. Syst..