DocumentCode
3441281
Title
An approximation algorithm for the legal firing sequence problem of Petri nets
Author
Yamauchi, Masahiro ; Watanabe, Toshimasa
Author_Institution
Fac. of Eng., Hiroshima Univ., Japan
Volume
6
fYear
1994
fDate
30 May-2 Jun 1994
Firstpage
181
Abstract
The paper proposes an approximation algorithm YWLFS for the legal firing sequence problem, LFS for short, of Petri nets. Solving LFS has wide application to various problems, including the scheduling problems, the minimum initial resource allocation problems and the Petri net reachability problems. As far as we know YWLFS is the only approximation algorithm for LFS, and experimental results show that YWLFS is promising
Keywords
Petri nets; approximation theory; mathematics computing; reachability analysis; resource allocation; scheduling; Petri net reachability problems; Petri nets; YWLFS; approximation algorithm; legal firing sequence problem; minimum initial resource allocation problems; scheduling problems; Approximation algorithms; Circuits and systems; Delay; Facsimile; Law; Legal factors; Petri nets; Resource management; Scheduling algorithm; Systems engineering and theory;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1994. ISCAS '94., 1994 IEEE International Symposium on
Conference_Location
London
Print_ISBN
0-7803-1915-X
Type
conf
DOI
10.1109/ISCAS.1994.409556
Filename
409556
Link To Document