Abstract
In this paper, we propose a novel approach that calculates all the possible applications of synthesis rules, for well-formed free-choice Petri nets [8], 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
van der Aalst, W.M.P., van Hee, K.M., ter Hofstede, A.H.M., Sidorova, N., Verbeek, H.M.W., Voorhoeve, M., Wynn, M.T.: Soundness of workflow nets: classification, decidability, and analysis. Formal Asp. Comput. 23(3), 333–363 (2011)
Badouel, E., Bernardinello, L., Darondeau, P.: Process Discovery, pp. 283–300. Springer, Berlin (2015)
Bergenthum, Robin, Desel, Jörg, Lorenz, Robert, Mauser, Sebastian: synthesis of petri nets from scenarios with VipTool. In: van Hee, Kees M., Valk, Rüdiger (eds.) PETRI NETS 2008. LNCS, vol. 5062, pp. 388–398. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-68746-7_25
Berthelot, G.: Transformations and decompositions of nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Petri Nets: Central Models and Their Properties, pp. 359–376. Springer, Berlin (1987)
Berthelot, G.: Lri-Iie: checking properties of nets using transformations. In: Rozenberg, G. (ed.) Advances in Petri Nets 1985, pp. 19–40. Springer, Berlin (1986)
Chao, D.Y., Wang, D.T.: Petri net synthesis and synchronization using knitting technique. In: Proceedings of IEEE International Conference on Systems, Man and Cybernetics. vol. 1, pp. 652–657 (1994)
Datta, A., Ghosh, S.: Synthesis of a class of deadlock-free Petri nets. J. ACM (JACM) 31(3), 486–506 (1984)
Desel, J., Esparza, J.: Free Choice Petri Nets, vol. 40. Cambridge University Press, Cambridge (2005)
Dixit, P.M., Buijs, J.C.A.M., van der Aalst, W.M.P.: Prodigy : Human-in-the-loop process discovery. In: 2018 12th International Conference on Research Challenges in Information Science (RCIS), pp. 1–12 (2018)
Dixit, P.M., et al.: Detection and interactive repair of event ordering imperfection in process logs. In: Krogstie, J., Reijers, H.A. (eds.) Advanced Information Systems Engineering, pp. 274–290. Springer International Publishing, Cham (2018)
van Dongen, B.F., van der Aalst, W.M.P., Verbeek, H.M.W.: Verification of epcs: Using reduction rules and petri nets. In: Pastor, O., Falcão e Cunha, J. (eds.) Advanced Information Systems Engineering: 17th International Conference, CAiSE 2005, Porto, Portugal, June 13–17, 2005. Proceedings, pp. 372–386. Springer, Berlin (2005)
Esparza, J.: Synthesis rules for Petri nets, and how they lead to new results. In: International Conference on Concurrency Theory, pp. 182–198. Springer, Berlin (1990)
Esparza, Javier, Hoffmann, Philipp: Reduction rules for colored workflow nets. In: Stevens, Perdita, Wąsowski, Andrzej (eds.) FASE 2016. LNCS, vol. 9633, pp. 342–358. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-49665-7_20
Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541–580 (1989)
van Dongen, B.F., de Medeiros, A.K.A., Verbeek, H.M.W., Weijters, A.J.M.M., van der Aalst, W.M.P.: The ProM framework: a new era in process mining tool support. In: Ciardo, Gianfranco, Darondeau, Philippe (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 444–454. Springer, Heidelberg (2005). https://doi.org/10.1007/11494744_25
Verbeek, H.M.W., van der Aalst, W.M.P.: Woflan 2.0 a petri-net-based workflow diagnosis tool. In: Nielsen, M., Simpson, D. (eds.) International Conference on Applications and Theory of Petri Nets, pp. 475–484. Springer, Berlin (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Dixit, P.M., Verbeek, H.M.W., van der Aalst, W.M.P. (2018). Incremental Computation of Synthesis Rules for Free-Choice Petri Nets. In: Bae, K., Ölveczky, P. (eds) Formal Aspects of Component Software. FACS 2018. Lecture Notes in Computer Science(), vol 11222. Springer, Cham. https://doi.org/10.1007/978-3-030-02146-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-02146-7_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-02145-0
Online ISBN: 978-3-030-02146-7
eBook Packages: Computer ScienceComputer Science (R0)