DocumentCode
3426411
Title
Cycle time computation in deterministically timed weighted marked graphs
Author
Nakamura, Morikazu ; Silva, Manuel
Author_Institution
Ryukyus Univ., Okinawa, Japan
Volume
2
fYear
1999
fDate
1999
Firstpage
1037
Abstract
This paper considers the minimum cycle time (MCT) computation in deterministically timed weighted marked graphs (WMGs) under infinite server semantics. A transformation from a live and bounded WMG system into a live and bounded MG system is proposed in which the untimed behavior (represented by the Petri net language) and the minimum cycle time are preserved. By applying the well known LPP to the transformed MG system, the MCT can be computed exactly. The computational complexity of our approach is polynomial with respect to |X|, the size of the elementary T-semiflow of the original WMG
Keywords
Petri nets; computational complexity; discrete event systems; graph theory; bounded system; computational complexity; deterministically timed weighted marked graphs; elementary T-semiflow; infinite server semantics; live system; minimum cycle time computation; untimed behavior; Computational complexity; Linear programming; Manufacturing systems; Polynomials; Protocols; Timing;
fLanguage
English
Publisher
ieee
Conference_Titel
Emerging Technologies and Factory Automation, 1999. Proceedings. ETFA '99. 1999 7th IEEE International Conference on
Conference_Location
Barcelona
Print_ISBN
0-7803-5670-5
Type
conf
DOI
10.1109/ETFA.1999.813105
Filename
813105
Link To Document