Decision procedures for inductive boolean functions based on alternating automata

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

Volumn 1855, Issue , 2000, Pages 170-185

  Ayari, Abdelwaheb ^a   Basin, David ^a   Klaedtke, Felix ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER AIDED ANALYSIS; FORESTRY;

ALTERNATING AUTOMATA; ALTERNATING TREE AUTOMATON; COMPLEXITY BOUNDS; DECISION PROCEDURE; PARAMETERIZED; TREE-STRUCTURED; WORD AUTOMATA;

AUTOMATA THEORY;

EID: 84944405628     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722167_16     Document Type: Conference Paper

References (17)

1. D. Basin and N. Klarlund. Automata based symbolic reasoning in hardware verification. The Journal of Formal Methods in Systems Design, 13(3):255-288, 1998.
2. J. Brzozowski and E. Leiss. On equations for regular languages, finite automata, and sequential networks. TCS, 10(1):19-35, 1980.
3. A. Chandra, D. Kozen, and L. Stockmeyer. Alternation. Journal of the ACM, 28(1):114-133, 1981.
4. F. Gécseg and M. Steinby. Tree Automata,. Akadémiai Kiadó, Budapest, 1984.
5. D. Giammarresi and A. Restivo. Two-dimensional languages. In A. Salomaa and G. Rozenberg, editors, Handbook of Formal Languages, volume 3, Beyond Words, chapter 4, pages 215-267. Springer-Verlag, 1997.
6. A. Gupta. Inductive Boolean Function Manipulation: A Hardware Verification Methodology for Automatic Induction. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, 1994.
7. A. Gupta and A. Fisher. Parametric circuit representation using inductive boolean functions. In CAV 93, volume 697 of LNCS, pages 15-28, 1993.
8. A. Gupta and A. Fisher. Representation and symbolic manipulation of linearly inductive boolean functions. In Proc. of the IEEE Internation Conference on Computer-Aided Design, pages 192-199. IEEE Computer Society, 1993.
9. A. Gupta and A. Fisher. Tradeoffs in canonical sequential representations. In Proc. of the International Conference on Computer Design, pages 111-116, 1994.
10. J. Henriksen, J. Jensen, M. Jorgensen, N. Klarlund, B. Paige, T. Rauhe, and A. Sandholm. Mona: Monadic second-order logic in practice. In TACS 95, volume 1019 of LNCS, pages 89-110, 1996.
11. J. Hopcroft and J. Ullman. Formal Languages and their Relation to Automata. Addison-Wesley, 1969.
12. T. Jiang and B. Ravikumar. A note on the space complexity of some decision problems for finite automata. IPL, 40(1):25-31, 1991.
13. F. Klaedtke. Induktive boolesche Funktionen, endliche Automaten und monadi- sche Logik zweiter Stufe. Master’s thesis, Institut fur Informatik, Albert-Ludwigs- Universitat, Freiburg i. Br., 2000. in German.
14. N. Klarlund. Mona & Fido: The logic-automaton connection in practice. In CSL 97, volume 1414 of LNCS, pages 311-326, 1998.
15. G. Slutzki. Alternating tree automata. TCS, 41(2-3):305-318, 1985.
16. F. Somenzi. CUDD: CU Decision Diagram Package, Release 2.3.0. Department of Electrical and Computer Engineering, University of Colorado at Boulder, 1998.
17. M. Vardi. An automata-theoretic approach to linear temporal logic. In Logics for Concurrency, volume 1043 of LNCS, pages 238-266, 1996.