Exact and approximation algorithms for synthesizing specific classes of optimal block-structured processes

The design of optimal business processes is practically important in many areas including: manufacturing, process mining, planning & scheduling, and parallel computing. Business processes are usually required to satisfy correctness and robustness properties. Block-structured models have certain advantages by ensuring basic correctness and robustness by design. The aim of this work is to provide an in-depth investigation of the problem of automated synthesis of optimal block-structured processes. Our results concern new theoretical insights into this rather new problem, as well as new exact and approximation algorithms for various problem variants.