Summary: [10] O. Lichtenstein, A. Pnueli, and L. Zuck. The glory of the past. In Logics of Programs, LNCS
193. Springer­Verlag, 1985.
[11] X. Nicollin, J. Sifakis, and S. Yovine. From ATP to timed graphs and hybrid systems. In
Proc. of REX workshop ``Real­time: Theory in Practice'', LNCS 600. Springer­Verlag, 1991.
[12] S. Safra. On the complexity of !­automata. In Proc. of 29th IEEE Symp. on Foundations of
Computer Science, 1988.
[13] A. P. Sistla, M. Vardi, and P. Wolper. The complementation problem for B¨uchi automata with
applications to temporal logic. Theoretical Computer Science, 49, 1987.
[14] W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical
Computer Science, volume B. Elsevier Science Publishers, 1990.
[15] P. Wolper, M. Vardi, and A. P. Sistla. Reasoning about infinite computation paths. In Proc. of
the 24th IEEE Symp. on Foundations of Computer Science, 1983.
15

2DTA
2NTA
NTA
p
MITL
k

Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania
Henzinger, Thomas A. - Faculté Informatique et Communications, Ecole Polytechnique Fédérale de Lausanne

Collections: Computer Technologies and Information Sciences