Bibliography files

MAXPLUS
Tue May 28 19:14:15 MET DST 1996

References

1

M. Akian. Densities of idempotent measures and large deviations. Rapport de Recherche 2534, INRIA, 1995.

2

M. Akian. Theory of cost measures : convergence of decision variables. Rapport de Recherche 2611, INRIA, 1995.

3

M. Akian. From probabilities to cost measures via large deviations. Rapport de Recherche 2841, INRIA, 1996.

4

M. Akian, J. P. Quadrat, and M. Viot. Bellman processes. In 11th International Conference on Analysis and Optimization of Systems : Discrete Event Systems, volume 199 of Lecture notes in Control and Information Sciences. Springer Verlag, 1994.

5

M. Akian, J. P. Quadrat, and M. Viot. Duality between probability and optimization. In J. Gunawardena, editor, Idempotency. Cambridge University Press, 1996. to appear.

6

B.I. Aranovich. The use of matrix methods in problem of the analysis of relay-contact networks. Avtomat. i Telemeh., 10:437+, 1949.

7

M.J. Atallah. Finding the cycle index of an irreducible, nonnegative matrix. SIAM J. Comput, 11:567-570, 1982.

8

S.M. Avdoshin, V.V. Belov, and V.P. Maslov. Mathematical aspects in the design of computationial devices. Moskov. Inst. Electron. Mashinostr., Moscow, 1984. (Russian).

9

F. Baccelli. Ergodic theory of stochastic Petri networks. Annals of Probability, 20(1):375-396, 1992.

10

F. Baccelli. Ergodic theory of stochastic Petri networks. Annals of Probability, 20(1):375-396, 1992.

11

F. Baccelli, G. Cohen, and B. Gaujal. Recursive equations and basic properties of timed Petri nets. J. of Discrete Event Dynamic Systems, 1(4):415-439, 1992.

12

F. Baccelli, G. Cohen, G.J. Olsder, and J.P. Quadrat. Synchronization and Linearity. Wiley, 1992.

13

F. Baccelli, S. Foss, and B. Gaujal. Structural, temporal and stochastic properties of unbounded free-choice Petri nets. Rapport de Recherche 2411, INRIA, 1994.

14

F. Baccelli and T. Konstantopoulos. Estimates of cycle times in stochastic Petri nets. In I. Karatzas, editor, Proceedings of Workshop on Stochastic Analysis, Rutgers University, 1991. Springer, Berlin.

15

F. Baccelli and A.D. Makowski. Queuing models for systems with synchronization constraints. IEEE Proc, Special Issue on Discrete Event Systemes, 77(1):138-161, Jan. 1989.

16

R.C. Backhouse and B.A. Carré. Regular algebra applied to path finding problems. J. of the Inst. of Maths and Appl., 15:161-186, 1975.

17

C. Benzaken. Structures algébrique des cheminements: pseudo-treillis, gerbiers de carré nul. In G. Biorci, editor, Network and Switching Theory, pages 40-47. Academic Press, 1968.

18

P. Bernhard. A min-max certainty equivalence principle for nonlinear discrete-time control problems. Rapport de Recherche 2031, INRIA, Sep 1993.

19

D.P. Bertsekas and J.N. Tsitsiklis. An analysis of stochastic shortest path problems. Mathematics of Operations Research, 16:580-595, 1991.

20

T.S. Blyth. Matrices over ordered algebraic structures. J. of London Mathematical Society, 39:427-432, 1964.

21

T.S. Blyth and M.F. Janowitz. Residuation Theory. Pergamon press, 1972.

22

H. Braker. Algorithms and Applications in Timed Discrete Event Systems. PhD thesis, Delft University of Technology, Dec 1993.

23

H. Braker and J. Resing. Periodicity and critical circuits in a generalized max-algebra setting. Discrete Event Dynamic Systems. toappear.

24

Michael Bussieck, Hannes Hassler, Gerhard J. Woeginger, and Uwe T. Zimmermann. Fast algorithms for the maximum convolution problem. Operations Research Letters, 15(3):133-141, April 1994.

25

D. Butkovic. A condition for the strong regularity of matrices in the minimax algebra. Discrete Appl. Math., 11:209-222, 1985.

26

P. Butkovic and R.A. Cuninghame-Green. A condition for the strong regularity of matrices in the min algebra. Linear Algebra and Appl., 145:127-139, 1991.

27

Peter Butkovic. Strong regularity of matrices - a survey of results. Discrete Applied Mathematics, 48:45-68, 1994.

