Title :
Comments on “Timed Petri Nets in Modeling and Analysis of Cluster Tools”
Abstract :
In the above paper by Zuberek, conflict-free Petri nets with deterministic timing are used for modeling cluster tools. Performance analysis of the models is based on P-invariants. This comment tries to clarify some statements in the paper and points out a more efficient performance-analysis approach based on linear programming, which is of polynomial time complexity.
Keywords :
Invariants; linear programming; marked graphs; performance analysis; Circuits; Linear programming; Oceans; Performance analysis; Petri nets; Polynomials; Robotics and automation; Robots; Steady-state; Timing;
Journal_Title :
Automation Science and Engineering, IEEE Transactions on
DOI :
10.1109/TASE.2004.840069
