Decision Procedures and Expressiveness in the Temporal Logic of Branching Time

@article{Emerson1985DecisionPA,
  title={Decision Procedures and Expressiveness in the Temporal Logic of Branching Time},
  author={E. Allen Emerson and Joseph Y. Halpern},
  journal={J. Comput. Syst. Sci.},
  year={1985},
  volume={30},
  pages={1-24}
}
We consider the computation tree logic (CTL) proposed in (Set. Comput. Programming 1 (1982), 241-260) which extends the unified branching time logic (UB) of ("Proc. Ann. ACM Sympos. Principles of Programming Languages, 1981," pp. 164-176) by adding an until operator. It is established that CTL has the small model property by showing that any satisfiable CTL formulae is satisfiable in a small finite model obtained from the small "pseudomodel" resulting from the Fischer-Ladner quotient… CONTINUE READING

From This Paper

Topics from this paper.
16 Citations
24 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 24 references

PNUELI, The modal logic of programs, in "Int

  • A. Z. MANNA
  • Colloq. Automata Lang, and Programming,
  • 1979
Highly Influential
6 Excerpts

HALPERN, "Sometimes" and "Not Never" revisited: On branching versus linear time, in "Proc

  • J.Y.E.A. EMERSON
  • Ann. ACM Sympos. Principles of Programming…
  • 1983
2 Excerpts

Prepositional dynamic logic of regular programs

  • M. J. FISCHER AND R. E. LADNER
  • J . Comput . System Sci .
  • 1983

CLARKE , Characterizing correctness properties of parallel programs as fixpoints

  • M. E.A.EMERSONANDE.
  • Automata Lang , and Programming
  • 1982

PNUELI , The temporal logic of branching time

  • Z. MANNA M. BEN-ARI, A. AND
  • Ann . ACM Sympos . Principles of Programming…
  • 1982

EMERSON, "Alternative Semantics for Temporal Logics," Tech. Report TR-182

  • E A.
  • Univ. of Texas,
  • 1981

Similar Papers

Loading similar papers…