28

Z.Q. Cao, K.H. Kim, and F.W. Roush. Incline algebra and applications. Ellis Horwood, 1984.

29

J. Carlier and P. Chretienne. Problèmes d'Ordonnancement: modélisation, complexité, algorithmes. Masson, Paris, 1988.

30

D.A. Carlson. A Caratheodory-Hamilton-Jacobi theory for infinite horizon optimal control problems. J. Optimization Theory Appl., 48(2):265-287, 1986.

31

D.A. Carlson. On the existence of catching up optimal solutions for Lagrange problems defined on unbounde intervals. J. Optimization Theory Appl., 49:207-225, 1986.

32

B.A. Carré. An algebra for network routing problems. J. Inst. Math. Appl., 7:273-294, 1971.

33

B.A. Carré. Graphs and Networks. Oxford University Press, 1979.

34

Wen De Chen. Systems theory over the quasifield. In Systems analysis and simulation 1985, volume I, pages 143-146. Akademie-Verlag, Berlin, 1985.

35

Wen De Chen and Da Ming Ling. Nonnegative realization of systems over nonnegative quasi-fieds. Acta Math. Appl. Sinica (English Ser.), 5(3):252-261, 1989.

36

W. Chou and R.B. Griffiths. Effective potentials, a new approach and new results for one-dimensional systems with competing lenght scales. Phys. Rev. Lett., 56:1929-31, 1986.

37

W. Chou and R.B. Griffiths. Ground states of one dimensional systems using effective potentials. Phys. Rev. B, 34:6219-34, 1986.

38

P. Chretienne. Les Réseaux de Petri Temporisés. Thèse Université Pierre et Marie Curie (Paris VI), Paris, 1983.

39

G. Cohen. Dioids and Discrete Event Systems. In Proc. of the 11th Conf. on Anal. and Opt. of Systems: Discrete Event Systems, number 199 in Lect. Notes. in Control and Inf. Sci, Sophia Antipolis, June 1994. Springer.

40

G. Cohen, D. Dubois, J.P. Quadrat, and M. Viot. Analyse du comportement périodique des systèmes de production par la théorie des dioides. Rapport de recherche 191, INRIA, Le Chesnay, France, 1983.

41

G. Cohen, D. Dubois, J.P. Quadrat, and M. Viot. A linear system theoretic view of discrete event processes and its use for performance evaluation in manufacturing. IEEE Trans. on Automatic Control, AC-30:210-220, 1985.

42

G. Cohen, S. Gaubert, R. Nikoukhah, and J.P. Quadrat. Convex analysis and spectral analysis of timed event graphs. In 28th Conf. Decision and Control, Tampa, FL, Dec. 1989.

43

G. Cohen, S. Gaubert, and J.P. Quadrat. From first to second-order theory of linear discrete event systems. In 12th IFAC, Sydney, Jul. 1993.

44

G. Cohen, S. Gaubert, and J.P. Quadrat. Algebraic system analysis of timed Petri nets. In J. Gunawardena, editor, Idempotency, Publications of the Newton Institute. Cambridge University Press, March 1995. to appear in 1996.

45

G. Cohen, S. Gaubert, and J.P. Quadrat. Asymptotic throughput of continuous timed petri nets. In Proceedings of the 34th Conference on Decision and Control, New Orleans, Dec 1995.

46

G. Cohen, P. Moller, J.P. Quadrat, and M. Viot. Linear system theory for discrete-event systems. In 23rd IEEE Conf. on Decision and Control, Las Vegas, Nevada, 1984.

47

G. Cohen, P. Moller, J.P. Quadrat, and M. Viot. Une théorie linéaire des systèmes à événements discrets. Rapport de recherche 362, INRIA, Le Chesnay, France, 1985.

48

G. Cohen, P. Moller, J.P. Quadrat, and M. Viot. Dating and counting events in discrete event systems. In 25th IEEE Conf. on Decision and Control, Athens, Greece, 1986.

49

G. Cohen, P. Moller, J.P. Quadrat, and M. Viot. Algebraic tools for the performance evaluation of discrete event systems. IEEE Proceedings: Special issue on Discrete Event Systems, 77(1), Jan. 1989.

50

G. Cohen and J.-P. Quadrat, editors. 11th International Conference on Analysis and Optimization of Systems, Discrete Event Systems. Springer Verlag, 1994.

51

