Timing verification by successive approximation

Information and Computation

Volumn 118, Issue 1, 1995, Pages 142-157

  Alur, R ^a   Itai, A ^a   Kurshan, R P ^a   Yannakakis, M ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000025993     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1006/inco.1995.1059     Document Type: Article

References (25)

1. Alur, R., Courcoubetis, C., and Dill, D. L. (1990), Model-checking in dense real-time, Inform, and Comput. 104, 2-34.
2. Alur, R., Courcoubetis, C., Halbwachs, N., Dill, D. L., and Wong-Toi, H. (1992), Minimization of timed transition systems, in "Proceedings of the Third Conference on Concurrency Theory CONCUR '92," pp. 340-354, Lecture Notes in Computer Science, Vol. 630, Springer-Verlag, Berlin/New York.
3. Alur, R., and Dill, D. L. (1994), A theory of timed automata, Theoret. Comput. Sci. 126, 183-235.
4. Alur, R., and Henzinger, T. A. (1994), A really temporal logic, J. Assoc. Comput. Mach. 41 (1), 181-204.
5. Aggarwal, S., and Kurshan, R. P. (1983), Modeling elapsed time in protocol specification, in "IFIP Protocol Specification, Testing, and Verification" (H. Rudin and C. H. West, Eds.), Vol. 3, pp. 51-62.
6. Aggarwal, S., Kurshan, R. P., and Sharma, D. (1983), A language for the specification and analysis of protocols, in "IFIP Protocol Specification, Testing, and Verification" (H. Rudin and C. H. West, Eds.), Vol. 3, pp. 35-50.
7. Alur, R., and Taubenfeld, G. (1992), Results about fast mutual exclusion, in "Proceedings of the 13th IEEE RealTime Systems Symposium," pp. 12-21.
8. Browne, M. C., Clarke, E. M., Dill, D. L., and Mishra, B. (1986), Automatic verification of sequential circuits using temporal logic, IEEE Trans. Comput. C-35 (12), 1035-1044.
9. Clarke, E. M., Emerson, E. A., and Sistla, A. P. (1986), Automatic verification of finite-state concurrent systems using temporal-logic specifications, ACM Trans. Programming Languages Systems 8 (2), 244-263.
10. Choueka, Y. (1974), Theories of automata on to-tapes: A simplified approach, J. Comput. System Sci. 8, 117-141.
11. Dill, D. L. (1989), Timing assumptions and verification of finite-state concurrent systems, in "Automatic Verification Methods for Finite State Systems" (J. Sifakis, Ed.), pp. 197-212, Lecture Notes in Computer Science, Vol. 407, Springer-Verlag, Berlin/New York.
12. Emerson, E. A., Mok, A. K., Sistla, A. P., and Srinivasan, J. (1990), Quantitative temporal reasoning, in "Computer-Aided Verification, 2nd International Conference, CAV'90" (E. M. Clarke and R. P. Kurshan, Eds.), pp. 136-145, Lecture Notes in Computer Science, Vol. 531, Springer-Verlag, Berlin/New York.
13. Har'El, Z., and Kurshan, R. P. (1990), Software for analytical development of communication protocols, AT&T Technical J.
14. Henzinger, T. A., Manna, Z., and Pnueli, A. (1991), Temporal proof methodologies for real-time systems, in "Proceedings of the 18th ACM Symposium on Principles of Programming Languages," pp. 353-366.
15. Henzinger, T. A., Nicollin, X., Sifakis, J., and Yovine, S. (1994), Symbolic model-checking for real-time systems, Inform, and Comput. 111 (2), 193-244.
16. Kurshan, R. P. (1987), Reducibility in analysis of coordination, in "Lecture Notes in Computer Science," Vol. 103, pp. 19-39, Springer-Verlag, Berlin/New York.
17. Kurshan, R. P. (1994), "Computer-aided Verification of Coordinating Processes: The Automata-Theoretic Approach," Princeton University Press, Princeton, NJ.
18. Lamport, L. (1987), A fast mutual exclusion algorithm, ACM Trans. Comput. Systems 5 (1), 111.
19. Lewis, H. R. (1990), A logic of concrete time intervals, in "Proceedings of the Fifth Symposium on Logic in Computer Science," pp. 380-389.
20. Lynch, N., and Shavit, N. (1992). Timing-based mutual exclusion, in "Proceedings of the 13th IEEE Real-Time Systems Symposium," pp. 2-11.
21. McMillan, K. (1993), "Symbolic Model Checking: An Approach to the State Explosion Problem," Kluwer Academic, Dordrecht/Norwell, MA.
22. Papadimitriou, C. H., and Steiglitz, K. (1982), "Combinatorial Optimization: Algorithms and Complexity," Prentice-Hall, Englewood Cliffs. NJ.
23. Thomas, W. (1990), Automata on infinite objects, in "Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), Vol. B, pp. 133-191, Elsevier, Amsterdam.
24. Vardi, M. Y., and Wolper, P. (1986), An automata-theoretic approach to automatic program verification, in "Proceedings of the First IEEE Symposium on Logic in Computer Science," pp. 332-344.
25. Yannakakis, M. (1990), Graph-theoretic methods in database theory, in "Proceedings of the 9th ACM Symposium on Principles of Database Systems," pp. 230-242.