Model-checking in dense real-time

Information and Computation

Volumn 104, Issue 1, 1993, Pages 2-34

  Alur, Rajeev ^a   Courcoubetis, Costas ^b   Dill, David ^a  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF CRETE   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (35)

1. S. Aggarwal and R. Kurshan (1983). Modeling elapsed time in protocol specification, in "Protocol Specification, Testing, and Verification" (H. Rudin and C. West, Eds), Vol. III, pp. 51-62.
2. R. Alur (1991). "Techniques for Automatic Verification of Real-Time Systems," Ph.D. thesis, Stanford University.
3. R. Alur, C. Courcoubetis, and D. Dill (1991). Model-checking for probabilistic realtime systems, in "Automata, Languages and Programming: Proceedings of the 18th ICALP," Lecture Notes in Computer Science, Vol. 510, pp. 115-136. Springer-Verlag, Berlin/New York.
4. R. Alur and D. Dill (1990). Automata for modeling real-time systems, in "Automata, Languages and Programming: Proceedings of the 17th ICALP," Lecture Notes in Computer Science, Vol. 443, pp. 322-335, Springer-Verlag, Berlin/New York.
5. R. Alur, T. Feder, and T. Henzinger (1991). The benefits of relaxing punctuality, in "Proceedings of the Tenth ACM Symposium on Principles of Distributed Computing," pp. 139-152.
6. R. Alur and T. Henzinger (1989). A really temporal logic, in "Proceedings of the 30th IEEE Symposium on Foundations of Computer Science," pp. 164-169.
7. R. Alur and T. Henzinger (1992). Logics and models of real time: A survey, in "Proceedings of REX workshop 'Real-Time: Theory in Practice," Lecture Notes in Computer Science, Vol. 600, pp. 74-106, Springer-Verlag, Berlin/New York.
8. A. Bernstein and P. Harter (1981). Proving real-time properties of programs with temporal logic, in "Proceedings of the Eighth ACM Symposium on Operating System Principles," pp. 164-176.
9. J. Brzozowski and C. Seger (1991). Advances in asynchronous circuit theory. Part II. Bounded inertial delay models, MOS circuits, design techniques, in "Bulletin of the European Association for Theoretical Computer Science," Vol. 43, pp. 199-263.
10. J. Burch (1989). Combining CTL, trace theory and timing models, in "Automatic Verification Methods for Finite State Systems: Proceedings of the First CAV," Lecture Notes in Computer Science, Vol. 407, pp. 197-212, Springer-Verlag, Berlin/New York.
11. 20 states and beyond, in "Proceedings of the Fifth IEEE Symposium on Logic in Computer Science," pp. 428-439.
12. E. Clarke, E. A. Emerson, and A. P. Sistla (1986). Automatic verification of finite-state concurrent systems using temporal-logic specifications. ACM Trans. Programming Languages Systems 8, No. 2, 244-263.
13. C. Courcoubetis and M. Yannakakis (1991). Minimum and maximum delay problems in real-time systems, in "Proceedings of the Third Workshop on Computer-Aided Verification, Aalborg University, Denmark," Lecture Notes in Computer Science, Vol. 575, pp. 399-409, Springer-Verlag, Berlin/New York.
14. D. Dill (1989). Timing assumptions and verification of finite-state concurrent systems, in "Automatic Verification Methods for Finite State Systems" (J. Sifakis, Ed.), Lecture Notes in Computer Science, Vol. 407, Springer-Verlag, Berlin/New York.
15. E. A. Emerson (1983). Alternative semantics for temporal logics, Theoret. Comput. Sci. 26, 121 130 (1983).
16. E. A. Emerson and E. M. Clarke (1982). Using branching-time temporal logic to synthesize synchronization skeletons, Sci. Comput. Programming 2. 241-266.
17. E. A. Emerson and J. Halpern (1982). Decision procedures and expressiveness in the temporal logic of branching time, in "Proceedings of the 9th ACM Symposium on Principles of Programming Languages," pp. 169-179.
18. E. A. Emerson, A. Mok, A. P. Sistla, and J. Srinivasan (1989). Quantitative temporal reasoning, presented at the First Workshop on Computer-aided Verification, Grenoble, France.
19. E. Harel, O. Lichtenstein, and A. Pnleli (1990). Explicit-clock temporal logic, in "Proceedings of the Fifth IEEE Symposium on Logic in Computer Science," pp. 402-413.
20. T. Henzinger, Z. Manna, and A. Pnleli (1991). Temporal proof methodologies for real-time systems, in "Proceedings of the 18th ACM Symposium on Principles of Programming Languages." pp. 353-366.
21. T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine (1992). Symbolic model-checking for real-time systems, in "Proceedings of the Seventh IEEE Symposium on Logic in Computer Science," pp. 394-406.
22. J. Hopcroft and J. Ullman (1979). "Introduction to Automata Theory, Languages, and Computation," Addison-Wesley, Reading, MA.
23. F. Jahanian and A. Mok (1986), Safety analysis of timing properties in real-time systems, IEEE Trans. Software Engr. SE-12, No. 9, 890-904.
24. F. Jahanian and A. Mok (1987). A graph-theoretic approach for timing analysis and its implementation, IEEE Trans. Comput. C-36. 961-975.
25. R. Koymans (1990). Specifying real-time properties with metric temporal logic, J. Real-Time Systems 2, 255-299.
26. D. Lehman, A. Pnueli, and J. Stavi (1982). Impartiality, justice, and fairness: The ethics of concurrent termination, in "Automata, Languages and Programming: Proceedings of the Ninth ICALP," Lecture Notes in Computer Science, Vol. 115, pp. 264-277, Springer-Verlag, Berlin/New York.
27. H. Lewis (1989), "Finite-State Analysis of Asynchronous Circuits with Bounded Temporal Uncertainty," Technical Report TR-15-89, Harvard University.
28. H. Lewis (1990). A logic of concrete time intervals, in "Proceedings of the Fifth IEEE Symposium on Logic in Computer Science," pp. 380-389.
29. N. Lynch and H. Attiya (1990). Using mappings to prove timing properties, in "Proceedings of the Ninth ACM Symposium on Principles of Distributed Computing." pp. 265-280.
30. Z. Manna and A. Pnueli (1989). The anchored version of the temporal framework, in "Linear Time, Branching Time, and Partial Order in Logics and Models for Concurrency," Lecture Notes in Computer Science, Vol. 354, Springer-Verlag, Berlin/New York.
31. X. Nicollin, J. Sifakis, and S. Yovine (1991). From ATP to timed graphs and hybrid systems, in "Proceedings of REX Workshop 'Real-Time: Theory in Practice," Lecture Notes in Computer Science, Vol. 600, pp. 549-572, Springer-Verlag, Berlin/New York.
32. J. Ostroff (1990). "Temporal Logic of Real-Time Systems," Research Studies Press.
33. S. Owicki and L. Lamport (1982). Proving liveness properties of concurrent programs, ACM Trans. Programming Languages Systems 4, No. 3, 455-595.
34. A. Pnueli (1977). The temporal logic of programs, in "Proceedings of the 18th IEEE Symposium on Foundations of Computer Science," pp. 46-77.
35. H. Rogers (1967). "Theory of Recursive Functions and Effective Computability," McGraw-Hill, New York.