Selected papers that cite this one
- Rajeev Alur, Thomas A. Henzinger, and Orna Kupferman. Alternating-time temporal logic. In 38th Annual Symposium on Foundations of Computer Science, pages 100-109, Miami Beach, Florida, 20-22 October 1997. IEEE.
- Girish Bhat, Rance Cleaveland, and Orna Grumberg. Efficient on-the-fly model checking for CTL*. In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 388-397, San Diego, California, 26-29 June 1995. IEEE Computer Society Press.
- Gérard Cécé, Alain Finkel, and S. Purushothaman Iyer. Unreliable channels are easier to verify than perfect channels. Information and Computation, 124(1):20-31, 10 January 1996.
- Thomas A. Henzinger, Xavier Nicollin, Joseph Sifakis, and Sergio Yovine. Symbolic model checking for real-time systems. Information and Computation, 111(2):193-244, June 1994.
- Michael Kaminski and Michael Tiomkin. Finite and circular path models for branching time logics. Journal of Logic and Computation, 1(1):71-82, July 1990.
- Orna Kupferman and Orna Grumberg. Buy one, get one free!!! Journal of Logic and Computation, 6(4):523-539, August 1996.
- Orna Kupferman and Amir Pnueli. Once and For All. In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 25-35, San Diego, California, 26-29 June 1995. IEEE Computer Society Press.
- Orna Kupferman, Shmuel Safra, and Moshe Y. Vardi. Relating word and tree automata. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, pages 322-332, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press.
- F. Laroussinie. About the expressive power of CTL combinators. Information Processing Letters, 54(6):343-345, 23 June 1995.
- Andrea Masini. 2-Sequent calculus: Intuitionism and natural deduction. Journal of Logic and Computation, 3(5):533-562, October 1993.
- William P. R. Mitchell. Expressiveness for highly nested expressions in linear temporal logic. Journal of Logic and Computation, 4(3):263-272, June 1994.
- Rocco De Nicola and Frits Vaandrager. Three logics for branching bisimulation. Journal of the ACM, 42(2):458-487, March 1995.
- Pierre-Yves Schobbens. Exceptions for algebraic specifications: on the meaning of ``but''. Science of Computer Programming, 20(1-2):73-111, April 1993.
- Alberto Zanardo and José Carmo. Ockhamist computational logic: Past-sensitive necessitation in CTL. Journal of Logic and Computation, 3(3):249-268, June 1993.