 
Summary: [22] J. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages, and Com
putation. AddisonWesley, 1979.
[23] F. Jahanian and A. Mok. Safety analysis of timing properties in realtime systems.
IEEE Transactions on Software Engineering, SE12(9):890904, 1986.
[24] F. Jahanian and A. Mok. A graphtheoretic approach for timing analysis and its
implementation. IEEE Transactions on Computers, C36(8):961975, 1987.
[25] R. Koymans. Specifying realtime properties with metric temporal logic. Journal of
RealTime Systems, 2:255299, 1990.
[26] D. Lehman, A. Pnueli, and J. Stavi. Impartiality, justice, and fairness: The ethics of
concurrent termination. In Automata, Languages and Programming: Proceedings of
the Ninth ICALP, Lecture Notes in Computer Science 115, pages 264277. Springer
Verlag, 1982.
[27] H. Lewis. Finitestate analysis of asynchronous circuits with bounded temporal un
certainty. Technical Report TR1589, Harvard University, 1989.
[28] H. Lewis. A logic of concrete time intervals. In Proceedings of the Fifth IEEE
Symposium on Logic in Computer Science, pages 380389, 1990.
[29] N. Lynch and H. Attiya. Using mappings to prove timing properties. In Proceedings of
the Ninth ACM Symposium on Principles of Distributed Computing, pages 265280,
1990.
[30] Z. Manna and A. Pnueli. The anchored version of the temporal framework. In Linear
