Performance Analysis of Probabilistic Timed Automata Using Digital Clocks

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

Volumn 2791, Issue , 2004, Pages 105-120

  Kwiatkowska, Marta ^a,b   Norman, Gethin ^a,b   Parker, David ^a,b   Sproston, Jeremy ^a,b  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CLOCKS; COMPUTATION THEORY; INTERACTIVE COMPUTER SYSTEMS; MODEL CHECKING; REAL TIME SYSTEMS; SEMANTICS; TIME SHARING SYSTEMS;

DISCRETE PROBABILITY DISTRIBUTION; DYNAMIC CONFIGURATION; NON-PROBABILISTIC; PERFORMANCE ANALYSIS; PROBABILISTIC ASPECTS; PROBABILISTIC TIMED AUTOMATA; TIMED TEMPORAL LOGIC; VERIFICATION PROBLEMS;

PROBABILITY DISTRIBUTIONS;

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

References (29)

1. R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 1994.
2. R. Alur, S. Torre, and G. Pappas. Optimal paths in weighted timed automata. In Proc. HSCC'01, volume 2034 of LNCS, pages 49-62. Springer, 2001.
3. G. Behrmann, A. David, K. Larsen, O. Möller, P. Pettersson, and W. Yi. UPPAAL - present and future. In Proc.CDC'01. IEEE Computer Society Press, 2001.
4. G. Behrmann, A. Fehnker, T. Hune, K. Larsen, P. Pettersson, and J. Romijn. Efficient guiding towards cost-optimality in UPPAAL. In Proc. TACAS'01, volume 2031 of LNCS, pages 174-188. Springer, 2001.
5. G. Behrmann, A. Fehnker, T. Hune, K. Larsen, P. Pettersson, J. Romijn, and F. Vaandrager. Minimum-cost reachability for priced timed automata. In Proc. HSCC'01, volume 2034 of LNCS, pages 147-161. Springer, 2001.
6. D. Bertsekas and J. Tsitsiklis. An analysis of stochastic shortest path problems. Mathematics of Operations Research, 16(3):580-595, 1991.
7. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Proc. FSTTCS'95, volume 1026 of LNCS, pages 499-513. Springer, 1995.
8. H. Bohnenkamp, P. v. d. Stok, H. Hermanns, and F. Vaandrager. Cost-optimisation of the IPv4 zeroconf protocol. In Proc. IPDS 2003. IEEE CS Press, 2003.
9. D. Bosnacki. Digitization of timed automata. In Proc. FMICS'99, pages 283-302, 1999.
10. S. Cheshire, B. Adoba, and E. Guttman. Dynamic configuration of IPv4 link-local addresses. Draft, August 2002. Available from: www.ietf.org/internet- drafts/ draft-ietf-zeroconf-ipv4-linklocal-07.txt.
11. C. Daws, M. Kwiatkowska, and G. Norman. Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM. In Proc. FMICS'02, volume 66(2) of ENTCS. Elsevier Science, 2002.
12. L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997.
13. L. de Alfaro. Computing minimum and maximum reachability times in probabilistic systems. In Proc. CONCUR'99, volume 1664 of LNCS, pages 66-81. Springer, 1999.
14. C. Derman. Finite-State Markovian Decision Processes. Academic Press, 1970.
15. T.A. Henzinger, Z. Manna, and A. Pnueli. What good are digital clocks? In Proc. 1C ALP'92, volume 623 of LNCS, pages 545-558. Springer, 1992.
16. J. Kemeny, J. Snell, and A. Knapp. D enumerable Markov Chains. Graduate Texts in Mathematics. Springer, 2nd edition, 1976.
17. M. Kwiatkowska, G. Norman, and D. Parker. PRISM: Probabilistic symbolic model checker. In Proc. TOOLS'02, volume 2324 of LNCS, pages 200-204, 2002.
18. M. Kwiatkowska, G. Norman, D. Parker, and J. Sproston. Performance analysis of probabilistic timed automata using digital clocks. Technical Report CSR-03-6, School of Computer Science, University of Birmingham, 2003.
19. M. Kwiatkowska, G. Norman, R. Segala, and J. Sproston. Automatic verification of real-time systems with discrete probability distributions. Theoretical Computer Science, 282:101-150, 2002.
20. M. Kwiatkowska, G. Norman, and J. Sproston. Symbolic computation of maximal probabilistic reachability. In Proc. CONCUR'01, LNCS, pages 169-183. Springer, 2001.
21. M. Kwiatkowska, G. Norman, and J. Sproston. Probabilistic model checking of the IEEE 802.11 wireless local area network protocol. In Proc. PAPM/PROBMIV'02, volume 2399 of LNCS, pages 169-187. Springer, 2002.
22. M. Kwiatkowska, G. Norman, and J. Sproston. Probabilistic model checking of deadline properties in the IEEE 1394 FireWire root contention protocol. Formal Aspects of Computing, 14(3):295-318, 2003.
23. K. Larsen, G. Behrmann, E. Brinksma, A. Fehnker, T. Hune, P. Pettersson, and J. Romijn. As cheap as possible: Efficient cost-optimal reachability for priced timed automata. In Proc. CAV'01, volume 2102 of LNCS, pages 493-505. Springer, 2001.
24. J. Ouaknine and J. Worrell. Universality and language inclusion for open and closed timed automata. In Proc. HSCC'03, volume 2623 of LNCS, pages 375-388. Springer, 2003.
25. PRISM web page. http://www.cs.bham.ac.uk/~{}dxp/prisn/.
26. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Massachusetts Institute of Technology, 1995.
27. S. Tripakis. The formal analysis of timed systems in practice. PhD thesis, Université Joseph Fourier, 1998.
28. M. Vardi. Automatic verification of probabilistic concurrent finite state programs. In Proc. FOCS'85, pages 327-338. IEEE Computer Society Press, 1985.
29. M. Zhang and F. Vaandrager. Analysis of a protocol for dynamic configuration of IPv4 link local addresses using UPPAAL. Technical Report, NIII, University of Nijmegen, 2003.