Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Texts in Theoretical Computer Science. An EATCS Series;Eric Badouel,2015
2. Badouel, É., Schlachter, U.: Incremental process discovery using Petri net synthesis. Fundamenta Informaticae 154(1–4), 1–13 (2017).
https://doi.org/10.3233/FI-2017-1548
3. Barylska, K., Best, E., Erofeev, E., Mikulski, Ł., Piątkowski, M.: On binary words being Petri net solvable. In: Carmona, J., Bergenthum, R., van der Aalst, W. (eds) ATAED 2015, pp. 1–15 (2015).
http://ceur-ws.org/Vol-1371
4. Lecture Notes in Computer Science;E Best,2017
5. vanden Broucke, S.K.L.M., De Weerdt, J.: Fodina: a robust and flexible heuristic process discovery technique. Decis. Support Syst. 100, 109–118 (2017).
https://doi.org/10.1016/j.dss.2017.04.005
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献