Author:
Best Eike,Devillers Raymond
Publisher
Springer International Publishing
Reference25 articles.
1. Texts in Theoretical Computer Science. An EATCS Series;É Badouel,2015
2. Badouel, É., Bernardinello, L., Darondeau, P.: The synthesis problem for elementary net systems is NP-complete. Theor. Comput. Sci. 186(1–2), 107–134 (1997)
3. Lecture Notes in Computer Science;É Badouel,1999
4. Badouel, É., Caillaud, B., Darondeau, P.: Distributing finite automata through Petri net synthesis. J. Formal Aspects Comput. 13, 447–470 (2002)
5. 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.
http://ceur-ws.org/Vol-1371
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献