The so-called synthesis problem for nets, which consists in deciding whether a given graph is isomorphic to the case graph of some net, and then constructing the net, has been solved in the litterature for various types of nets, ranging from elementary nets to Petri nets. The common principle for the synthesis is the idea of regions in graphs, representing possible extensions of places in nets. However, no practical algorithm has been defined so far for the synthesis. We give here explicit algorithms solving in polynomial time the synthesis problem for bounded nets from regular languages or from finite automata.
CITATION STYLE
Badouel, E., Bernardinello, L., & Darondeau, P. (1995). Polynomial algorithms for the synthesis of bounded nets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 915, pp. 364–378). Springer Verlag. https://doi.org/10.1007/3-540-59293-8_207
Mendeley helps you to discover research relevant for your work.