Flat parametric counter automata

Fundamenta Informaticae

Volumn 91, Issue 2, 2009, Pages 275-303

  Bozga, Marius ^a   Iosif, Radu ^a   Lakhnech, Yassine ^a  

^a VERIMAG   (France)

Author keywords

Counter machines; Diophantine systems; Reachability problems

Indexed keywords

DIGITAL ARITHMETIC; FORMAL LOGIC;

COMPUTATIONAL DEVICES; COUNTER MACHINES; DIOPHANTINE SYSTEM; HILBERT'S TENTH PROBLEM; PRESBURGER ARITHMETIC; REACHABILITY PROBLEM; REVERSAL-BOUNDED COUNTERS; SATISFIABILITY PROBLEMS;

AUTOMATA THEORY;

EID: 67651236917     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/FI-2009-0044     Document Type: Article

References (22)

1. Annichini, A., Bouajjani, A., M.Sighireanu: TreX: A Tool for Reachability Analysis of Complex Systems, Proc.CAV, 2102, Springer, 2001.
2. Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: FAST: Fast Accelereation of Symbolic Transition systems, Proc. TACAS, 2725, Springer, 2004.
3. Boigelot, B.: On Iterating Linear Transformations over Recognizable Sets of Integers, TCS, 309(2), 2003, 413-468.
4. Church, A.: An unsolvable problem of elementary number theory, American Journal of Mathematics, 58, 1936, 345 - 363.
5. Comon, H., Jurski, Y.: Multiple Counters Automata, Safety Analysis and Presburger Arithmetic, Proc. CAV, 1427, Springer, 1998.
6. Dasdan, A., Irani, S., Gupta, R. K.: Efficient Algorithms for Optimum Cycle Mean and Optimum Cost to Time Ratio Problems, Design Automation Conference, 1999.
7. Finkel, A., Leroux, J.: How to compose Presburger-accelerations: Applications to broadcast protocols, Proc. FST&TCS, 2556, Springer, 2002.
8. Ginsburg, S., Spanier, E. H.: Semigroups, Presburger Formulas and Languages, Pacific Journal of Mathematics, 16(2), 1966, 285-296.
9. Gödel, K.: Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I, Monatshefte für Mathematik und Physik, 38, 1931, 173 - 198.
10. Gurari, E. M., Ibarra, O. H.: Two-way Counter Machines and Diophantine Equations, Journal of the Association for Computing Machinery, 29(3), July 1982, 863-873.
11. Hilbert, D.: Mathematische Probleme. Vortrag, gehalten auf dem internationalen Mathematiker-Kongress zu Paris, Nachrichten von der Königliche Gesellschaft der Wissenschaften zu Göttingen, 1900.
12. Ibarra, O. H.: Reversal-Bounded Multicounter Machines and Their Decision Problems, Journal of the Association for Computing Machinery, 25(1), January 1978, 116 - 133.
13. Ibarra, O. H., Dang, Z.: On the Solvability of a Class of Diophantine Equations and Applications, Theoretical Computer Science, 352, 2006, 342 - 346.
14. Ibarra, O. H., Jiang, T., Tran, N., Wang, H.: New Decidability Results Concerning Two-way Counter Machines, SIAM J. Comput., 24(1), February 1995, 123-137.
15. Leroux, J., Sutre, G.: On flatness for 2-dimensional vector addition systems with states, Proc. CONCUR, 3170, Springer, 2004.
16. Matiyasevich, Y.: Enumerable Sets are Diophantine, Journal of Sovietic Mathematics, 11, 1970, 354 - 358.
17. Matiyasevich, Y.: Personal communication, 2005.
18. Minsky, M.: Computation: Finite and Infinite Machines, Prentice-Hall, 1967.
19. Pottier, L.: Solutions minimales des systemes diophantiens lineaires: bornes et algorithmes, Technical Report 1292, INRIA Sophia Antipolis, 1990.
20. Presburger, M.: Über die Vollstandigkeit eines gewissen Systems der Arithmetik, Comptes rendus du I Congrés des Pays Slaves, Warsaw 1929.
21. Rosser, B.: Extensions of some theorems of Gödel and Church, The Journal of Symbolic Logic, 1, 1936, 87 - 91.
22. Wolper, P., Boigelot, B.: Verifying Systems with Infinite but Regular State Spaces, Proc. CAV, 1427, Springer, 1998.