Reachability problems for products of matrices in semirings

International Journal of Algebra and Computation

Volumn 16, Issue 3, 2006, Pages 603-627

  Gaubert, Stéphane ^a   Katz, Ricardo D ^b  

^a INRIA   (France)

^b UNIVERSIDAD NACIONAL DE ROSARIO   (Argentina)

Author keywords

Matrix semigroups; Max plus algebra; Mortality; Orbit problem; Projective linear semigroups; Reachability; Reduction; Semigroup membership problem; Tropical semiring; Undecidability

Indexed keywords

EID: 33745599155     PISSN: 02181967     EISSN: None     Source Type: Journal    
DOI: 10.1142/S021819670600313X     Document Type: Article

References (48)

1. O. Bournez and M. Branicky, The mortality problem for matrices of low dimensions, Theory of Computing Systems 35(4) (2002) 433-448.
2. L. Babai, R. Beals, J.-Y. Cai, G. Ivanyos and E. M. Luks, Multiplicative equations over commuting matrices, in Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, Atlanta, GA, 1996 (ACM, New York, 1996), pp. 498-507.
3. F. Baccelli, G. Cohen, G. Olsder and J. Quadrat, Synchronization and Linearity (Wiley, 1992).
4. A. Benveniste, C. Jard and S. Gaubert, Algebraic techniques for timed systems, in Proceedings of CONCUR'98: Concurrency Theory, Nice, France, September 1998, Lecture Notes in Computer Sciences, Number 1466 (Springer, 1998), pp. 373-388.
5. V. D. Blondel (2002), personal communication.
6. J. Berstel and C. Reutenauer, Rational Series and their Languages (Springer, 1988).
7. V. D. Blondel and J. N. Tsitsiklis, When is a pair of matrices mortal? Inform. Process Lett. 63 (1997) 283-286.
8. V. D. Blondel and J. N. Tsitsiklis, A survey of computational complexity results in systems and control, Automatica 36 (2000) 1249-1274.
9. R. Cuninghame-Green, Minimax Algebra, Lecture notes in Economics and Mathematical Systems, Number 166 (Springer, 1979).
10. C. Choffrut, Contribution à l'étude de quelques familles remarquables de fonctions rationnelles. Thèse de doctorat d'état, Université Paris VII (1978).
11. C. Choffrut. Minimizing subsequential transducers, Theor. Comput. Sci. 292(1) (2003) 131-143.
12. J. Cassaigne and J. Karhumäki, Examples of undecidable problems for 2-generator matrix semigroups, Theoret. Comput. Sci. 204(1-2) (1998) 29-34.
13. J.-Y. Cai, R. J. Lipton and Y. Zalcstein, The complexity of the ABC problem. SIAM J. Comput. 29(6) (2000) 1878-1888, (electronic).
14. M. Davis, Y. Matijasevič and J. Robinson, Hilbert's tenth problem, diophantine equations: Positive aspects of a negative solution, in Proc. Symp. Pure Math., Number 28 (Amer. Math. Soc. Providence, RI, 1976), pp. 323-378.
15. S. Gaubert, Théorie des systèmes linéaires dans les dioïdes. Thèse, École des Mines de Paris (July 1992).
16. 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, Sophia Antipolis, June 1994, eds. G. Cohen and J. P. Quadrat Lecture Notes in Control and Information Sciences, Number 199 (Springer, 1994).
17. S. Gaubert, Performance evaluation of (max,+) automata, IEEE Trans. on Automatic Control 40(12) (1995) 2014-2025.
18. S. Gaubert, On the Burnside problem for semigroups of matrices in the (max,+) algebra, Semigroup Forum 52 (1996) 271-292.
19. S. Gaubert and R. Katz, Reachability and invariance problems in max-plus algebra, in Proceedings of the First Multidisciplinary International Symposium on Positive Systems: Theory and Applications (POSTA 2003), Roma, August 2003, eds. L. Benvenuti, A. De Santis and L. Farina, Lecture Notes on Control and Information Sciences, Number 294 (Springer, 2003), pp. 15-22.
20. S. Gaubert and J. Mairesse, Task resource systems and (max,+) automata, in Idempotency, ed. J. Gunawardena (Cambridge University Press, 1998), pp. 133-144.
21. S. Gaubert and J. Mairesse, Asymptotic analysis of heaps of pieces and application to timed petri nets, in Petri Nets and Performance Models (PNPM'99), Saragoza, Spain, Sep. 1999, eds. P. Buchholz and M. Silva (IEEE Computer Society Press, 1999), pp. 158-169.
22. S. Gaubert and J. Mairesse, Modeling and analysis of timed Petri nets using heaps of pieces, IEEE Trans. Automat. Control 44(4) (1999) 683-697.
23. M. Gondran and M. Minoux, Graphes, Dioïdes et semi-anneaux TEC &: DOC, Paris, 2002.
24. K. Hashiguchi, Limitedness theorem on finite automata with distance functions, J. Comput. System Sci. 24(2) (1982) 233-244.
25. K. Hashiguchi, Improved limitedness theorems on finite automata with distance functions, Theoret. Comput. Sci. 72 (1990) 27-38.
26. V. Halava, and T. Harju, Mortality in matrix semigroups, Amer. Math. Monthly 108(7) (2001) 649-653.
27. T. Harju and J. Karhumaki, Morphisms, in Handbook of Formal Languages, Vol. 1 eds. G. Rozenberg and A. Salomaa (Springer, Berlin, 1997), 439-510.
28. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation (Addison-Wesley, 1979).
29. 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 (1994) 27-50.
30. R. Kannan and R. Lipton, Polynomial-time algorithm for the orbit problem, J. ACM 33(4) (1986) 808-821.
31. V. N. Kolokoltsov and V. P. Maslov, Idempotent Analysis and Applications (Kluwer Acad. Publisher, 1997).
32. D. Krob, The equality problem for rational series with multiplicities in the tropical semiring is undecidable, Int. J. Algebra Comput 4(3) (1994) 405-425.
33. D. Krob, Some consequences of a Fatou property of the tropical semiring, J. Pure Appl. Algebra 93(3) (1994) 231-249.
34. G. Lallement, Semigroups and Combinatorial Applications (Wiley, 1979).
35. H. Leung, Limitedness theorem on finite automata with distance function: An algebraic proof. Theoret. Comput. Sci. 81 (1991) 137-145.
36. Z. Manna, Mathematical Theory of Computations (McGraw-Hill, 1974).
37. J. Mascle, Torsion matrix semigroups and recognizable transdactions, in Automata, Languages and Programming, ed. L. Kott, Lecture Notes in Computer Sciences, Number 226 (Springer, 1986), pp. 244-253.
38. Y. Matiyasevich, Hilbert's Tenth Problem (MIT Press, 1993).
39. M. Mohri, Finite-state transducers in language and speech processing, Comput. Linguist. 23(2) (1997) 269-311.
40. P. Moller, Théorie algébrique des systèmes à événements discrets. Thèse, École des Mines de Paris (1988).
41. Y. Matiyasevich and G. Séizergues, Decision problems for semi-thue systems with a few rules, in Proceedings LICS'96, Los Alamitos, CA, 1996 (IEEE Computer Society Press, 1996), pp. 523-531.
42. M. S. Paterson, Unsolvability in 3 × 3 matrices, Stud. Appl. Math. 49 (1970) 105-107.
43. J.-E. Pin, Tropical semirings, in Idempotency, ed. J. Gunawardena (Cambridge University Press, 1998), pp. 50-69.
44. I. Simon, Limited subsets of the free monoid, in Proc. of the 19th Annual Symposium on Foundations of Computer Science (IEEE, 1978), pp. 143-150.
45. I. Simon, Recognizable sets with multiplicities in the tropical semiring, in MFCS'88, eds. M. Chytil, L. Janiga and V. Koubek, Lecture notes in Computer Sciences, Number 324 (Springer, 1988), pp. 107-120.
46. I. Simon, The nondeterministic complexity of a finite automaton, in Mots-Mélange offert à M. P. Schutzenberger, ed. M. Lothaire (Hermes, Paris, 1990), pp. 384-400.
47. I. Simon, On semigroups of matrices over the tropical semiring, Theor. Inform. Appl. 28(3-4) (1994) 277-294.
48. R. P. Stanley, Enumerative Combinatorics, Vol. I (Cambridge University Press, 1998).