In: Jensen, K.: Lecture Notes in Computer Science, Vol. 616; 13th International Conference on Application and Theory of Petri Nets 1992, Sheffield, UK, pages 244-262. Springer-Verlag, June 1992.
Abstract: An algorithm is proposed for constructing a Petri net model from a finite set of firing sequences. The algorithm consists of two places. In the first phase, a language is identified in the form of a finite state automation from given firing sequences. In the second phase, the dependency relation is extracted from the language, and the structure of a Petri net is guessed. The algorithm is for a class of safe Petri nets, and its running time is bounded by a polynomial function of given inputs.