Weak alternating automata in isabelle/hol

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

Volumn 1869, Issue , 2000, Pages 424-441

  Merz, Stephan ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; FORMAL LOGIC;

ALTERNATING AUTOMATA; COMPLEMENTATION; ISABELLE; THEOREM PROVERS; TRANSLATION PROCEDURES;

THEOREM PROVING;

EID: 84949190923     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44659-1_26     Document Type: Conference Paper

References (12)

1. J. R. Buchi. On a decision method in restricted second-order arithmetics. In International Congress on Logic, Method and Philosophy of Science, pages 1-12. Stanford University Press, 1962.
2. Orna Kupferman and Moshe Y. Vardi. Weak alternating automata are not so weak. In 5th Israeli Symposium on Theory of Computing and Systems, pages 147-158. IEEE Press, 1997.
3. D. E. Muller, A. Saoudi, and P. E. Schupp. Alternating automata, the weak monadic theory of the tree and its complexity. In 13th ICALP, volume 226 of Lecture Notes in Computer Science, pages 275-283. Springer-Verlag, 1986.
4. D.E. Muller, A. Saoudi, and P.E. Schupp. Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time. In 3rd IEEE Symposium on Logic in Computer Science, pages 422-427. IEEE Press, 1988.
5. Shmuel Safra. On the complexity of u;-automata. In 29th IEEE Symposium on Foundations of Computer Science, pages 319-327. IEEE Press, 1988.
6. Klaus Schneider and Dirk W. Hoffmann. A HOL conversion for translating linear time temporal logic to u-automata. In Y. Bertot et al, editor, TPHOLs'99: 12th International Conference on Theorem Proving in Higher Order Logics, volume 1690 of Lecture Notes in Computer Science, pages 255-272, Nice, Prance, 1999. Springer-Verlag.
7. Wolfgang Thomas. Automata on infinite objects. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 133-194. Elsevier, Amsterdam, 1990.
8. Wolfgang Thomas. Languages, automata, and logic. In G. Rozenberg and A. Sa-lomaa, editors, Handbook of Formal Language Theory, volume 3, pages 389-455. Springer-Verlag, New York, 1997.
9. Wolfgang Thomas. Complementation of Biichi automata revisited. In J. Kar-humaki, editor, Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa, pages 109-122. Springer-Verlag, 2000.
10. Moshe Vardi. Verification of concurrent programs: The automata-theoretic framework. In Proceedings of the Second Symposium on Logic in Computer Science, pages 167-176. IEEE, June 1987.
11. Moshe Y. Vardi. Computer Science Today, volume 1000 of Lecture Notes in Computer Science, chapter Alternating Automata and Program Verification, pages 471-485. Springer-Verlag, 1995.
12. Markus Wenzel. Isar—a generic interpretative approach to readable formal proof documents. In Y. Bertot et al, editor, TPHOLs'99: 12th International Conference on Theorem Proving in Higher Order Logics, volume 1690 of Lecture Notes in Computer Science. Springer-Verlag, 1999.