Rajeev Alur: Publications

List of Publications

Most of the papers available from this document appear in print, and the corresponding copyright is held by the publisher. While the papers can be used for personal use, redistribution or reprinting for commercial purposes is prohibited.

Reactive Systems

R. Alur and T.A. Henzinger. Modularity for timed and hybrid systems. Proceedings of the Ninth International Conference on Concurrency Theory, LNCS 1243, pp. 74--88, 1997. Abstract. Full paper.
R. Alur and T.A. Henzinger. Reactive modules. Proceedings of the 11th IEEE Symposium on Logic in Computer Science, pp. 207-218, 1996. Abstract. Full paper.
R. Alur and T.A. Henzinger. Local liveness for compositional modeling of fair reactive systems. Proceedings of the Seventh International Conference on Computer-aided Verification, LNCS 939, pp. 166-179, 1995. Abstract. Full paper.
R. Alur and T.A. Henzinger. Real-Time System = Discrete System + Clock Variables. In Theories and Experiences for Real-Time System Development, AMAST Series in Computing, pp. 1-30, 1994. Abstract. Full paper.
R. Alur and T.A. Henzinger. Finitary fairness. Proceedings of the Ninth IEEE Symposium on Logic in Computer Science, pp. 52-61, 1994. Abstract. Full paper.

Timed Automata

R. Alur and D.L. Dill. Automata-theoretic verification of real-time systems. In Formal Methods for Real-Time Computing, Trends in Software Series, John Wiley & Sons Publishers, pp. 55-82, 1996. Abstract. Full paper.
R. Alur, L. Fix, T.A. Henzinger. Event-clock automata: A determinizable class of timed automata. Proceedings of the Sixth Conference on Computer-Aided Verification, LNCS 818, pp. 11-13, 1994 (to appear in Theoretical Computer Science). Abstract. Full paper.
R. Alur, C. Courcoubetis, T.A. Henzinger. The observational power of clocks. Proceedings of the Fifth Conference on Concurrency Theory, LNCS 836, pp. 162-177, 1994. Abstract. Full paper.
R. Alur, C. Courcoubetis, T.A. Henzinger. Computing accumulated delays in real-time systems. Proceedings of the Fifth Conference on Computer-Aided Verification, LNCS 697, pp. 181-193, 1993 (to appear in Formal Methods in System Design). Abstract. Full paper.
R. Alur, T.A. Henzinger, M.Y. Vardi. Parametric real-time reasoning. Proceedings of the 25th ACM Symposium on Theory of Computing, pp. 592-601, 1993. Abstract. Full paper.
R. Alur, C. Courcoubetis, D.L. Dill, N. Halbwachs, H. Wong-Toi. Minimization of timed transition systems. Proceedings of the Third Conference on Concurrency Theory, LNCS 630, pp. 340-354, 1992. Full paper.
R. Alur and T.A. Henzinger. Back to the future: Towards a theory of timed regular languages. Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, pp. 177-186, 1992. Abstract. Full paper.
R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science 126:183-235, 1994 (preliminary versions appeared in Proc. 17th ICALP, LNCS 443, 1990, and Real Time: Theory in Practice, LNCS 600, 1991). Abstract. Full paper.

Timing Verification: Tools and Case-studies

R. Alur, L.J. Jagadeesan, J.J. Kott, and J.E. Von Olnhausen. Model-checking of real-time systems: a telecommunications application. Proceedings of the International Conference on Software Engineering, 1997. Abstract. Full paper.
S. Tasiran, R. Alur, R.P. Kurshan, and R.K. Brayton. Verifying abstractions of timed systems. Proceedings of the Seventh Conference on Concurrency Theory, LNCS 1119, 1996. Abstract. Full paper.
R. Alur and R.P. Kurshan. Timing analysis in COSPAN. Hybrid Systems III: Verification and Control, LNCS 1066, pp. 220-231, 1996. Abstract. Full paper.
R. Alur, C. Courcoubetis, D.L. Dill, N. Halbwachs, H. Wong-Toi. An implementation of three algorithms for timing verification based on automata emptiness. Proceedings of the 13th IEEE Real-Time Systems Symposium, pp. 157-166, 1992. Full paper.
R. Alur, A. Itai, R.P. Kurshan, M. Yannakakis. Timing verification by successive approximation. Information and Computation 118(1):142-157, 1995 (preliminary version appeared in Proc. 4th CAV, LNCS 663, 1992). Abstract. Full paper.

