Course: CS284A Advanced Automata Theory

Winter 2007

• Instructor: Rupak Majumdar (Email: r u p a k@cs.ucla.edu)
• Lectures: Monday, Wednesday 4:00-5:30 Location 1354 Franz
• Office Hours: After class on Wednesdays

General Information

• Syllabus and contents. We shall study automata on infinite words and trees and their relationship to logic and computer-aided verification of systems. List of Topics
• Intended Audience. Computer science or math graduate students with background in logic and theory of computation. (Familiarity with CS181 will be assumed). Talk to the instructor if you are not sure if you have the background.
• Grading. Grading will be based on homework problems (to be assigned approximately biweekly), paper presentations, and a final project.
• Student Presentations. I shall list papers for student presentations. Here are the papers.
  • Nir Piterman. From nondeterministic Buchi and Streett automata to deterministic parity automata. LICS 06. Available from Nir's home page.
  • Qiqi Yan. Lower bounds for the complementation of omega-automata via the full automaton technique.
  • An application of monadic second order logics to data structure verification: Pointer assertion logic engine
  • Kupferman, Vardi, and Wolper. An automata theoretic approach to branching time model checking.
  • Timed games: Maler, Pnueli, and Sifakis. On the synthesis of discrete controllers for timed systems.
• Lecture Schedule
  • Lecture 1. Administration. Automata on finite words. Word models. Lecture Notes
    References:
    • W. Thomas. Languages, automata, and logic.
    • M. Sipser. Introduction to the theory of computation, 2nd Edition. Course Technology, 2005.
  • Lecture 2. Monadic second order logic on words. Buchi-Elgot Theorem. Lecture Notes
  • Lecture 3. Buchi automata and omega-regular languages. Decidability of S1S. Lecture Notes
    References:
    • W. Thomas. Automata on infinite objects. Handbook of Theoretical Computer Science, vol B. Elsevier.
    • M. Mukund. Finite state automata on infinite inputs.
    • O. Kupferman and M. Vardi. Weak alternating automata are not that weak. A second complementation construction.
  • Lecture 4. Different acceptance criteria. Complementation.
    Lecture Notes
  • Lecture 5. Towards Safra's construction.
  • Lecture 6. Safra's construction. Alternating Buchi automata and Miyano-Hayashi construction.
  • Lecture 7. Kupferman and Vardi's construction. Properties of runs of ACW.
  • Lecture 8. LTL as the first order fragment of S1S. LTL model checking and satisfiability through the tableau construction. LTL -> ABW -> NBW.
    Moshe Vardi, An automata theoretic approach to linear temporal logic.
  • Lecture 9,10. Automata on infinite trees. Games on graphs.
    W. Zielonka. Infinite games on finitely colored graphs with applications to automata on infinite trees.
  • Lecture 11, 12. Parity games. Rabin's complementation theorem.
    Marcin Jurdzinski, Mike Paterson, and Uri Zwick. A Deterministic Subexponential Algorithm for Solving Parity Games. Proceedings of ACM-SIAM Symposium on Discrete Algorithms, SODA 2006.
  • Lecture 13,14. Muller tree automata to parity automata. Complementation. The mu-calculus. Mu-calculus model checking.
    Kupferman, Vardi, and Wolper. An automata theoretic approach to branching time model checking
    W. Thomas. On the synthesis of strategies in infinite games (gives the Muller to parity conversion, see also the Thomas survey mentioned above).

  ---

  The documents referenced in this page are included as a means to ensure easy access to scholarly and technical work for education purposes. Copyright and all rights therein are maintained by the authors or by other copyright holders. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright.