Verifying automata specifications of probabilistic real-time systems

1. R. Alur, C. Courcoubetis, D.L. Dill, “Model-checking for real-time systems,” In Proceedings of the Fifth IEEE Symposium on Logic in Computer Science, pages 414–425, 1990.

   Google Scholar 

2. R. Alur, C. Courcoubetis, D.L. Dill, “Model-checking for probabilistic real-time systems,” In Automata, Languages, and Programming: Proceedings of the 18th ICALP, Lecture Notes in Computer Science 510, 1991.

   Google Scholar 

3. R. Alur, D.L. Dill, “Automata for modeling real-time systems,” In Automata, Languages, and Programming: Proceedings of the 17th ICALP, Lecture Notes in Computer Science 443, pages 322–335, 1990.

   Google Scholar 

4. R. Alur, T.A. Henzinger, “A really temporal logic,” In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, pages 164–169, 1989.

   Google Scholar 

5. J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, L.J. Hwang, “Symbolic model-checking: 1020 states and beyond,” In Proceedings of the Fifth IEEE Symposium on Logic in Computer Science, pages 428–439, 1990.

   Google Scholar 

6. C. Courcoubetis, M. Yannakakis, “Verifying temporal properties of finite-state probabilistic programs,” In Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, pages 338–345, 1988.

   Google Scholar 

7. E.A. Emerson, E.M. Clarke, “Using branching-time temporal logic to synthesize synchronization skeletons,” Science of Computer Programming 2, pages 241–266, 1982.

   Article  Google Scholar 

8. P. Godefroid, P. Wolper, “A partial approach to model-checking,” In Proceedings of the Sixth IEEE Symposium on Logic in Computer Science, pages 406–415, 1991.

   Google Scholar 

9. H. Hansson, B. Jonsson, “A framework for reasoning about time and reliability,” In Proceedings of the Tenth IEEE Real-Time Systems Symposium, pages 102–111, 1989.

   Google Scholar 

10. R. Koymans, “Specifying real-time properties with Metric Temporal Logic,” Journal of Real-Time Systems, 2, pages 255–299, 1990.

    Article  Google Scholar 

11. H.R. Lewis, “A logic of concrete time intervals,” In Proceedings of the Fifth IEEE Symposium on Logic in Computer Science, pages 380–389, 1990.

    Google Scholar 

12. D. Lehman, S. Shelah, “Reasoning with time and chance,” Information and Control 53, 1982.

    Google Scholar 

13. A. Pnueli, L. Zuck, “Probabilistic verification by tableaux,” In Proceedings of the First IEEE Symposium on Logic in Computer Science, 1986.

    Google Scholar 

14. G.S. Shedler, Regeneration and Networks of Queues, Springer-Verlag, 1987.

    Google Scholar 

15. W. Thomas, “Automata on infinite objects,” Handbook of Theoretical Computer Science, volume B, pages 133–191, 1990.

    Google Scholar 

16. W. Whitt, “Continuity of generalized semi-Markov processes,” Math. Oper. Res. 5, 1980.

    Google Scholar 

17. M. Vardi, “Automatic verification of probabilistic concurrent finite-state programs,” In Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, pages 327–338, 1985.

    Google Scholar 

Download references