Incremental computation of synthesis rules for free-choice Petri nets

Dixit, Prabhakar M., Verbeek, H.M.W. & van der Aalst, Wil M.P. (2018). Incremental computation of synthesis rules for free-choice Petri nets. In Peter Csaba Ölveczky & Kyungmin Bae (Eds.), Formal Aspects of Component Software – 15th International Conference, FACS 2018, Proceedings (pp. 97-117). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), No. 11222 LNCS). Springer.


In this paper, we propose a novel approach that calculates all the possible applications of synthesis rules, for well-formed free-choice Petri nets, in a speedy way to enable an interactive editing system. The proposed approach uses a so-called incremental synthesis structure, which can be used to extract all the synthesis rules, corresponding to a given net. Furthermore, this structure is updated incrementally, i.e. after usage of a synthesis rule, to obtain the incremental synthesis structure of the newly synthesized net. We prove that the proposed approach is correct and complete in order to synthesize any well-formed free-choice Petri net, starting with an initial well-formed atomic net and the corresponding incremental synthesis structure. A variant of the proposed approach has been implemented that allows interactive modeling (discovery) of sound business processes (from event logs). Experimental results show that the proposed approach is fast, and outperforms the baseline, and hence is well-suited for enabling interactive synthesis of very large nets.

Leave a Reply