The synthesis problem of Petri nets

The synthesis problem of concurrent systems is the problem of synthesizing a concurrent system model from sequential observations. The paper studies the synthesis problem for elementary Petri nets and transition systems. A characterization of the class of transition systems which correspond to elementary Petri nets is proven. It is shown how to generate all elementary Petri nets corresponding to a given transition system. If there is any such elementary Petri net, it is proven that there always exists a small one which has only polynomially many elements in the size of the transition system.

[1]  Ryszard Janicki,et al.  Transforming Sequential Systems into Concurrent Systems , 1985, Theor. Comput. Sci..

[2]  P. S. Thiagarajan,et al.  Elementary Net Systems , 1986, Advances in Petri Nets.

[3]  Madhavan Mukund.  Petri Nets and Step Transition Systems , 1992, Int. J. Found. Comput. Sci..

[4]  Christian Lengauer,et al.  A Methodology for Programming with Concurrency: An Informal Presentation , 1982, Sci. Comput. Program..

[5]  Grzegorz Rozenberg,et al.  Elementary Transition Systems , 1990, Theor. Comput. Sci..

[6]  Andrzej Ehrenfeucht,et al.  Partial (set) 2-structures , 1990, Acta Informatica.

[7]  Luca Bernardinello,et al.  Synthesis of Net Systems , 1993, Application and Theory of Petri Nets.

[8]  Andrzej Ehrenfeucht,et al.  Partial (set) 2-structures , 1990, Acta Informatica.