Automata representations for Concurrent METATEM

  • Authors:
  • A. Kellett;M. Fisher

  • Affiliations:
  • -;-

  • Venue:
  • TIME '97 Proceedings of the 4th International Workshop on Temporal Representation and Reasoning (TIME '97)
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

We extend our clausal resolution method for linear temporal logics to a branching-time framework. The branching-time temporal logics considered are computation tree logic (CTL), often regarded as the simplest useful logic of this class, and extended ...