DocumentCode
285695
Title
The minimum initial submarking problem of Petri nets with application to communication protocol design
Author
Watanabe, Toshimasa ; Kato, Naomoto ; Onaga, Kenji
Author_Institution
Dept. of Circuits & Syst., Hiroshima Univ., Japan
Volume
4
fYear
1992
fDate
3-6 May 1992
Firstpage
1733
Abstract
The authors analyze the time complexity of the minimum initial submarking problem of Petri nets. The general problem is shown to be NP-hard. Some polynomially solvable subproblems are given, and some approximation algorithms for the problem are proposed. An application of the problem to designing communication protocols is outlined
Keywords
Petri nets; communication complexity; protocols; NP-hard; Petri nets; approximation algorithms; communication protocol design; minimum initial submarking problem; polynomially solvable subproblems; time complexity; Ambient intelligence; Approximation algorithms; Circuits and systems; Design engineering; IEL; Logic; Petri nets; Polynomials; Protocols; Systems engineering and theory;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1992. ISCAS '92. Proceedings., 1992 IEEE International Symposium on
Conference_Location
San Diego, CA
Print_ISBN
0-7803-0593-0
Type
conf
DOI
10.1109/ISCAS.1992.230421
Filename
230421
Link To Document