Abstract
An algorithm is proposed for constructing a Petti net model from a finite set of firing sequences. The algorithm consists of two phases. In the first phase, a language is identified in the form of a finite state automaton 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.
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
D. Angluin: Learning Regular Sets from Queries and Counter-examples, Information and Control 75,87/106 (1987).
D. Angluin: Inference of Reversible Languages, J. of ACM, Vol.29, No.3, 741/765 (1982).
L. Czaja: Making Nets Abstract and Structured, Lecture Notes in Computer Science 222, 181/202 (1986).
R. Gold: Complexity of Automaton Identification from Given Data, Information and Control 37, 302/320 (1978).
J. Esparza and M. Silva: Top-down Synthesis of Live and Bounded Free Choice Nets, Lecture Notes in Computer Science 524, Springer, 118/139 (1991).
J. Grabowski: On Partial Languages, Fundamenta Informatica 4-2,427/496 (1981).
P. Graubmann: The Construction of EN Systems from a given Trace Behaviour, Lecture Notes in Computer Science 340,133/153 (1989).
S. Hashizume et al.: Design of Condition/Event-nets, 4th Workshop on Discrete Event Systems in SICE, 7/12 (1990) (in Japanese).
K. Hiraishi: Construction of Petri Nets from Given State Transitions, IIAS-SIS Research Report RR-91-18E, FUJITSU LABORATORIES LTD. (1991).
A. Mazurkiewicz: Trace Theory, Lecture Notes in Computer Science 255, Springer, 279/324 (1987).
T. Murata: Synthesis of Decision-Free Concurrent Systems for Prescribed Resources and Performance, IEEE Trans. on Software Engineering, Vol. SE-6, No.6, 525/530 (1980).
P. Ramage and W. Wonham: The Control of Discrete Event Systems, Proc. of IEEE, Vol.77, No.1, 81/97 (1989).
R. Tarjan: Efficiency of a Good But Not Linear Set Union Algorithm, J. of ACM, Vol.22, No.2, 215/225 (1975).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hiraishi, K. (1992). Construction of a class of safe Petri nets by presenting firing sequences. In: Jensen, K. (eds) Application and Theory of Petri Nets 1992. ICATPN 1992. Lecture Notes in Computer Science, vol 616. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55676-1_14
Download citation
DOI: https://doi.org/10.1007/3-540-55676-1_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55676-3
Online ISBN: 978-3-540-47270-4
eBook Packages: Springer Book Archive