Automata, tableaux, and temporal logics

This publication has 12 references indexed in Scilit:

• Deciding branching time logic
  Published by Association for Computing Machinery (ACM) ,1984
• Yet another process logic
  Published by Springer Nature ,1984
• Reasoning about infinite computation paths
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1983
• Using branching time temporal logic to synthesize synchronization skeletons
  Science of Computer Programming, 1982
• Propositional dynamic logic of looping and converse is elementarily decidable
  Information and Control, 1982
• Decision procedures and expressiveness in the temporal logic of branching time
  Published by Association for Computing Machinery (ACM) ,1982
• The modal logic of programs
  Published by Springer Nature ,1979
• Weak monadic second order theory of succesor is not elementary-recursive
  Lecture Notes in Mathematics, 1975
• The emptiness problem for automata on infinite trees
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1972
• Testing and generating infinite sequences by a finite automaton
  Information and Control, 1966