R. Cruon and Ph. Hervé. Quelques résultats relatifs à une structure algébrique et à son application au problème central de l'ordonnancement. Rev. Française de recherche Opérationnelle, 34:3-19, 1965.

52

R.A. Cuninghame-Green. Minimax Algebra. Number 166 in Lecture notes in Economics and Mathematical Systems. Springer, 1979.

53

R.A. Cuninghame-Green. The characteristic maxpolynomial of a matrix. J. of Math. Analysis and Appl., 95:110-116, 1983.

54

R.A. Cuninghame-Green. Algebraic realization of discrete dynamics systems. In Proceedings of the 1991 IFAC Workshop on Discrete Event System Theory and applications in manufacturing and social phenonmena, Shenyang,China, June 1991.

55

R.A Cuninghame-Green. Minimax algebra and applications. Advances in Imaging and Electron Physics, 90, 1995.

56

R.A. Cuninghame-Green and P. Butkovic. Discrete event dynamic systems: the strictly convex case. Annals of Operations Research, 57:45-63, 1995.

57

R.A. Cuninghame-Green and P.F.J Meijer. An algebra for piecewise-linear minimax probalems. Dicrete Appl. Math, 2:267-294, 1980.

58

B. De Schutter. Max-algebraic system theory for discrete event systems. Ph. d. thesis, KU Leuven, Feb 1996.

59

Bart De Schutter and Bart De Moor. The characteristic equation and minimal state space realization of siso systems in the max algebra. In Proc. of the 11th Conf. on Anal. and Opt. of Systems: Discrete Event Systems, number 199 in Lect. Notes. in Control and Inf. Sci, Sophia Antipolis, June 1994. Springer.

60

Bart De Schutter and Bart De Moor. Minimal realization in the max algebra is an extended linear complementarity problem. Systems and Control Letters, 25(2):103-111, May 1995.

61

Bart De Schutter and Bart De Moor. Minimal state space realization of mimo systems in the max algebra. In Proceedings of the 3rd European Control Conference, pages 411-416, Roma, Italy, Sept. 1995.

62

P. Del Moral. Particle resolution of non-linear estimation and optimization problems. PhD thesis, Paul Sabatier University, Toulouse III, June 1994.

63

P. Del Moral and G. Salut. Maslov optimization theory. Russian Journal of Mathematical Physics, 1995.

64

P. Del Moral and G. Salut. Particle interpretation of non-linear filtering and optimization. Russian Journal of Mathematical Physics, 1995.

65

E.V. Denardo. Period of connected networks. Math. Oper. Res., 2:20-24, 1977.

66

E.V. Denardo. Dynamic Programming, model and applications. Prentice Hall, 1982.

67

Desbazeilles. Exercices et Problèmes de Recherche Opérationnelle. Dunod, 1972.

68

A. di Nola and S. Sessa. On the Schein rank of matrices over linear lattices. Linear Algebra and Applications, 118:155-158, 1989.

69

P. Dubreil and M.L. Dubreil-Jacotin. Leçons d'Algèbre Moderne, 2nd ed. Dunod, Paris, 1964.

70

M.L. Dubreil-Jacotin, L. Lesieur, and R. Croisot. Leçons sur la Théorie des Treillis, des Structures Algébriques Ordonnées, et des Treillis géométriques, volume XXI of Cahiers Scientifiques. Gauthier Villars, Paris, 1953.

71

P. Dudnikov and S. Samborskii. Endomorphisms of finitely generated free semimodules. In V. Maslov and S. Samborskii, editors, Idempotent analysis, volume 13 of Adv. in Sov. Math. AMS, RI, 1992.

72

P. Dudnikov and S. Samborskii. Endomorphisms of semimodules over semirings with an idempotent operation. Math. in USSR, Izvestija, 38(1), 1992. translation of Izv. Akad. Nauk SSSR Ser. Mat. 55, 1991.

73

P.I. Dudnikov and S.N. Samborskii. Endomorphisms of semimodules over semirings with an idempotent operation. Technical Report 87-48, Inst. Mat. Akad. Nauk Ukrain SSR, 1987. preprint (Russian) MR 89f:16057.

74

P.I. Dudnikov and S.N. Samborskii. Spectra of endomorphisms of semimodules over semirings with an idempotent operation. Soviet Math. Dokl., 40(2):363-366, 1990.

75

L. Elsner, C.R. Johnson, and J. Dias da Silva. The Perron root of a weighted geometric mean of nonnegative matrices. Linear Multilinear Algebra, 24:1-13, 1988.

76

