Flat parametric counter automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4052 LNCS, Issue , 2006, Pages 577-588

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

^a VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING; COMPUTER SCIENCE; DIGITAL ARITHMETIC; FINITE AUTOMATA; GRAPH THEORY; PROBLEM SOLVING;

COUNTER AUTOMATA; FRAGMENTS; INTEGER ARITHMETIC;

AUTOMATA THEORY;

EID: 33746363862     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11787006_49     Document Type: Conference Paper

References (18)

1. A. Annichini, A. Bouajjani, and M.Sighireanu. Trex: A tool for reachability analysis of complex systems. In Proc.CAV, volume 2102 of LNCS, pages 368 - 372. Springer, 2001.
2. S. Bardin, A. Finkel, J. Leroux, and L. Petrucci. Fast: Fast accelereation of symbolic transition systems. In Proc. TACAS, volume 2725 of LNCS. Springer, 2004.
3. B. Boigelot. On iterating linear transformations over recognizable sets of integers. TCS, 309(2) :413-468, 2003.
4. H. Comon and V. Cottier. Flatness is not a weakness. In Proc. CSL, volume 1862 of LNCS, pages 262 - 276. Springer, 2000.
5. H. Comon and Y. Jurski. Multiple Counters Automata, Safety Analysis and Presburger Arithmetic. In Proc. CAV, volume 1427 of LNCS, pages 268 - 279. Springer, 1998.
6. A. Finkel and J. Leroux. How to compose presburger-accelerations: Applications to broadcast protocols. In Proc. FST&TCS, volume 2556 of LNCS, pages 145-156. Springer, 2002.
7. S. Ginsburg and E. H. Spanier. Semigroups, presburger formulas and languages. Pacific Journal of Mathematics, 16(2):285-296, 1966.
8. K. Gödel. Über formal unentschuldbare Sätze der Principia Mathematica und verwandter Systeme I. Monatshefte für Mathematik und Physik, 38:173 - 198, 1931.
9. D. Hubert. Mathematische problème. Vortrag, gehalten auf dem internationalen Mathematiker-Kongress zu Paris. In Nachrichten von der Königliche Gesellschaft der Wissenschaften zu Göttingen, pages 253-297, 1900.
10. O. H. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the Association for Computing Machinery, 25(1):116 - 133, January 1978.
11. O. H. Ibarra and Z. Dang. On the solvability of a class of diophantine equations and applications. Submitted, 2005.
12. Y. Matiyasevich. Enumerable sets are diophantine. Journal of Sovietic Mathematics, 11: 354 - 358, 1970.
13. Y. Matiyasevich. Personal communication, 2005.
14. M. Minsky. Computation: Finite and Infinite Machines. Prentice-Hall, 1967.
15. T. Pheidas and K. Zahidi. Undecidability of existential theories of rings and fields: A survey. Contemporary Mathematics, 270:49-106, 2000.
16. L. Pottier. Solutions minimales des systemes diophantiens lineaires: bornes et algorithmes. Technical Report 1292, INRIA Sophia Antipolis, 1990.
17. M. Presburger. Über die Vollstandigkeit eines gewissen Systems der Arithmetik. Comptes rendus du I Congrés des Pays Slaves, Warsaw 1929.
18. P. Wolper and B. Boigelot. Verifying systems with infinite but regular state spaces. In Proc. CAV, volume 1427 of LNCS, pages 88-97. Springer, 1998.