DocumentCode
302459
Title
The legal firing sequence problem of Petri nets with state machine structure
Author
Morita, Keisuke ; Watanabe, Toshimasa
Author_Institution
Graduate Sch. of Eng., Hiroshima Univ., Japan
Volume
3
fYear
1996
fDate
12-15 May 1996
Firstpage
64
Abstract
The subject of this paper is the legal firing sequence problem (LFS) of Petri nets: given a Petri net PN, an initial marking M and a firing count vector X, find a firing sequence S which starts from M and each transition t appears in δ exactly X(t) times as prescribed by X. The results are as follows: (1) LFS is NP-complete even if PN has state machine structure with exactly two kinds of edge weights and X(t)=1 for every transition t; (2) linear time algorithms solving LFS are proposed for several classes of Petri nets having state machine structure
Keywords
Petri nets; computational complexity; finite state machines; Petri nets; edge weights; firing count vector; initial marking; legal firing sequence problem; linear time algorithms; state machine structure; Circuits and systems; Law; Legal factors; Petri nets; Systems engineering and theory; Tree data structures;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1996. ISCAS '96., Connecting the World., 1996 IEEE International Symposium on
Conference_Location
Atlanta, GA
Print_ISBN
0-7803-3073-0
Type
conf
DOI
10.1109/ISCAS.1996.541481
Filename
541481
Link To Document