Interpretation of the Full Computation Tree Logic CTL* on Sets of Infinite Sequences

Ulrich Nitsche. Interpretation of the Full Computation Tree Logic CTL* on Sets of Infinite Sequences. In Sergei I. Adian, Anil Nerode, editors, Logical Foundations of Computer Science, 4th International Symposium, LFCS 97, Yaroslavl, Russia, July 6-12, 1997, Proceedings. Volume 1234 of Lecture Notes in Computer Science, pages 276-282, Springer, 1997.

@inproceedings{Nitsche97,
  title = {Interpretation of the Full Computation Tree Logic CTL* on Sets of Infinite Sequences},
  author = {Ulrich Nitsche},
  year = {1997},
  tags = {logic},
  researchr = {https://researchr.org/publication/Nitsche97},
  cites = {0},
  citedby = {0},
  pages = {276-282},
  booktitle = {Logical Foundations of Computer Science, 4th International Symposium, LFCS 97, Yaroslavl, Russia, July 6-12, 1997, Proceedings},
  editor = {Sergei I. Adian and Anil Nerode},
  volume = {1234},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-63045-7},
}