Alternating automata: Unifying truth and validity checking for temporal logics

This publication has 33 references indexed in Scilit:

• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
  Theoretical Computer Science, 1995
• Alternating automata and program verification
  Published by Springer Nature ,1995
• Model checking and modular verification
  ACM Transactions on Programming Languages and Systems, 1994
• A linear-time model-checking algorithm for the alternation-free modal mu-calculus
  Formal Methods in System Design, 1993
• Network Protocols and Tools to Help Produce Them
  Annual Review of Computer Science, 1987
• Automatic verification of finite-state concurrent systems using temporal logic specifications
  ACM Transactions on Programming Languages and Systems, 1986
• The complexity of propositional linear temporal logics
  Journal of the ACM, 1985
• Alternation
  Journal of the ACM, 1981
• On equations for regular languages, finite automata, and sequential networks
  Theoretical Computer Science, 1980
• Theories of automata on ω-tapes: A simplified approach
  Journal of Computer and System Sciences, 1974