Algebraic Tools for the Performance Evaluation of Discrete Event Systems

Proceedings of the IEEE

Volumn 77, Issue 1, 1989, Pages 39-85

  Cohen, Guy ^a   Moller, Pierre ^b   Quadrat, Jean Pierre ^c   Viot, Michel ^d  

^a PSL RESEARCH UNIVERSITY   (France)

^b SANOFI   (France)

^c INRIA   (France)

^d ECOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES--ALGEBRA;

DISCRETE EVENT DYNAMIC PROCESSES; EVENT GRAPHS; PETRI NETS;

MATHEMATICAL MODELS;

EID: 0024478677     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/5.21069     Document Type: Article

References (19)

1. P. Caspi and N. Halbwachs, “A functional model for describing and reasoning about time behaviour of computing systems,” Acta Informatica, vol. 22, pp. 595–627, 1986.
2. G. Cohen, D. Dubois, J. P. Quadrat, and M. Viot, “Analyse du comportement periodique des systemes de production par la theorie des dioides,” INRIA Rep. 191, Le Chesnay, France, 1983.
3. “A linear system theoretic view of discrete event processes and its use for performance evaluation in manufacturing,” IEEE Trans. Automat. Contr., vol. AC-30, pp. 210–220, 1985.
4. “Linear system theory for discreteevent systems,” presented at 23rd IEEE Conf. on Decision and Control, Las Vegas, NV, 1984.
5. “Une theorie lineaire des systemes à évènements discrets,” INRIA Rep. 362, Le Chesnay, France, 1985.
6. “Dating and counting events in discrete event systems,” presented at 25th IEEE Conf. on Decision and Control, Athens, Greece, 1986.
7. R. A. Cunninghame-Green, Minimax Algebra. Berlin, W. Germany: Springer-Verlag, 1979.
8. P. Dubreil and M. L. Dubreil-Jacotin, Lecons d'Algebre Mod-erne, 2nd Ed. Paris, France: Dunod, 1964.
9. M. Gondran and M. Minoux, “Linear algebra in dioids: a survey of recent results,” Annals Discrete Math., vol. 19, pp. 147–164, 1984.
10. S. Helbig, “Optimization problems on extremal algebras: necessary and sufficient conditions for optimal points,” in Parametric Optimization and Approximation, B. Borowski and F. Deutsch, Eds. Basel, Switzerland: Birkhäuser-Verlag, 1985, pp. 166–184.
11. F. P. Kelly, Reversibility and Stochastic Networks. New York, NY: Wiley, 1979.
12. P. Moller, “Théorème de Cayley-Hamilton dans les dioides et application a I'étude des systemes à évènements discrets,” presented at 7th INRIA International Conf. on Analysis and Optimization of Systems, Antibes, France, 1986.
13. “Notions de rang dans les dioides vectoriels,” presentedat CNRS/CNET/INRIA Seminar Algebres Exotiques et Systèmes à Evènements Discrets, Issy-les-Moulineaux, France, 1987.
14. G. J. Olsder, “Some results on the minimal realization of discrete event systems,” presented at 25th IEEE Conf. on Decision and Control, Athens, Greece, 1986.
15. G. J. Olsder, J. A. C. Resing, R. E. de Vries, M. S. Keane, andG. Hooghiemstra, “Discrete event systems with stochastic processing times,” presented at the 27th IEEE Conf. on Decision and Control, Austin, TX, 1988.
16. G. J. Olsder and C. Roos, “Cramer and Cayley-Hamilton in the max-algebra,” Linear Algebra and its Applications, vol. 101, pp. 87–108, 1988.
17. C. V. Ramamoorthy and G. S. Ho, “Performance evaluation of asynchronous concurrent systems using Petri nets,” IEEE Trans. Software Eng., vol. SE-6, pp. 440–449, 1980.
18. H. Straubing, “A combinatorial proof of the Cayley-Hamilton theorem,” Discrete Math., vol. 43, pp. 273–279, 1983.
19. R. P. Wiley and R.R.Tenney, “Performance evaluation of decision-free stochastic timed Petri nets,” presented at 24th IEEE Conf. on Decision and Control, Ft. Lauderdale, FL, 1985.