A.V. Finkelstein and M.A. Roytberg. Computation of biopolymers: a general approach to different problems. BioSystems, 30:1-20, 1993.

77

John G. Fletcher. A more general algorithm for computing closed semiring costs between vertices of a directed graph. Communications of the ACM, (6):350-351, 1980.

78

S. Friedland. Limit eigenvalues of nonnegatives matrices. Linear Alg. and Appl., 74:173-178, 1986.

79

S. Gaubert. An algebraic method for optimizing resources in timed event graphs. In A.Bensoussan and J.L. Lions, editors, Proceedings of the 9th International Conference on Analysis and Optimization of Systems, Antibes, June 1990, number 144 in Lecture Notes in Control and Information Sciences. Springer, 1990.

80

S. Gaubert. Introduction aux systèmes dynamiques à événements discrets. Polycopié de cours donné à l'ENSTA, 1992.

81

S. Gaubert. Théorie des systèmes linéaires dans les dioides. Thèse, École des Mines de Paris, July 1992.

82

S. Gaubert. Performance evaluation of timed automata. Rapport de recherche 1922, INRIA, May 1993.

83

S. Gaubert. Symbolic computation of periodic throughputs of timed event graphs. In Proceedings of the Belgian-French-Netherlands Summer School on Discrete Event systems, Spa, June 1993.

84

S. Gaubert. Timed automata and discrete event systems. In Proceedings of the ECC93, Groningen, July 1993.

85

S. Gaubert. On rational series in one variable over certain dioids. Rapport de recherche 2162, INRIA, Jan. 1994.

86

S. Gaubert. On semigroups of matrices in the algebra. Rapport de recherche 2172, INRIA, Jan. 1994. Revised version to appear in Semigroup Forum, 1996.

87

S. Gaubert. Rational series over dioids and discrete event systems. In Proc. of the 11th Conf. on Anal. and Opt. of Systems: Discrete Event Systems, number 199 in Lect. Notes. in Control and Inf. Sci, Sophia Antipolis, June 1994. Springer.

88

S. Gaubert. Performance evaluation of (max,+) automata. IEEE Trans. on Automatic Control, 40(12), Dec 1995.

89

S. Gaubert. Resource optimization and (min,+) spectral theory. IEEE Trans. on Automatic Control, 40(11), Nov. 1995.

90

S. Gaubert and C. Klimann. Rational computation in dioid algebra and its application to performance evaluation of discrete event systems. In G. Jacob and F. Lamnabhi-Lagarrigue, editors, Algebraic computing in control, number 165 in Lecture Notes in Control and Inf. Sci. Springer, 1991.

91

S. Gaubert and J. Mairesse. Task resource systems and (max,+) automata. In J. Gunawardena, editor, Idempotency, Publications of the Newton Institute. Cambridge University Press, March 1995. to appear in 1996.

92

B. Gaujal. Parallélisme et simulation des systèmes à événements discrets. Thèse, Université de Nice - Sophia Antipolis, Juin 1994.

93

P. Glasserman and D. Yao. Monotone Structures in Discrete Event Systems. Wiley, 1994.

94

P. Gohon. Automates de coût borné sur un alphabet à une lettre. RAIRO Informatique Théorique, 19:351-357, 1985.

95

J.S. Golan. The theory of semirings with applications in mathematics and theoretical computer science, volume 54. Longman Sci & Tech., 1992.

96

J. Goldstine, H. Leung, and D. Wotschke. On the relation between ambiguity and nondeterminism in finite automata. Inform. and Comput., 100:261-270, 1992.

97

M. Gondran. Algèbre linéaire et cheminement dans un graphe. R.A.I.R.O., V1:77-99, 1975. (Note EDF 1973).

98

M. Gondran. Les problèmes de ratio minimum en optimisation combinatoire. Note EDF, HI/3433-02, 1980.

99

M. Gondran and M. Minoux. Valeurs propres et vecteurs propres en théorie des graphes. In Problèmes combinatoires et théorie des graphes, number 260 in Colloques internationaux CNRS, Orsay, 1976.

100

M. Gondran and M. Minoux. Valeurs propres et vecteurs propres dans les dioides et leur interprétation en théorie des graphes. EDF, Bulletin de la Direction des Etudes et Recherches, Serie C, Mathématiques Informatique, 2:25-41, 1977.

101

M. Gondran and M. Minoux. L'indépendance linéaire dans les dioides. E.D.F., Bulletin de la Direction des Etudes et recherches, Série C, Mathématiques, Informatique, 1:67-90, 1978.

