Summary: [13] E. Emerson and C. Lei. Modalities for model­checking: Branching time logic strikes back.
In Proceedings of the 12th ACM Symposium on Principles of Programming Languages, pages
84--96, 1985.
[14] E. Emerson, A. Mok, A. Sistla, and J. Srinivasan. Quantitative temporal reasoning. In
E. Clarke and R. Kurshan, editors, Computer­Aided Verification, 2nd International Confer­
ence, CAV'90, Lecture Notes in Computer Science 531, pages 136--145, 1990.
[15] T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model­checking for real­time
systems. In Proceedings of the Seventh IEEE Symposium on Logic in Computer Science, pages
394--406, 1992.
[16] D. Lee and M. Yannakakis. Online minimization of transition systems. In Proceedings of ACM
Symposium of Theory of Computing, 1992.
[17] H. Lewis. A logic of concrete time intervals. In Proceedings of the Fifth IEEE Symposium on
Logic in Computer Science, pages 380--389, 1990.
[18] X. Nicollin, J. Sifakis, and S. Yovine. From ATP to timed graphs and hybrid systems. In Real­
Time: Theory in Practice, REX Workshop, Lecture Notes in Computer Science 600, pages
549--572. Springer­Verlag, 1991.
[19] K. –
Cer¯ans. Decidability of bisimulation equivalence for parallel timer processes. In Proceedings
of the Fourth Workshop on Computer­Aided Verifiction, Lecture Notes in Computer Science,
1992. To appear.

Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania

Collections: Computer Technologies and Information Sciences