Hybrid Automata

R. Alur, T.A. Henzinger, P.-H. Ho. Automatic symbolic verification of embedded systems. IEEE Trans. on Software Engineering 22(3):181-201, 1996 (preliminary version appeared in Proc. 14th RTSS, 1993). Abstract. Full paper.
R. Alur, C. Coucoubetis, T.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science 138:3-34, 1995 (preliminary version appeared in Proc. Conf. on Analysis and Optimization of Systems: Discrete-event Systems, LNCIS 199, 1994). Abstract. Full paper.
R. Alur, C. Courcoubetis, T.A. Henzinger, P.-H. Ho. Hybrid Automata: An algorithmic approach to the specification and verification of hybrid systems. In Hybrid Systems, LNCS 736, pp. 209-229, 1993. Abstract. Full paper.

Probabilistic Systems

R. Alur, C. Courcoubetis, M. Yannakakis. Distinguishing tests for nondeterministic and probabilistic machines. Proceedings of the 27th ACM Symposium on Theory of Computing, pp. 363-372, 1995. Abstract. Full paper.
R. Alur, C. Courcoubetis, D.L. Dill. Verifying automata specifications of probabilistic real-time systems. In Real-Time: Theory in Practice, REX Workshop, LNCS 600, pp. 28-44, 1991. Abstract. Full paper.
R. Alur, C. Courcoubetis, D.L. Dill. Model-checking for probabilistic real-time systems. Automata, Languages and Programming: Proceedings of the 18th ICALP, LNCS 510, pp. 115-136, 1991. Abstract. Full paper.

Requirements Analysis

R. Alur, G.J. Holzmann, D. Peled. An analyzer for message sequence charts. Software Concepts and Tools, 17(2):70-77, 1996 (preliminary version appeared in Proc. 2nd TACAS, LNCS 1055, 1996). Abstract. Full paper.

Partial-Order Specifications

R. Alur, R.K. Brayton, T.A. Henzinger, S. Qadeer, and S.K. Rajamani. Partial-order reduction in symbolic state-space exploration. Proceedings of the Ninth International Conference on Computer-aided Verification, LNCS 1254, pp. 340--351, 1997. Abstract. Full paper.
R. Alur, K.L. McMillan, D.A. Peled. Model-checking of correctness conditions for concurrent objects. Proceedingss of the 11th IEEE Symposium on Logic in Computer Science, pp. 219-228, 1996. Abstract. Full paper.
R. Alur, D.A. Peled, W. Penczek. Model-checking of causality properties. Proceedingss of the Tenth IEEE Symposium on Logic in Computer Science, pp. 90-100, 1995. Abstract. Full paper.

Real-Time Logics

R. Alur, T. Feder, T.A. Henzinger. The benefits of relaxing punctuality. Journal of the ACM 43:116-146, 1996 (preliminary version appeared in Proc. 10th PODC, 1991). Abstract. Full paper.
R. Alur, C. Courcoubetis, D.L. Dill. Model-checking in dense real-time. Information and Computation 104(1):2-34, 1993 (preliminary version appeared in Proc. 5th LICS, 1990). Abstract. Full paper.
R. Alur and T.A. Henzinger. Real-time logics: complexity and expressiveness. Information and Computation 104(1):35-77, 1993 (preliminary version appeared in Proc. 5th LICS, 1990). Abstract. Full paper.
R. Alur and T.A. Henzinger. A really temporal logic. Journal of the ACM 41:181-204, 1994 (preliminary version appeared in the Proc. 30th FOCS 1989). Abstract. Full paper.

Distributed Computing

R. Alur and G. Taubenfeld. Fast timing-based algorithms. Distributed Computing 10(1):1-10, 1996 (preliminary version appeared in Proc. 13th RTSS, 1992). Abstract. Full paper.
R. Alur and G. Taubenfeld. Contention-free complexity of shared memory algorithms. Information and Computation 126(1):62-73, 1996 (preliminary version appeared in Proc. 13th PODC, 1994). Abstract. Full paper.
R. Alur, H. Attiya, G. Taubenfeld. Time-adaptive algorithms for synchronization. SIAM J. on Computing 26(2):539-556, 1997 (preliminary version appeared in Proc. 25th STOC, 1994). Abstract. Full paper.
R. Alur and G. Taubenfeld. How to share a data structure: A fast timing-based solution. Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, pp. 470-477, 1993. Abstract. Full paper.

Last updated on July, 1999 by Rajeev Alur .