102

M. Gondran and M. Minoux. Graphes et algorithmes. Eyrolles, Paris, 1979. Engl. transl. Graphs and Algorithms, Wiley, 1984.

103

M. Gondran and M. Minoux. Linear algebra in dioids: a survey of recent results. Annals of Discrete Mathematics, 19:147-164, 1984.

104

D.A. Gregory and N.J. Pullman. Semiring rank: boolean rank and nonnegative rank factorizations. J. Combin. Inform. System Sci., 8:223-233, 1983.

105

R.B. Griffiths. Frenkel-Kontorova models of commensurate-incommensurate phase transitions, volume VII of Fundamental Problems in Statistical Mechanics. 1991. editor or publisher (?) H van Beijeren.

106

J. Gunawardena. Min-max functions. Discrete Event Dynamic Systems, 4:377-406, 1994.

107

J. Gunawardena, editor. Idempotency. Publications of the Newton Institute. Cambridge University Press, 1996. to appear.

108

K. Hashiguchi. Improved limitedness theorems on finite automata with distance functions. Rapport de Recherche 86-72, Université de Paris 7, LITP, 11-1986.

109

K. Hashiguchi. Limitedness theorem on finite automata with distance functions. J. Comput. System Sci., 24(2):233-244, 1982.

110

K. Hashiguchi. Algorithms for determining relative star height. Information and Control, 78:124-169, 1988.

111

K. Hashiguchi. Improved limitedness theorems on finite automata with distance functions. Theoret. Comput. Sci., 72:27-38, 1990.

112

Gábor Heged2!dus. Az extremális sajátvektorok meghatározása eliminációs módszerrel - az általánosított Warshall algorithmus egy javítása. Alkalmazott Matematikai Lapok, 11:399-408, 1985.

113

S. Helbig. Optimization problems on extremal algebras: necessary and sufficient conditions for optimal points. In B. Borowski and F. Deutsch, editors, Parametric optimization and approximation, pages 166-184, Basel, Switzerland, 1985. Birkhäuser-Verlag.

114

F.E. Hohn and L.R. Schissler. Boolean matrices and combinatorial cicuit design. Bell Syst. Tech. J., 34:177-202, 1955.

115

F.E. Hohn, S. Seshu, and D.D. Aufenkamp. The theory of nets. I.R.E. Trans. on Electronic Comput., EC-6:154-161, 1957.

116

J.H. Weinert J. Hanumanthachari, K. Venu Raju. Some results on partially ordered semirings and semigroups. In Algebra and Order (Luminy-Marseille 1984), volume 14 of R & E. Res. Exp. Math, pages 313-322. Heldermann, Berlin, 1986.

117

K.H. Kim and F. Roush. Generalized fuzzy matrices. Fuzzy sets and systems, 4:293-315, 1980.

118

K.H. Kim and F.W. Roush. Fuzzy matrix theory. In Analysis of fuzzy information, volume I, pages 107-129. CRC, Boca Raton, Fla, 1987.

119

V. Kolokoltsov. Linear additive and homogenears operators. In Idempotent analysis, volume 13 of Adv. in Sov. Math. AMS, RI, 1992.

120

V. Kolokoltsov and V Maslov. Idempotent analysis and applications. Kluwer Acad. Publisher. to appear.

121

V. Kolokoltsov and V. Maslov. Idempotent calculus as the apparatus of optimization theory, i and ii. Funktsional. Anal. i Prilozhen., 23(1 and 4), 1989. Engl. transl. in Functional Anal Appl, 23, 1989.

122

D. Krob. Quelques exemples de séries formelles utilisées en algèbre non commutative. Rapport de recherche 90-2, Université de Paris 7, LITP, Jan. 1990.

123

D. Krob. Complete systems of -rational identities. Theor. Comp. Sci., 89, 1991.

124

D. Krob. The equality problem for rational series with multiplicities in the tropical semiring is undecidable. Rapport de recherche, Université de Paris 7, LITP, 1992.

125

D. Krob. Some consequences of a Fatou property of the tropical semiring. Rapport de recherche, Université de Paris 7, LITP, 1992.

126

D. Krob. The equality problem for rational series with multiplicities in the tropical semiring is undecidable. Int. J. of Algebra and Comput., 3, 1993.

127

D. Krob. Some consequences of a Fatou property of the tropical semiring. J. of Pure and Applied Algebra, 93:231-249, 1994.

128

