Discrete-Time Rewards Model-Checked

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

Volumn 2791, Issue , 2004, Pages 88-104

  Andova, Suzana ^a   Hermanns, Holger ^b   Katoen, Joost Pieter ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; COMPLEX NETWORKS; TEMPORAL LOGIC; TIME SHARING SYSTEMS;

ADDRESS ASSIGNMENT; COMPLEX MEASURES; DISCRETE TIME; MARKOV REWARD MODEL; PROBABILISTIC COSTS;

MODEL CHECKING;

EID: 35048822416     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40903-8_8     Document Type: Article

References (20)

1. A. Aziz, K. Sanwal, V. Singhal and R. Brayton. Verifying continuous time Markov chains. In Computer-Aided Verification, LNCS 1102, pp. 269-276, 1996.
2. C. Baier, B. R. Haverkort, H. Hermanns and J.-P. Katoen. On the logical characterisation of performability properties. In Automata, Languages, and Programming, LNCS 1853, pp. 780-792, 2000.
3. C. Baier, B. R. Haverkort, H. Hermanns and J.-P. Katoen. Model-checking algorithms for continuous-time Markov chains. IEEE Transactions on Software Engineering, 29(6):524-545, 2003.
4. M. Bernardo. An algebra-based method to associate rewards with EMPA terms. In Automata, Languages and Programming (ICALP), LNCS 1256, pp. 358-368, 1997.
5. H. Bohnenkamp, P. van der Stok, H. Hermanns, and F. W. Vaandrager. Cost optimisation of the IPv4 zeroconf protocol. In Intl. Conf, on Dependable Systems and Networks. IEEE CS Press. 2003. (to appear).
6. S. Cheshire, B. Adoba and E. Guttman. Dynamic configuration of IPv4 link-local addresses. 2002 (draft), (available at www.ietf.org/internet-drafts).
7. G. Ciardo, J. Muppala and K. S. Trivedi. SPNP: Stochastic Petri Net Package. In Proc. 3rd Int'l Workshop on Petri Nets and Performance Models: 142-151, 1989.
8. G. Clark, S. Gilmore, and J. Hillston. Specifying performance measures for PEPA. In Formal Methods for Real-Time and Probabilistic Systems, LNCS 1601, pp. 211-227, 1999.
9. E. Clarke, O. Grumberg and D. Peled. Model Checking. MIT Press, 1999.
10. L. de Alfaro. How to specify and verify the long-run average behavior of probabilistic systems. In IEEE Symp. on Logic in Computer Science, pp. 454-465, 1998.
11. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Form. Asp. of Comp. 6: 512-535, 1994.
12. B. Haverkort, L. Cloth, H. Hermanns, J.-P. Katoen and C. Baier. Model checking performability properties. In Intl. Conf. on Dependable Systems and Networks, pp. 103-113, 2002.
13. J. G. Kemeny and J. L. Snell. Finite Markov Chains. Van Nostrand, 1960.
14. V. G. Kulkarni. Modeling and Analysis of Stochastic Systems, Chapman & Hall, 1995.
15. W. D. Obal and W. H. Sanders. State-space support for path-based reward variables. Performance Evaluation, 35(3-4): 233-251, 1999.
16. M. A. Qureshi and W. H. Sanders. Reward model solution method with impulse and rate rewards: An algorithm and numerical results. Performance Evaluation, 20: 413-436, 1994.
17. A. Reibman and K. Trivedi. Transient analysis of cumulative measures of Markov model behavior. Commun. Statist.Stochastic Models, 5(4):683-710, 1989.
18. R. M. Smith, K. S. Trivedi and A.V. Ramesh. Performability analysis: measures, an algorithm and a case study. IEEE Tr. on Computers, 37(4):406-417, 1988.
19. O. Sokolsky, A. Philippou I. Lee, and K. Christou. Modeling and analysis of power-aware systems. In Tools and Algorithms for the Construction and Analysis of Systems, LNCS 2619, pp. 409-425, 2003.
20. J. P. M. Voeten. Performance evaluation with temporal rewards. Performance Evaluation, 50:189-218, 2002.