Temporal logics for the specification of performance and reliability

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1200, Issue , 1997, Pages 165-176

  de Alfaro, Luca ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERACTIVE COMPUTER SYSTEMS; MODEL CHECKING; PARALLEL PROCESSING SYSTEMS; SEMANTICS; SPECIFICATIONS; TEMPORAL LOGIC; TIME SHARING SYSTEMS;

ALGORITHMIC VERIFICATION; MODEL CHECKING ALGORITHM; NONDETERMINISTIC BEHAVIOR; PERFORMANCE AND RELIABILITIES; TIMED SYSTEMS;

REAL TIME SYSTEMS;

EID: 84949652800     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0023457     Document Type: Conference Paper

References (24)

1. R. Alur and D. Dill. The theory of timed automata. In Real-Time: Theory in Practice, volume 600 of Lect. Notes in Comp. Sci., pages 45-73. Springer-Verlag, 1991.
2. A. Aziz, V. Singhal, F. Balarin, R.K. Brayton, and A.L. Sangiovanni-Vincentelli. It usually works: The temporal logic of stochastic systems. In Computer Aided Verification, volume 939 of Lect. Notes in Comp. Sci. Springer-Verlag, 1995.
3. D. Beauquier and A. Slissenko. Polytime model checking for timed probabilistic computation tree logic. Technical Report TR-96-08, Dept, of Informatics, Univ. Paris-12, April 1996.
4. D.P. Bertsekas. Dynamic Programming. Prentice-Hall, 1987.
5. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Found, of Software Tech. and Theor. Comp. Sci., volume 1026 of Lect. Notes in Comp. Sci., pages 499-513. Springer-Verlag, 1995.
6. C. Courcoubetis and M. Yannakakis. Markov decision processes and regular events. In ICALP'90, volume 443 of Lect. Notes in Comp. Sci., pages 336-349. Springer-Verlag, 1990.
7. L. de Alfaro. Formal verification of performance and reliability of real-time systems. Technical Report STAN-CS-TR-96-1571, Stanford University, June 1996.
8. E.V. Denardo. Computing a bias-optimal policy in a discrete-time markov decision problem. Operations Research, 18:279-289, 1970.
9. C. Derman. Finite State Markovian Decision Processes. Acedemic Press, 1970.
10. E.A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 16, pages 995-1072. Elsevier Science Publishers (North-Holland), Amsterdam, 1990.
11. E.A. Emerson and C.L. Lei. Modalities for model checking: Branching time strikes back. In Proc. 12th ACM Symp. Princ. of Prog. Lang., pages 84-96, 1985.
12. H. Hansson. Time and Probability in Formal Design of Distributed Systems. Elsevier, 1994.
13. H. Hansson and B. Jonsson. A framework for reasoning about time and reliability. In Proc. of Real Time Systems Symposium, pages 102-111. IEEE, 1989.
14. J.G. Kemeny, J.L. Snell, and A.W. Knapp. Denumerable Markov Chains. D. Van Nostrand Company, 1966.
15. Y. Kesten, Z. Manna, and A. Pnueli. Verifying clocked transition systems. In Hybrid Systems III, volume 1066 of Lect. Notes in Comp. Sci., pages 13-40. Springer-Verlag, 1996.
16. O. Kupferman and A. Pnueli. Once and for all. In Proc. 10th IEEE Symp. Logic in Comp. Sci., pages 25-35, 1995.
17. M. Kwiatkowska and C. Baier. Model checking for a probabilistic branching time logic with fairness. Technical Report CSR-96-12, University of Birmingham, June 1996.
18. Z. Manna and A. Pnueli. Models for reactivity. Acta Informatica, 30:609-678, 1993.
19. M.L. Puterman. Markov Decision Processes. John Wiley and Sons, 1994.
20. S. Safra. On the complexity of ω-automata. In Proc. 29th IEEE Symp. Found, of Comp. Sci., 1988.
21. S. Safra. Exponential determinization for ω-automata with strong-fairness acceptance condition. In Proc. ACM Symp. Theory of Comp., pages 275-282, 1992.
22. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, June 1995. Technical Report MIT/LCS/TR-676.
23. R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. In CONCUR'94, volume 836, pages 481-496. Springer-Verlag, 1994.
24. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. First IEEE Symp. Logic in Comp. Sci., pages 332-344, 1986.