On the expressiveness of real and integer arithmetic automata

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

Volumn 1443 LNCS, Issue , 1998, Pages 152-163

  Boigelot, Bernard ^a   Rassart, Stephane ^a   Wolper, Pierre ^a  

^a UNIVERSITY OF LIÈGE   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL ARITHMETIC; ENCODING (SYMBOLS); FINITE AUTOMATA; SIGNAL ENCODING;

COMPACT REPRESENTATION; DIMENSIONAL VECTORS; INFINITE WORD; INTEGER ARITHMETIC; INTEGER VECTORS; PRESBURGER ARITHMETIC; REAL VECTOR; RECOGNIZABLE SETS;

VECTORS;

EID: 84878538273     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055049     Document Type: Conference Paper

References (14)

1. R. Alur, C. Courcoubetis, N. Halbwachs, T. A. Henzinger, P. H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138(1):3-34, 1995.
2. R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, April 1994.
3. B. Boigelot, L. Bronne, and S. Rassart. An improved reachability analysis method for strongly linear hybrid systems. In Proc. CAV'97, volume 1254 of Lecture Notes in Computer Science, pages 167-177, Haifa, Israel, June 1997. Springer-Verlag.
4. A. Boudet and H. Comon. Diophantine equations, Presburger arithmetic and finite automata. In Proc. CAAP'96, volume 1059 of Lecture Notes in Computer Science, pages 30-43. Springer-Verlag. 1996.
5. V. Bruyère, G. Hansel, C. Michaux, and R. Villemaire. Logic and p-recognizable sets of integers. Bulletin of the Belgian Mathematical Society, 1(2):191-238, March 1994.
6. R. E. Bryant. Graph based algorithms for boolean function manipulation. IEEE Transactions on Computers, 35(8):677-691, 1986.
7. R. E. Bryant. Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys, 24(3):293-318, September 1992.
8. J. R. Biichi. Weak second-order arithmetic and finite automata. Zeitschrift Math. Logik und Grundlagen der Mathematik, 6:66-92, 1960.
9. J. R. Büchi. On a decision method in restricted second order arithmetic. In Proceedings of the International Congress on Logic, Method, and Philosophy of Science, pages 1-12, Stanford, CA, USA, 1962. Stanford University Press.
10. B. Boigelot and P. Wolper. Symbolic verification with periodic sets. In Proc. CAV'94, volume 818 of Lecture Notes in Computer Science, pages 55-67, Stanford, June 1994. Springer-Verlag.
11. A. Cobham. On the base-dependence of sets of numbers recognizable by finite automata. Mathematical Systems Theory, 3:186-192, 1969.
12. T. A. Henzinger. The theory of hybrid automata. In Proc. LICS'96, pages 278-292, New Brunswick, New Jersey, July 1996. IEEE Comp. Soc. Press.
13. A. L. Semenov. Presburgerness of predicates regular in two number systems. Siberian Mathematical Journal, 18:289-299, 1977.
14. l) is undecidable. Theoretical Computer Science, 106:337-349, 1992.