The synthesis problem of Petri nets
The problem of deriving concurrent operational models from sequentially observed behaviour is solved for elementary Petri nets. Labelled directed graphs are used to represent behaviour. A new characterization of graphs representing the behaviour of some elementary Petri net is given. It is shown how the set of all nets exhibiting the behaviour given by a graph can be constructed and that, if this set is not empty, it contains a net with a polynomial number of elements in the size of the graph.
Unable to display preview. Download preview PDF.
- J. Desel, W. Reisig: The Synthesis Problem of Petri Nets. Technische Universität München, SFB-Bericht 342/20/92 A (1992)Google Scholar
- A. Ehrenfeucht, G. Rozenberg: Partial (Set) 2-Structures. Part I, II. Acta Informatica 27, pp. 315–368 (1990)Google Scholar
- R. Janicki: Transforming Sequential Systems into Concurrent Systems. Theoretical Computer Science 36, pp. 27–58 (1985)Google Scholar
- B. Krieg: Petrinetze und Zustandsgraphen. Institut für Informatik, Universität Hamburg, IFI-Bericht B-29/77 (1977)Google Scholar
- C. Lengauer, E.C.R. Hehner: A methodology for programming with concurrency: An informal presentation. Science of Computer Programming 2, pp. 1–18 (1982)Google Scholar
- M. Mukund: A transition system characterization of Petri nets. SPIC science foundation, school of mathematics, Madras, internal report TCS-91-2 (1991)Google Scholar
- P.S. Thiagarajan: Elementary Net Systems. Advances in Petri Nets 1986, Part I, Lecture Notes in Computer Science 254, Springer-Verlag, pp. 26–59 (1987)Google Scholar