Model Checking Discounted Temporal Properties

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

Volumn 2988, Issue , 2004, Pages 77-92

  De Alfaro, Luca ^a   Faella, Marco ^b   Henzinger, Thomas A ^c   Majumdar, Rupak ^d   Stoelinga, Marïlle ^c,d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF SALERNO   (Italy)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; MARKOV PROCESSES; MODEL CHECKING; SEMANTICS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

BOOLEAN OPERATORS; FIX-POINT SEMANTICS; LOGICAL OPERATORS; MODEL CHECKING ALGORITHM; QUANTITATIVE INTERPRETATION; STANDARD INTERPRETATION; TEMPORAL OPERATORS; TRANSITION SYSTEM;

TEMPORAL LOGIC;

EID: 21144438301     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24730-2_6     Document Type: Article

References (19)

1. C. Baier, B.R. Haverkort, H. Hermanns, and J.-P. Katoen. Model checking continuous-time Markov chains by transient analysis. In Computer-Aided Verification, LNCS 1855, pages 358-372. Springer, 2000.
2. D.P. Bertsekas. Dynamic Programming and Optimal Control. Athena Scientific, 1995. Volumes I and II.
3. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Foundations of Software Technology and Theoretical Computer Science, LNCS 1026, pages 499-513. Springer, 1995.
4. E.M. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
5. L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis. Technical Report STAN-CS-TR-98-1601, Stanford University, 1997.
6. L. de Alfaro, M. Faella, T.A. Henzinger, R. Majumdar, and M. Stoelinga. Model checking discounted temporal properties. Technical Report UCSC-CRL-03-12, University of California, Santa Cruz, 2003.
7. L. de Alfaro, T.A. Henzinger, and R. Majumdar. Discounting the future in systems theory. In Automata, Languages, and Programming, LNCS 2719, pages 1022-1037. Springer, 2003.
8. J. Desharnais, A. Edalat, and P. Panangaden. Bisimulation for labeled Markov processes. Information and Computation, 179:163-193, 2002.
9. J. Filar and K. Vrieze. Competitive Markov Decision Processes. Springer, 1997.
10. H. Hansson. Time and Probabilities in Formal Design of Distributed Systems. Elsevier, 1994.
11. M. Huth and M.Z. Kwiatkowska. Quantitative analysis and model checking. In Proc. Logic in Computer Science, pages 111-122. IEEE, 1997.
12. J.G. Kemeny, J.L. Snell, and A.W. Knapp. Denumerable Markov Chains. Van Nostrand, 1966.
13. D. Kozen. A probabilistic PDL. In Proc. Theory of Computing, pages 291-297. ACM, 1983.
14. M.Z. Kwiatkowska. Model checking for probability and time: From theory to practice. In Proc. Logic in Computer Science, pages 351-360. IEEE, 2003.
15. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, 1991.
16. A. McIver. Reasoning about efficiency within a probabilistic μ-calculus. In Proc. Probabilistic Methods in Verification, pages 45-58. Technical Report CSR-98-4, University of Birmingham, 1998.
17. A. McIver and C. Morgan. Games, probability, and the quantitative μ-calculus. In Logic Programming, Artificial Intelligence, and Reasoning, LNCS 2514, pages 292-310. Springer, 2002.
18. D. Williams. Probability with Martingales. Cambridge University Press, 1991.
19. U. Zwick and M.S. Paterson. The complexity of mean-payoff games on graphs. Theoretical Computer Science, 158:343-359, 1996.