Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree

@inproceedings{Hafer1987ComputationTL,
  title={Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree},
  author={Thilo Hafer and Wolfgang Thomas},
  booktitle={ICALP},
  year={1987}
}
In this paper we study the expressive power of the full branching time logic CTL* (of Clarke, Emerson, Halpern and Sistla), by comparing it with fragments of monadic second-order lo~ic over the binary tree. We show that over binary tree models the system CTLhas the same expressive power as monadic second-order logic in which set quantification is restricted to infinite paths (in particular, the full strength of first-order logic is captured here by CTL*). This generalizes Mamp's theorem on the… CONTINUE READING

Citations

Publications citing this paper.

252 Citations

01020'88'95'03'11'19
Citations per Year
Semantic Scholar estimates that this publication has 252 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 21 REFERENCES

path loglc

  • W. Thomas, On chain logic
  • and first-order logic over infinite trees, 2nd…
  • 1987
1 Excerpt

An improved algorithm for the automatic verification of finite state systems using temporal logic

  • M. C. Browne
  • Ist IEEE Sympos. Logic in Computer Science,
  • 1986

Baumsprachen in der Loglk erster Stufe: Eine Charakterisierung durch regul~re AusdrUcke

  • U. Heuter
  • Schrlften zur Informatik und angewandten…
  • 1986
1 Excerpt

On the expressive completeness of CTL

  • Haler, Th.
  • Schriften zur Informatik und angewandten…
  • 1986
1 Excerpt

The glory of the past , Proc . Logics of Programs , New York , Lecture Notes in

  • 0. Lichtenstein, A. Pnuell, L. Zuck
  • Computer Science
  • 1985

Similar Papers

Loading similar papers…