Abstract
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.
This work was partly supported by the French p.r.c. Modèles et Preuves, by the h.c.m. Network Express, and by the h.c.m. fellowship granted to Luca Bernardinello, on leave from the University of Milan.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Badouel, E., Bernardinello, L., and Darondeau, Ph., The Synthesis Problem for Elementary Net Systems is NP-Complete. Irisa/Inria research report to appear (1995).
Berge, C., Graphes et hypergraphes. Dunod, Paris (1970).
Bernardinello, L., Synthesis of Net Systems. Application and Theory of Petri Nets, Springer-Verlag Lecture Notes in Computer Science, vol. 691 (1993) 89–105.
Bernardinello, L., De Michelis, G., and Petruni, K., Synchronie distances as Generalized Regions. Rapporto Interno n. 107-93, Dipartimento di Scienze dell'Informazione, Università degli Studi di Milano (1993).
Desel, J., and Reisig, W., The Synthesis Problem of Petri Nets. TUM research report, Munich (1992).
Droste, M., and Shortt, R.M., Bounded Petri Nets of Finite Dimension have only Finitely Many Reachable Markings. Bulletin of the European Association for Computer Science, number 48, (1992) 172–174.
Droste, M., and Shortt, R.M., Petri Nets and Automata with Concurrency Relations — an Adjunction. in ”Semantics of Programming Languages and Model Theory”, M. Droste and Y. Gurevich eds(1993) 69–87.
Ehrenfeucht, A., and Rozenberg, G., Partial 2-structures; Part I: Basic Notions and the Representation Problem, and Part II: State Spaces of Concurrent Systems, Acta Informatica, vol 27 (1990).
Gondran, M., and Minoux, M., Graphes et algorithmes. Eyrolles, Paris (1985).
Hiraishi, K., Some complexity results on transitions systems and elementary net systems. Theoretical Computer Science 135 (1994) 361–376.
Hoogers, P.W., Kleijn, H.C.M., and Thiagarajan, P.S., A trace semantics for Petri nets. Springer-Verlag, Lecture Notes in Computer Science, vol. 623 (1992) 595–604.
Mukund, M., Petri Nets and Step Transition Systems. International Journal of Foundation of Computer Science, vol 3, n° 3 (1993).
Schrijver, A., Theory of Linear and Integer Programming. John Wiley (1986).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Badouel, E., Bernardinello, L., Darondeau, P. (1995). Polynomial algorithms for the synthesis of bounded nets. In: Mosses, P.D., Nielsen, M., Schwartzbach, M.I. (eds) TAPSOFT '95: Theory and Practice of Software Development. CAAP 1995. Lecture Notes in Computer Science, vol 915. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59293-8_207
Download citation
DOI: https://doi.org/10.1007/3-540-59293-8_207
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59293-8
Online ISBN: 978-3-540-49233-7
eBook Packages: Springer Book Archive