On Some LP Problems for Performance Evaluation of Timed Marked Graphs

IEEE Transactions on Automatic Control

Volumn 39, Issue 3, 1994, Pages 696-698

  Yamada, Takeo ^a   Kataoka, Seiji ^a  

^a NATIONAL DEFENSE ACADEMY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROL SYSTEM ANALYSIS; FUNCTION EVALUATION; GRAPH THEORY; LINEAR PROGRAMMING; PETRI NETS; SYSTEMS ANALYSIS;

DISCRETE EVENT DYNAMIC SYSTEMS; TIMED MARKED GRAPHS;

DISCRETE TIME CONTROL SYSTEMS;

EID: 0028396427     PISSN: 00189286     EISSN: 15582523     Source Type: Journal    
DOI: 10.1109/9.280791     Document Type: Article

References (9)

1. J. Campos, G. Chiola, and M. Silva, “Ergodicity and throughput bounds of Petri nets with unique consistent firing count vector,” IEEE Trans. Software Eng., vol. 17, pp. 117-125, 1991.
2. J. Campos, G. Chiola, J. M. Colom, and M. Silva, “Properties and performance bounds for timed marked graphs,” IEEE Trans. Circuit Syst. I, vol. 39, pp. 386-401, 1992.
3. W. K. Chen, Applied Graph Theory. Amsterdam: North-Holland, 1976.
4. S. Laftit, J.-M. Proth, and X.-L. Xie, “Optimization of invariant criteria for event graphs,” IEEE Trans. Automat. Contr., vol. 37, pp. 547-555, 1992.
5. J. Magott, “Performance evaluation of concurrent systems using Pernnets,” Inform. Proc. Lett., vol. 18, pp. 7-13, 1984.
6. S. Morioka and T. Yamada, “Performance evaluation of marked graphs by linear programming,” Int. J. Syst. Science, vol. 22, pp. 1541-1552, 1991.
7. T. Murata, “Petri nets: properties, analysis and applications,” Proc. IEEE, vol. 77, 1989, pp. 541-580.
8. J. L. Peterson, Petri Net Theory and the Modeling of Systems, hngle-wood Cliffs, N. J.: Prentice-Hall, 1981.
9. C. V. Ramamoorthy and G. S. Ho, “Performance evaluation ot asynchronous concurrent systems using Petri nets,” IEEE Trans. Software Engineering, vol. SE-6, pp. 440-449, 1980.