Modalities for model checking: branching time logic strikes back

This publication has 28 references indexed in Scilit:

• Linear and branching structures in the semantics and logics of reactive systems
  Published by Springer Nature ,2005
• Automatic verification of finite-state concurrent systems using temporal logic specifications
  ACM Transactions on Programming Languages and Systems, 1986
• “Sometimes” and “not never” revisited
  Journal of the ACM, 1986
• The complexity of propositional linear temporal logics
  Journal of the ACM, 1985
• Deciding full branching time logic
  Information and Control, 1984
• Using branching time temporal logic to synthesize synchronization skeletons
  Science of Computer Programming, 1982
• Proving Liveness Properties of Concurrent Programs
  ACM Transactions on Programming Languages and Systems, 1982
• Propositional dynamic logic of looping and converse is elementarily decidable
  Information and Control, 1982
• Decidability of Second-Order Theories and Automata on Infinite Trees
  Transactions of the American Mathematical Society, 1969
• A note on reliable full-duplex transmission over half-duplex links
  Communications of the ACM, 1969