P. A. Abdulla, K. Cerans, B. Jonsson, and T. Yih-kuen, General decidability theorems for innite-state systems, Proc. 11th IEEE Symp. Logic in Computer Science, 1996.

P. A. Abdulla and R. Mayr, Minimal Cost Reachability/Coverability in Priced Timed Petri Nets, LNCS, vol.24, issue.2, p.348363, 2009.
DOI : 10.1109/TCOM.1976.1093424

R. Alur, S. L. Torre, and G. J. Pappas, Optimal paths in weighted timed automata, LNCS, vol.2034, p.4962, 2001.

A. Annichini, A. Bouajjani, and M. Sighireanu, TReX: A Tool for Reachability Analysis of Complex Systems, LNCS, vol.2102, p.368372, 2001.
DOI : 10.1007/3-540-44585-4_34
URL : https://hal.archives-ouvertes.fr/hal-00110460

E. Balland, Y. Boichut, T. Genet, and P. Moreau, Towards an ecient implementation of tree automata completion, AMAST, p.6782, 2008.

S. Bardin, A. Finkel, J. Leroux, and L. Petrucci, FAST: acceleration from theory to practice, International Journal on Software Tools for Technology Transfer, vol.15, issue.2, p.401424, 2008.
DOI : 10.1007/s10009-008-0064-3
URL : https://hal.archives-ouvertes.fr/hal-00345968

N. Bertrand, . Ph, and . Schnoebelen, A Short Visit to the STS Hierarchy, Electronic Notes in Theoretical Computer Science, vol.154, issue.3, p.5969, 2006.
DOI : 10.1016/j.entcs.2006.05.007

Y. Boichut, R. Courbis, P. Héam, and O. Kouchnarenko, Finer Is Better: Abstraction Refinement for Rewriting Approximations, Rewriting Techniques and Application, RTA'08, p.4862, 2008.
DOI : 10.1007/978-3-540-70590-1_4
URL : https://hal.archives-ouvertes.fr/hal-00563422

Y. Boichut, T. Genet, T. Jensen, and L. L. Roux, Rewriting Approximations for Fast Prototyping of Static Analyzers, Proc. 17th RTA, Conf, p.4862, 2007.
DOI : 10.1007/978-3-540-73449-9_6
URL : https://hal.archives-ouvertes.fr/hal-00463418

Y. Boichut and P. Héam, A theoretical limit for safety verication techniques with regular x-point computations, Inf. Process. Lett, vol.108, issue.1, p.12, 2008.

B. Boigelot and P. Wolper, Representing arithmetic constraints with nite automata: An overview, LNCS, vol.2401, p.119, 2002.

P. Bouyer, . Th, V. Brihaye, J. Bruyère, and . Raskin, On the optimal reachability problem of weighted timed automata. Formal Methods in System Design, p.31135175, 2007.

A. L. Buchsbaum, R. Giancarlo, and J. Westbrook, An approximate determinization algorithm for weighted nite-state automata, Algorithmica, vol.30, issue.4, p.503526, 2001.

M. Droste and P. Gastin, Weighted automata and weighted logics, Theor. Comput. Sci, vol.380, issue.12, p.6986, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00772642

A. Farzan, C. Chen, J. Meseguer, and G. Rosu, Formal Analysis of Java Programs in JavaFAN, Proc. 16th CAV Conf, p.501505, 2004.
DOI : 10.1007/978-3-540-27813-9_46

A. Finkel, . Ph, and . Schnoebelen, Well-structured transition systems everywhere! TCS, p.6392, 2001.

S. Gaubert, Performance evaluation of (max,+) automata, IEEE Transactions on Automatic Control, vol.40, issue.12, p.40, 1995.
DOI : 10.1109/9.478227

T. Genet and F. Klay, Rewriting for Cryptographic Protocol Verication Pittsburgh (Pen., USA), volume 1831 of LNAI, Proc. 17th CADE Conf, 2000.

. Th and . Genet, Decidable approximations of sets of descendants and sets of normal forms, proceedings of RTA, 1998.

R. Gilleron and S. Tison, Regular tree languages and rewrite systems, Fundamenta Informaticae, vol.24, p.157175, 1995.
URL : https://hal.archives-ouvertes.fr/inria-00538882

S. Ginsburg and E. H. Spanier, Bounded regular sets, Proceedings of the, p.10431049, 1966.
DOI : 10.1090/S0002-9939-1966-0201310-3

K. Hashiguchi, K. Ishiguro, and S. Jimbo, DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA, International Journal of Algebra and Computation, vol.12, issue.03, 2002.
DOI : 10.1142/S0218196702000845

. A. Th, R. Henzinger, J. F. Majumdar, and . Raskin, A classication of symbolic transition systems, ACM Trans. Comput. Log, vol.6, issue.1, p.132, 2005.

K. Culik, I. , and P. C. Rosenberg, Generalized weighted nite automata based image compression, J. UCS, vol.5, issue.4, p.227242, 1999.

F. Katritzke, W. Merzenich, and M. Thomas, Enhancements of partitioning techniques for image compression using weighted finite automata, Theoretical Computer Science, vol.313, issue.1, pp.133-144, 2004.
DOI : 10.1016/j.tcs.2003.10.011

D. Kirsten and S. Lombardy, Deciding unambiguity and sequentiality of polynomially ambiguous min-plus automata, STACS, p.589600, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00360205

I. Klimann, S. Lombardy, J. Mairesse, and C. Prieur, Deciding unambiguity and sequentiality from a nitely ambiguous max-plus automaton, TCS, vol.327, issue.3, p.349373, 2004.

D. Krob, The Equality Problem for Rational Series with Multiplicities in the Tropical Semiring is Undecidable, IJAC, vol.4, issue.3, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00017729

K. Larsen and J. Rasmussen, Optimal reachability for multi-priced timed automata, Theor. Comput. Sci, vol.390, issue.2-3, p.197213, 2008.

J. Leroux, Structural Presburger digit vector automata, Theoretical Computer Science, vol.409, issue.3, p.549556, 2008.
DOI : 10.1016/j.tcs.2008.09.037
URL : https://hal.archives-ouvertes.fr/hal-00345971

S. Lombardy, Sequentialization and unambiguity of (max,+) rational series over one letter, Workshop on max-plus Algebras and Their Applications to Discrete-event Systems, TCS, and Optimization, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00620035

J. Meseguer and G. Rosu, Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools, Proc. 2nd IJCAR conf, p.144, 2004.
DOI : 10.1007/978-3-540-25984-8_1

M. Mohri, F. Pereira, and M. Riley, Weighted nite-state transducers in speech recognition, Computer Speech & Language, vol.16, issue.1, p.6988, 2002.

D. Tabakov and M. Y. Vardi, Experimental Evaluation of Classical Automata Constructions, LNCS, vol.3835, p.396411, 2005.
DOI : 10.1007/11591191_28

A. Weber, Finite-valued distance automata, Theoretical Computer Science, vol.134, issue.1, 1994.
DOI : 10.1016/0304-3975(94)90287-9
URL : http://doi.org/10.1016/0304-3975(94)90287-9