D. Krob and A. Bonnier-Rigny. A complete system of identities for one letter rational expressions with multiplicities in the tropical semiring. J. Pure Appl. Algebra, 134:27-50, 1994.

129

J. Kuntzmann. Théorie des réseaux. Graphes. Dunod, Paris, 1972.

130

L. Lawler. Optimal cycles in doubly weighted directed graphs. In Journées internationales d'étude sur la théorie des graphes, pages 209-213, Rome, 1966.

131

A. Leizarowitz. Infinite horizon autonomous systems with unbounded cost. Appl. Math. Optim., 13:19-43, 1985.

132

H. Leung. On the topological structure of a finitely generated semigroup of matrices. Semigroup Forum, 37:273-287, 1988.

133

H. Leung. Limitedness theorem on finite automata with distance function: an algebraic proof. Theoret. Comput. Sci, 81:137-145, 1991.

134

H. Leung. On some decision problems in finite automata. In J. Rhodes, editor, Monoids and Semigroups with Applications, pages 509-526. World Scientific, Singapore, 1991.

135

H. Leung. A note on finitely ambiguous distance automata. Information Processing Letters, 44:329-331, 1992.

136

H. Leung. On finite automata with limited nondeterminism. In Proc. MFCS 1992, number 629 in Lect. Notes Comput. Sci. Springer, 1992.

137

G. Litvinov and V. Maslov. Correspondence principle for idempotent calculus and some computer applications. Report IHES/M/95/33, IHES, Bures-sur-Yvette, France, April 1995.

138

G.L. Litvinov, V.P. Maslov, and A. Ya. Rodionov. Unifying approach to software and hardware design for scientific calculations. Prepring ihes, Bures sur Yvette, 1995.

139

R.D. Luce. A note on boolean matrix theory. Proc Amer. Math. Soc., 3:382-388, 1952.

140

A.G. Lunts. The application of boolean matrix algebra to the analysis and synthesis of relay contact networks(russian). Dokl. Akad. Nauk SSSR, 70:421-423, 1950.

141

J. Mairesse. Rapport de DEA: Graphes d'événements stochastiques et régimes stationnaires multiples. INRIA, 1992.

142

J. Mairesse. A graphical representation of matrices in the (max,+) algebra. Rapport de Recherche 2078, INRIA, Nov. 1993.

143

J. Mairesse. Products of irreducible random matrices in the (max,+) algebra. Rapport de Recherche 1939, INRIA, June 1993. To appear in Adv. Applied Prob.

144

J. Mairesse. A graphical approach of the spectral theory in the (max,+) algebra. IEEE Trans. Automatic Control, 40(10), 1995.

145

J. Mairesse. Stabilité des systèmes à événements discrets stochastiques. Approche algébrique. Thèse, École Polytechnique, June 1995.

146

J.P. Mascle. Torsion matrix semigroups and recognizable transductions. In L. Kott, editor, Automata, Languages and Programming, Lecture notes in Computer Sciences, pages 244-253, 1986.

147

V. Maslov and V. Kolokoltsov. Idempotent analysis and its applications to optimal control theory. Nauka, Moskow, 1994. In russian.

148

V. Maslov and S. Samborskii, editors. Idempotent analysis, volume 13 of Adv. in Sov. Math. AMS, RI, 1992.

149

V.P. Maslov. Méthodes Operatorielles. Mir, Moscou, 1973. trad. fr. 1987.

150

presented by J.P. Quadrat Max-Plus Working Group. Max-plus algebra and applications to system theory and optimal control. In Proceedings of the ICM, Zurich, August 1994.

151

L. McKenzie. Turnpike theory. Econometrica, 44(5):841-866.

152

E. Minieka. On computing sets of shorstest paths in a graph. Communications A.C.M., 17(6):351-353, 1974.

153

E. Minieka and D.R. Shier. A note on an algebra for the best routes in a network. J. Inst. Math. Appl., 11:145-149, 1973.

154

P. Moller. Théorème de Cayley-Hamilton dans les dioides et application à l'étude des systèmes à événements discrets. In 7th INRIA International Conference on Analysis and Optimization of Systems, Antibe,France, 1986. Springer.

155

P. Moller. Notions de rang dans les dioides vectoriels. In CNRS/CNET/INRIA Seminar: Algèbres Exotiques et Systèmes à Evénements Discrets, Issy-les-Moulineaux, France, 1987.

156

P. Moller. Théorie algébrique des Systèmes à Événements Discrets. Thèse, École des Mines de Paris, 1988.

