Experimental evaluation of classical automata constructions

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

Volumn 3835 LNAI, Issue , 2005, Pages 396-411

  Tabakov, Deian ^a   Vardi, Moshe Y ^a  

^a Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA CONSTRUCTIONS; DFA; NFA;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; PERFORMANCE; PROBABILISTIC LOGICS; PROBLEM SOLVING;

AUTOMATA THEORY;

EID: 33745436387     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11591191_28     Document Type: Conference Paper

References (41)

1. Y. Abarbanel, I. Beer, L. Gluhovsky, S. Keidar, and Y. Wolfstal. FoCs - automatic generation of simulation checkers from formal specifications. In CAV, Proc. 12th International Conference, volume 1855 of LNCS, pages 538-542. Springer-Verlag, 2000.
2. D. Achlioptas. Setting two variables at a time yields a new lower bound for random 3-SAT. In Proc. of 32nd Annual ACM Symposium on Theory of Computing, 2000.
3. A. San Miguel Aguirre and M. Y. Vardi. Random 3-SAT and BDDs: The plot thickens further. In Principles and Practice of Constraint Programming, pages 121-136, 2001.
4. R. Armoni, L. Fix, A. Flaisher, R. Gerth, B. Ginsburg, T. Kanza, A. Landver, S. Mador-Haim, E. Singerman, A. Tiemeyer, M.Y. Vardi, and Y. Zbar. The ForSpec temporal logic: A new temporal property-specification logic. In Proc. 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 2280 of LNCS, pages 296-211, Grenoble, France, April 2002. Springer-Verlag.
5. D. Beatty and R. Bryant. Formally verifying a microprocessor using a simulation methodology. In Proc. 31st Design Automation Conference, pages 596-602. IEEE Computer Society, 1994.
6. I. Beer, S. Ben-David, C. Eisner, D. Fisman, A. Gringauze, and Y. Rodeh. The temporal logic sugar. In Proc. 13th International Conference on Computer Aided Verification, volume 2102 of LNCS, pages 363-367, Paris, France, July 2001. Springer-Verlag.
7. B. Bollobas. Random Graphs. Cambridge University Press, January 2001.
8. R.E. Bryant. Graph-based algorithms for boolean-function manipulation. IEEE Trans. on Computers, C-35(8), 1986.
9. R.E. Bryant. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, 1992.
10. J. A. Brzozowski. Canonical regular expressions and minimal state graphs for definite events. In Mathematical theory of Automata, pages 529-561. Polytechnic Press, Polytechnic Institute of Brooklyn, N.Y., 1962. Volume 12 of MRI Symposia Series.
11. J. R. Burch, E. M. Clarke, and D. E. Long. Symbolic model checking with partitioned transition relations. In Proc. IFIP TC10/WG 10.5 International Conference on Very Large Scale Integration, pages 49-58, 1991.
12. 20 states and beyond. Information and Computation, 98(2):142-170, June 1992.
13. Cadence. SMV. http://www.cadence.com/company/cadence-labs_research.html.
14. P. Cheeseman, B. Kanefsky, and W. M. Taylor. Where the really hard problems are. In IJCAI '91, pages 331-337, 1991.
15. A. Cimatti, E. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore, M. Roveri, R. Sebastiani, and A. Tacchella. NuSMV Version 2: An OpenSource Tool for Symbolic Model Checking. In Proc. International Conference on Computer-Aided Verification (CAV 2002), volume 2404 of LNCS, Copenhagen, Denmark, July 2002. Springer.
16. A. Cimatti, E. M. Clarke, F. Giunchiglia, and M. Roveri. NUSMV: A new symbolic model checker. International Journal on Software Tools for Technology Transfer, 2(4):410-425, 2000.
17. E.M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
18. Olivier Dubois, Yacine Boufkhad, and Jacques Mandler. Typical random 3-SAT formulae and the satisfiability threshold. In SODA, pages 126-127, 2000.
19. E. Friedgut. Necessary and sufficient conditions for sharp thresholds of graph properties, and the k-SAT problem. Journal of the A.M.S., 12:1017-1054, 1999.
20. James Glenn and William I. Gasarch. Implementing WSlS via finite automata: Performance issues. In Workshop on Implementing Automata, pages 75-86, 1997.
21. D. Gries. Describing an algorithm by Hopcroft. Acta Informatica, 2:97-109, 1973.
22. G.D. Hachtel and F. Somenzi. Logic Synthesis and Verification Algorithms. Kluwer Academic Publishers, Norwell, Massachusetts, 1996.
23. J. E. Hopcroft. An n log n algorithm for minimizing the states in a finite automaton. In Z. Kohavi, editor, The Theory of Machines and Computations, pages 189-196. Academic Press, 1971.
24. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
25. D. A. Huffman. The synthesis of sequential switching circuits. In E. F. Moore, editor, Sequential Machines: Selected Papers. Addison-Wesley, 1964.
26. R. M. Karp. The transitive closure of a random digraph. Random Struct. Algorithms, 1(1):73-94, 1990.
27. A. M. C. A. Koster, H. L. Bodlaender, and C. P. M. van Hoesel. Treewidth: Computational experiments. ZIB-Report 01-38, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Berlin, Germany, 2001. Also available as technical report UU-CS-2001-49 (Utrecht University) and research memorandum 02/001 (Universiteit Maastricht).
28. O. Kupferman and M.Y. Vardi. Model checking of safety properties. Formal methods in System Design, 19(3):291-314, November 2001.
29. O. Kupferman and M.Y. Vardi. Weak alternating automata are not that weak. ACM Trans. on Computational Logic, 2001 (2):408-429, July 2001.
30. D. Lee and M. Yannakakis. Online minimization of transition systems. In Proc. 24th ACM Symp. on Theory of Computing, pages 264-274, Victoria, May 1992.
31. P. Linz. An introduction to formal languages and automata. D. C. Heath and Company, Lexington, MA, USA, 1990.
32. A. Møller. dk.brics.automaton, http://www.brics.dk/automaton/, 2004.
33. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
34. A.R. Meyer and M. J. Fischer. Economy of description by automata, grammars, and formal systems. In Proc. 12th IEEE Symp. on Switching and Automata Theory, pages 188-191, 1971.
35. A.R. Meyer and L.J. Stockmeyer. The equivalence problem for regular expressions with squaring requires exponential time. In Proc. 13th IEEE Symp. on Switching and Automata Theory, pages 125-129, 1972.
36. G. Pan and M.Y. Vardi. Search vs. symbolic techniques in satisfiability solving. In SAT 2004, LNCS, Aalborg, May 2004. Springer-Verlag.
37. Bart Selman, David G. Mitchell, and Hector J. Levesque. Generating hard satisfiability problems. Artificial Intelligence, 81(1-2):17-29, 1996.
38. R. E. Tarjan and M. Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput., 13(3):566-579, 1984.
39. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. 1st Symp. on Logic in Computer Science, pages 332-344, Cambridge, June 1986.
40. B. W. Watson. A taxonomy of finite automata minimization algorithmes. Computing Science Note 93/44, Eindhoven University of Technology, The Netherlands, 1993.
41. B. W. Watson. Taxonomies and Toolkits of Regular Language Algorithms. PhD thesis, Eindhoven University of Technology, the Netherlands, 1995.