A contribution to the determinization of max-plus automata

It is a well known fact that not all max-plus automata can be determinized, i.e. transformed into deterministic max-plus automata with the same behavior. A classical sequentialization procedure, extended in the literature to max-plus automata, succeeds in computing an equivalent deterministic max-plus automaton for important subclasses of max-plus automata. This procedure is based on the normalization of state vectors in order to detect and merge states which have similar future behavior. In this paper, a novel and weaker condition is proposed that still guarantees this property. This allows for a considerable improvement of the existing determinization procedure, because it terminates for a larger class of max-plus automata.

[1]  Guillermo A. Pérez,et al.  On delay and regret determinization of max-plus automata , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[2]  Jean-Louis Boimond,et al.  Supervisory control of (max,+) automata: extensions towards applications , 2015, Int. J. Control.

[3]  Orna Kupferman,et al.  Rigorous approximated determinization of weighted automata , 2013, Theor. Comput. Sci..

[4]  Jean Mairesse,et al.  Asymptotic analysis of heaps of pieces and application to timed Petri nets , 1999, Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331).

[5]  M. Droste,et al.  Handbook of Weighted Automata , 2009 .

[6]  Alexander E. Guterman,et al.  Tropical Polyhedra are Equivalent to mean Payoff Games , 2009, Int. J. Algebra Comput..

[7]  Amélioration de la procédure de déterminisation des automates (max , 2015 .

[8]  Daniel Krob.  The Equality Problem for Rational Series with Multiplicities in the Tropical Semiring is Undecidable , 1992, ICALP.

[9]  Jean Mairesse,et al.  Series which are both max-plus and min-plus rational are unambiguous , 2006, RAIRO Theor. Informatics Appl..

[10]  Pierre Guillon,et al.  Comparison of max-plus automata and joint spectral radius of tropical matrices , 2016, MFCS.

[11]  Jacques Sakarovitch,et al.  Conjugacy and Equivalence of Weighted Automata and Functional Transducers , 2006, CSR.

[12]  Miroslav Ciric,et al.  Bisimulations for weighted automata over an additively idempotent semiring , 2014, Theor. Comput. Sci..

[13]  Eric Goubault,et al.  Computing the Vertices of Tropical Polyhedra Using Directed Hypergraphs , 2009, Discrete & Computational Geometry.

[14]  S. Gaubert.  Performance evaluation of (max, +) automata , 1995, IEEE Trans. Autom. Control..

[15]  Mehryar Mohri,et al.  Finite-State Transducers in Language and Speech Processing , 1997, CL.

[16]  Daniel Kirsten,et al.  A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata , 2008, RAIRO Theor. Informatics Appl..

[17]  Jacques Sakarovitch,et al.  Elements of Automata Theory , 2009 .