157

A. Munier. Régime asymptotique optimal d'un graphe d'événements temporisé généralisé: application à un problème d'assemblage. APII, 27(5):487-513, 1993.

158

Roger D. Nussbaum. Convergence of iterates of a nonlinear operator arising in statistical mechanics. Nonlinearity, 4:1223 - 1240, 1991.

159

G. J. Olsder. Applications of the theory of stochastic discrete-event systems to array processors and scheduling in public transportation. In Proceedings of the 28-th Conference on Decision and Control. IEEE, 1989.

160

G.J. Olsder. On the characteristic equation and minimal realizations for discrete event dynamic systems. In A. Bensoussan and J.L. Lions, editors, Analysis and Optimizaton of Systems, number 83 in Lecture notes in Control and Information Sciences, pages 189-201. Springer, 1986.

161

G.J. Olsder. Some results on the minimal realization of discrete event systems. In 25th IEEE Conf. on Decision and Control, Athens, Greece, 1986.

162

G.J. Olsder and R.E. de Vries. On an analogy of minimal realizations in conventional and discrete-event dynamic systems. In Algebres Exotiques et Systèmes à Evénements Discrets: Sèminaire CNRS/CNET/INRIA, Issy les Moulineaux, France, Juin 1987.

163

G.J. Olsder, J.A.C. Resing, R.E. de Vries, M.S. Keane, and G. Hooghiemstra. Discrete event systems with stochastic processing times. In 27th IEEE Conf. on Decision and Control, Austin, Texas, 1988.

164

G.J. Olsder, J.A.C. Resing, R.E. de Vries, M.S. Keane, and G. Hooghiemstra. Discrete event systems with stochastic processing times. IEEE Transactions on Automatic Control, pages 299-302, 1990.

165

G.J. Olsder and C. Roos. Cramer and Cayley-Hamilton in the max-algebra. Linear Algebra and its Applications, 101:87-108, 1988.

166

V. Peteanu. An algebra of the optimal path in networks. Mathematica, 9(2):335-342, 1967.

167

J.-E. Pin. Finite semigroups and recognizable languages: an introduction. Technical Report 94.15, LITP, Laboratoire informatique théorique et programmation, Institut Blaise Pascal, 4, Place Jussieu, 75252 Paris, 1994.

168

R.J. Plemmons. Generalized inverses of boolean relation matrices. S.I.A.M. J. Appl. Math., 20(3):426-433, May 1971.

169

M. Plus. L'algèbre et sa symétrisation ou l'algèbre des équilibres. Comptes Rendus à l'Académie des Sciences, Section Automatique, 1990.

170

M. Plus. Linear systems in -algebra. In Proceedings of the 29th Conference on Decision and Control, Honolulu, Dec. 1990.

171

M. Plus. A linear system theory for systems subject to synchronization and saturation constraints. In Proceedings of the first European Control Conference, Grenoble, July 1991.

172

M. Plus. Second order theory of min-linear systems and its application to discrete event systems. In Proceedings of the 30th CDC, Brighton, Dec. 1991.

173

X. Qi and W. Chen. The minimal realization of discrete-event systems. In Proceedings of the 1991 IFAC Workshop on Discrete Event System Theory and applications in manufacturing and social phenonmena, Shenyang,China, June 1991.

174

J.P. Quadrat. Théorèmes asymptotiques en programmation dynamique. CRAS, 311:745-748, 1990.

175

I.V. Romanovskii. Optimization and stationary control of discrete deterministic process in dynamic programming. Kibernetika, 2:66-78, 1967. Engl. transl. in Cybernetics 3 (1967).

176

I.V. Romanovskii. Turnpike theorems for semi-markov decision processes. Trudy Mat. Inst. Steklov, 111:208-223, 1970. Engl. transl. in Proc. Steklov Inst. Math, 111, (1972).

177

G. Rote. A systolic array array for the algebraic path problem. Computing, 39:187-199, 1985.

178

M.A. Roytberg. Pareto-optimal alignments of symbol sequences. 1994.

179

S.N. Samborskii and A.A. Tarashchan. On semirings arising in multicriterion optimization problems and problems of analysis of computational media. Soviet Math. Dokl, 40(2), 1990.

180

D.R. Shier. A decomposition algorithm for optimality problems in tree structured networks. Discrete Maths., 6:175-189, 1973.

181

