An automata-theoretic approach to branching-time model checking (Extended abstract)

This publication has 26 references indexed in Scilit:

• Tree automata, mu-calculus and determinacy
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• A linear-time model-checking algorithm for the alternation-free modal mu-calculus
  Formal Methods in System Design, 1993
• Memory-efficient algorithms for the verification of temporal properties
  Formal Methods in System Design, 1992
• Temporal and Modal Logic
  Published by Elsevier ,1990
• The complexity of tree automata and logics of programs
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1988
• Automatic verification of finite-state concurrent systems using temporal logic specifications
  ACM Transactions on Programming Languages and Systems, 1986
• Automata, tableaux, and temporal logics
  Published by Springer Nature ,1985
• Deciding full branching time logic
  Information and Control, 1984
• Results on the propositional μ-calculus
  Theoretical Computer Science, 1983
• On the menbership problem for functional and multivalued dependencies in relational databases
  ACM Transactions on Database Systems, 1980