Summary: [42] W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of
Theoretical Computer Science, volume B, pages 133--191. Elsevier Science Publishers,
1990.
[43] 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.
[44] M. Vardi. Verification of concurrent programs -- the automata­theoretic framework.
In Proceedings of the Second IEEE Symposium on Logic in Computer Science, pages
167--176, 1987.
[45] M. Vardi and P. Wolper. An automata­theoretic approach to automatic program
verification. In Proceedings of the First IEEE Symposium on Logic in Computer
Science, pages 332--344, 1986.
[46] P. Wolper. Temporal logic can be more expressive. Information and Control, 56:72--
99, 1983.
[47] P. Wolper, M. Vardi, and A. P. Sistla. Reasoning about infinite computation paths.
In Proceedings of the 24th IEEE Symposium on Foundations of Computer Science,
pages 185--194, 1983.
[48] H. Wong­Toi and G. Hoffmann. The control of dense real­time discrete event systems.
In Proceedings of the 30th IEEE Conference on Decision and Control, pages 1527--

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

Collections: Computer Technologies and Information Sciences