I. Simon. Limited subsets of the free monoid. In Proc. of the 19th Annual Symposium on Foundations of Computer Science, pages 143-150. IEEE, 1978.

182

I. Simon. Recognizable sets with multiplicities in the tropical semiring. Rapport de Recherche 88-46, Université de Paris 7, LITP, 1988.

183

I. Simon. Recognizable sets with multiplicities in the tropical semiring. In M.P. Chytil, L. Janiga, and V. Koubek, editors, Mathematical Foundations of Computer Science, volume 324 of Lecture notes Computer Science, pages 107-120. Springer, 1988.

184

I. Simon. On semigroups of matrices over the tropical semiring. Rapport de Recherche 89-72, Université de Paris 7, LITP, 1989.

185

I. Simon. The nondeterministic complexity of a finite automaton. In M. Lothaire, editor, Mots. Hermes, 1990.

186

I. Simon. On semigroups of matrices over the tropical semiring. Theor. Infor. and Appl., 28(3-4):277-294, 1994.

187

H. Straubing. A combinatorial proof of the Cayley-Hamilton theorem. Discrete Mathematics, 43:273-279, 1983.

188

I. Tomescu. Sur les méthodes matricielles dans la théorie des réseaux. C.R. Acad. Sci., 263:826-829, 1966.

189

I. Tomescu. Un algorithme pour la détermination de la plus petite distance entre les sommets d'un réseau. R.A.I.R.O., 5:133-139, 1967.

190

J.M. Vincent. Some ergodic results on stochastic iterative DEDS. Technical Report 4, Apache - IMAG, Grenoble, Dec. 1993. Submitted to JDEDS.

191

M. Viot. Cha^ines de Markov dans (r,min,+) et applications au contrôle. Exposé au séminaire Meval-Meta2, INRIA, 1992.

192

N.N. Vorobyev. Extremal algebra of positive matrices. Elektron. Informationsverarbeitung und Kybernetik, 3, 1967. in russian.

193

E. Wagneur. Moduloids and pseudomodules. 1. dimension theory. In J.L. Lions and A. Bensoussan, editors, Analysis and Optimization of Systems, Lecture notes in Control and Information Sciences, 1988.

194

E. Wagneur. Moduloids and pseudomodules. 3. the lattice structure problem. Rapport de recherche, GERAD,HEC, Montréal, Septembre 1989. Cahiers du GERAD.

195

E. Wagneur. Moduloids and pseudomodules. 1. dimension theory. Discrete Math., 98:57-73, 1991.

196

E. Wagneur. Subdirect sum decomposition of finite dimensional pseudomodules. In Proc. of the 11th Conf. on Anal. and Opt. of Systems: Discrete Event Systems, number 199 in Lect. Notes. in Control and Inf. Sci, Sophia Antipolis, June 1994. Springer.

197

S. Warshall. A theorem on boolean matrices. J. of A.C.M., 9:11-12, 1962.

198

A. Weber. On the valuedness of finite transducers. Acta Inform., 27:749-780, 1990.

199

A. Weber. Decomposing a -valued transducer into unambiguous ones. In Proc. LATIN 1992, number 583 in Lect. Notes Comput. Sci., pages 503-515. Springer, 1992. I1831.

200

A. Weber. Distance automata having large finite distance or finite ambiguity. Math. Systems Theory, 26:169-185, 1993.

201

A. Weber. Finite-valued distance automata. Theoretical Computer Science, 1993. to appear.

202

J.M.M. Wedderburn. Boolean linear associative algebra. Ann. Math., 35(1):185-194, 1934.

203

Chen Wende, Qi Xiangdong, and Deng Shuhui. The eigen-problem and period analysis of the discrete event systems. Systems Science and Mathematical Sciences, 3(3), August 1990.

204

P. Whittle. Optimization over Time. Wiley, 1986.

205

P. Whittle. Risk-sensitive Optimal Control. Wiley, 1990.

206

S. Yu. Yakovenko. On the concept of infinite extremal in stationary problems of dynamic optimization. Dokl, Akad. Nauk SSSR, 306(4):798-802, 1989. Engl. transl. in Sov. Math. Dokl. 40 (1990).

207

M. Yoeli. A note on a generalization of boolean matrix theory. Amer. Math. Monthly, 68:552-557, 1961.

208

K. Zimmermann. Extremáln´i Algebra. Ekonomický ùstav CSAV, Praha, 1976. (in Czech).

209

U. Zimmermann. Linear and Combinatorial Optimization in Ordered Algebraic Structures. North Holland, 1981.