Don't care words with an application to the automata-based approach for real addition

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

Volumn 4144 LNCS, Issue , 2006, Pages 67-80

  Eisinger, Jochen ^a   Klaedtke, Felix ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION THEORY; FORMAL LANGUAGES; MATHEMATICAL MODELS; SET THEORY;

DECISION PROCEDURE; REAL ADDITION; SET REPRESENTATION; WORD LANGUAGES;

AUTOMATA THEORY;

EID: 33749869221     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817963_10     Document Type: Conference Paper

References (19)

1. S. BARDIN, A. FINKEL, J. LEROUX, AND L. PETRUCCI, FAST: Fast acceleration of symbolic transition systems, in CAV'03, LNCS 2725, pp. 118-121.
2. C. BARTZIS AND T. BULTAN, Widening arithmetic automata, in CAV'04, LNCS 3114, pp. 321-333.
3. B. BOIGELOT, L. BRONNE, AND S. RASSART, An improved reachability analysis method for strongly linear hybrid systems, in CAV'97, LNCS 1254, pp. 167-178.
4. B. BOIGELOT, F. HERBRETEAU, AND S. JODOGNE, Hybrid acceleration using real vector automata, in CAV'03, LNCS 2725, pp. 193-205.
5. B. BOIGELOT, S. JODOGNE, AND P. WOLPER, An effective decision procedure for linear arithmetic over the integers and reals, ACM ToCL, 6 (2005), pp. 614-633.
6. B. BOIGELOT AND L. LATOUR, Counting the solutions of Presburger equations without enumerating them, TCS, 313 (2004), pp. 17-29.
7. B. BOIGELOT, A. LEGAY, AND P. WOLPER, Omega-regular model checking, in TACAS'04, LNCS 2988, pp. 561-575.
8. J. BÜCHI, Weak second-order arithmetic and finite automata, Zeitschrift der mathematischen Logik und Grundlagen der Mathematik, 6 (1960), pp. 66-92.
9. _, On a decision method in restricted second order arithmetic, in Logic, Methodology and Philosophy of Science, Stanford University Press, 1962, pp. 1-11.
10. J. EISINGER AND F. KLAEDTKE, Don't care words with an application to the automata-based approach for real addition, Tech. Rep. 223, Institut für Informatik, Albert-Ludwigs-Universität Freiburg, 2006.
11. T. HENZINGER, The theory of hybrid automata, in LICS'96, pp. 278-292.
12. Y. HONG, P. A. BEEREL, J. R. BURGH, AND K. L. MCMILLAN, Safe BDD minimization using don't cares, in DAC'97, ACM Press, pp. 208-213.
13. J. E. HOPCROFT, An n log n algorithm for minimizing the states in a finite automaton, in Theory of Machines and Computations, 1971, pp. 189-196.
14. O. KUPFERMAN AND M. VARDI, Weak alternating automata are not that weak, ACM ToCL, 2 (2001), pp. 408-429.
15. LASH. The Liège Automata-based Symbolic Handler. http://www.montefiore.ulg.ac.be/~boigelot/research/lash/.
16. C. LÖDING, Efficient minimization of deterministic weak ω-automata, IPL, 79 (2001), pp. 105-109.
17. K. L. MCMILLAN, Symbolic Model Checking, Kluwer Academic Publishers, 1993.
18. L. STAIGER AND K. WAGNER, Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regulärer Folgenmengen, Elektronische Informationsverarbeitung und Kybernetik, 10 (1974), pp. 379-392.
19. T. YAVUZ-KAHVECI, C. BARTZIS, AND T. BULTAN, Action language verifier, extended, in CAV'05, LNCS 3576, pp. 413-417.