Summary: This article was processed using the L a T E X macro package with LLNCS style

The construction of R, the process encapsulating the timing information, is
not as efficient as it could be. Any method for making timing verification more
efficient, such as partial order reductions, could in principle be incorporated into
our current scheme.
We believe that our work will be useful in applications such as asynchronous
circuits and hardware software co­design, where abstract descriptions of systems
necessarily include timing information.
References
[AD94] R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer
Science, 126:183--235, 1994.
[AH96] R. Alur and T.A. Henzinger. Reactive modules. In Proceedings of the 11th
IEEE Symposium on Logic in Computer Science, 1996.
[AK96] R. Alur and R.P. Kurshan. Timing analysis in COSPAN. In Hybrid Systems
III, Lecture Notes in Computer Science. Springer­Verlag, 1996.
[AL91] M. Abadi and L. Lamport. An old­fashioned recipe for real time. In Real­
Time: Theory in Practice, REX Workshop, LNCS 600, pages 1--27. Springer­
Verlag, 1991.
[AL93] M. Abadi and L. Lamport. Composing specifications. ACM TOPLAS,

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

Collections: Computer Technologies and Information Sciences