Performance analysis of probabilistic timed automata using digital clocks

Formal Methods in System Design

Volumn 29, Issue 1, 2006, Pages 33-78

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

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b UNIVERSITY OF TURIN   (Italy)

Author keywords

Digital clocks; Probabilistic model checking; Timed automata

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; CODES (STANDARDS); LOCAL AREA NETWORKS; PROBABILISTIC LOGICS; PROBLEM SOLVING; REAL TIME SYSTEMS;

DIGITAL CLOCKS; PROBABILISTIC MODEL CHECKING; PROBABILISTIC REACHABILITY; TIMED AUTOMATA;

ELECTRIC CLOCKS;

EID: 33746043408     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10703-006-0005-2     Document Type: Article

References (55)

1. R. Alur, C. Courcoubetis, and D. Dill, "Model-checking in dense real-time," Inform. Comp., Vol. 104, No. 1, pp. 2-34, 1993.
2. R. Alur and D. Dill, "A theory of timed automata," Theor. Comp. Sci., Vol. 126, pp. 183-235, 1994.
3. R. Alur and T. Henzinger, "Reactive modules," Formal Meth. in Sys. Desi., Vol. 15, No. 1, pp. 7-48, 1999.
4. R. Alur, A. Itai, R. Kurshan, and M. Yannakakis, "Timing verification by successive approximation," Inform. Comp., Vol. 18, No. 1, pp. 142-157, 1995.
5. R. Alur, S. La Torre, and G. Pappas, "Optimal paths in weighted timed automata, in Benedetto and Sangiovanni-Vincentelli [11], pp. 49-62.
6. S. Andova, H. Hermanns, and J.-P. Katoen, "Discrete-time rewards model-checked," in K. Larsen and P. Niebert (Eds.), Proc. Formal Modeling and Analysis of Timed Systems (FORMATS'03), Vol. 2791 of LNCS, Springer-Verlag, 2003, pp. 88-104
7. E. Asarin, O. Maler, and A. Pnueli, "On discretization of delays in timed automata and digital circuits," in R. de Simone and D. Sangiorgi (Eds.), Proc. 9th Int. Conf. Concurrency Theory (CONCUR'98), Vol. 1466 of Lecture Notes in Computer Science, Springer-Verlag, 1998, pp. 470-484.
8. C. Baier and M. Kwiatkowska, "Model checking for a probabilistic branching time logic with fairness," Distr. Comp., Vol. 11, pp. 125-155, 1998.
9. G. Behrmann, A. Fehnker, T. Hune, K. Larsen, P. Pettersson, and J. Romijn, "Efficient guiding towards cost-optimality in UPPAAL," in T. Margaria and W. Yi (Eds.), Proc. 7th Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS'01), Vol. 2031 of Lecture Notes in Computer Science, Springer-Verlag, 2001, pp. 174-188.
10. G. Behrmann, A. Fehnker, T. Hune, K. Larsen, P. Pettersson, J. Romijn, and F. Vaandrager, "Minimumcost reachability for linearly priced timed automata in Benedetto and Sangiovanni-Vincentelli [11], pp. 147-162.
11. M.D. Benedetto and A. Sangiovanni-Vincentelli (Eds). in Proc. 4th Int. Workshop on Hybrid Systems: Computation and Control (HSCC'01), Vol. 2034 of Lecture Notes in Computer Science. Springer-Verlag, 2001.
12. D. Bertsekas and J. Tsitsiklis, "An analysis of stochastic shortest path problems," Math. Oper. Res., Vol. 16, No. 3, pp. 580-595, 1991.
13. D. Beyer, "Improvements in BDD-based reachability analysis of timed automata," in J. Oliveira and P. Zave (Eds.), Proc. Symp. Formal Methods Europe (FME'01), Vol. 2021 of Lecture Notes in Computer Science, Springer-Verlag, 2001, pp. 318-343.
14. D. Beyer and A. Noack, "Efficient verification of timed automata using BDDs," in S. Gnesi and U. Ultes-Nitsche (Eds.), Proc. Formal Methods for Industrial Critical Systems (FMICS'01), 2001, pp. 95-113.
15. A. Bianco and L. de Alfaro, "Model checking of probabilistic and nondeterministic systems," in P. Thiagarajan (Ed.), Proc. Foundations of Software Technology and Theoretical Computer Science, Vol. 1026 of Lecture Notes in Computer Science, Springer-Verlag, 1995, pp. 499-513.
16. P. Billingsley, Probability and Measure. John Wiley and Sons: New York, 1979.
17. H. Bohnenkamp, P. v. d. Stok, H. Hermanns, and F. Vaandrager, "Cost-optimisation of the IPv4 zeroconf protocol," in Proc. Int. Performance and Dependability Symposium (IPDS'03), pp. 531-540. IEEE Computer Society Press, 2003.
18. S. Cheshire, B. Adoba, and E. Guttman, "Dynamic configuration of IPv4 link-local addresses (draft August 2002). Zeroconf Working Group of the Internet Engineering Task Force (www.zeroconf.org).
19. E. Clarke, M. Fujita, P. McGeer, K. McMillan, J. Yang, and X. Zhao, "Multi-terminal binary decision diagrams: An efficient data structure for matrix representation," in Proc. Int. Workshop on Logic Synthesis (IWLS'93), pp. 1-15, 1993.
20. Also available in Form. Meth. in Syst. Des., Vol. 10, No. 2/3, 1997, pp. 149-169.
21. C. Daws, M. Kwiatkowska, and G. Norman, "Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM," Inte. J. Soft. Tools Technol. Trans. (STTT), Vol. 5, No. 2-3, pp. 221-236, 2004.
22. C. Daws and S. Yovine, "Two examples of verification of multirate timed automata with KRONOS," in Proc. IEEE Real-Time Systems Symposium (RTSS'95), IEEE Computer Society Press, 1995, pp. 66-75.
23. L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997.
24. L. de Alfaro, "Computing minimum and maximum reachability times in probabilistic systems," in J. Baeten and S. Mauw (Eds.), Proc. 10th Int. Conf. Concurrency Theory (CONCUR'99), Vol. 1664 of Lecture Notes in Computer Science, Springer-Verlag, 1999, pp. 66-81.
25. C. Derman, Finite-State Markovian Decision Processes. Academic Press: New York, 1970.
26. A. Gölü, A. Puri, and P. Varaiya, "Discretization of timed automata," in Proc. 33rd IEEE Conf. Decision and Control, IEEE Computer Society Press, 1994, pp. 957-958.
27. P. Halmos. Measure Theory. Springer-Verlag, New York, 1950.
28. H. Hansson and B. Jonsson, "A logic for reasoning about time and reliability," Form. Asp. Comp., Vol. 6, No. 4, pp. 512-535, 1994.
29. T. Henzinger, The Temporal Specification and Verification of Real-time Systems. PhD thesis, Stanford University, 1991.
30. T. Henzinger, P.-H. Ho, and H. Wong-Toi, "A user guide to HYTECH," in E. Brinksma, R. Cleaveland, and K. Larsen (Eds.), in Proc. 1st Int. Conf. Tools and Algorithms for Construction and Analysis of Systems (TACAS'95), Vol. 1019 of Lecture Notes in Computer Science, Springer-Verlag, 1995, pp. 41-71.
31. T. Henzinger, Z. Manna, and A. Pnueli, "What good are digital clocks?," in W. Kuich (Ed.), Proc. 19th Int. Colloquium on Automata, Languages and Programming (ICALP'92), Vol. 623 of Lecture Notes in Computer Science, Springer-Verlag, 1992, pp. 545-558.
32. T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, "Symbolic model checking for realtime systems," Inform. Comp., Vol. 111, No. 2, pp. 193-244, 1994.
33. IEEE 1394-1995. High Performance Serial Bus Standard. 1995.
34. IEEE 802.11, Wireless LANMedium Access Control (MAC) and Physical Layer (PHY) Specifications Standard. 1997.
35. J. Kemeny, J. Snell, and A. Knapp. Denumerable Markov Chains, Springer-Verlag: New York, 2nd edn. 1976.
36. M. Kwiatkowska, G. Norman, and D. Parker, "PRISM 2.0: A tool for probabilistic model checking," in Proc. 1st International Conference on Quantitative Evaluation of Systems (QEST'04), IEEE Computer Society Press, 2004, pp. 322-323.
37. M. Kwiatkowska, G. Norman, and D. Parker, "Probabilistic symbolic model checking with PRISM: A hybrid approach," Int. J. Soft. Tools Technol. Tran. (STTT), Vol. 6, No. 2, pp. 128-142, 2004.
38. M. Kwiatkowska, G. Norman, D. Parker, and J. Sproston, "Performance analysis of probabilistic timed automata using digital clocks," in K. Larsen and P. Niebert (Eds.), Proc. Formal Modeling and Analysis of Timed Systems (FORMATS'03), Vol. 2791 of Lecture Notes in Computer Science, Springer-Verlag, 2003, pp. 105-120.
39. M. Kwiatkowska, G. Norman, R. Segala, and J. Sproston, "Automatic verification of real-time systems with discrete probability distributions," Theor. Comp. Sci., Vol. 282, pp. 101-150, 2002.
40. M. Kwiatkowska, G. Norman, and J. Sproston, "Symbolic computation of maximal probabilistic reachability," in K. Larsen and M. Nielsen (Eds.), Proc. 13th Int. Conf. Concurrency Theory (CONCUR'01), Vol. 2154 of Lecture Notes in Computer Science, Springer-Verlag, 2001, pp. 169-183.
41. M. Kwiatkowska, G. Norman, and J. Sproston, "Probabilistic model checking of the IEEE802.11 wireless local area network protocol," in H. Hermanns and R. Segala (Eds.), Proc. 2nd Joint Int. Workshop Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM/PROBM 4'02), Vol. 2399 of Lecture Notes in Computer Science, Springer-Verlag, 2002, pp. 169-187.
42. M. Kwiatkowska, G. Norman, and J. Sproston, "Probabilistic model checking of deadline properties in the IEEE 1394 FireWire root contention protocol," Form. Asp. Comp., Vol. 14, pp. 295-318, 2003.
43. M. Kwiatkowska, G. Norman, J. Sproston, and F. Wang, "Symbolic model checking for probabilistic timed automata," in Y. Lakhnech and S. Yovine (Eds.), Joint Conference on Formal Modelling and Analysis of Timed Systems (FORMATS) and Formal Techniques in Real-Time and Fault Tolerant Systems (FTRTFT), Vol. 3253 of LNCS, Springer, 2004, pp. 293-308.
44. 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 G. Berry, H. Comon, and A. Finkel (Eds.), in Proc. 13th Int. Conf. Computer Aided Verification (CAV'01), Vol. 2102 of Lect. Notes in Comp. Sci., Springer-Verlag, 2001, pp. 493-505.
45. K. Larsen, P. Pettersson, and W. Yi, "UPPAAL in a nutshell," Soft. Tools Technolo. Tran., Vol. 1, No. 1-2, pp. 134-152, 1997.
46. J. Ouaknine, "Digitisation and full abstraction for dense-time model checking," in J.-P. Katoen and P. Stevens (Eds.), Proc. 8th Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS'02), Vol. 2280 of Lect. Notes in Comp. Sci., Springer-Verlag, 2002, pp. 37-51.
47. D. Parker. Implementation of Symbolic Model Checking for Probabilistic Sys. PhD thesis, University of Birmingham, 2002.
48. PRISM web page, www.cs.bham.ac.uk/~dxp/prism.
49. UPPAAL web page, www.uppaal.com.
50. A. Schrijver. Theory of Linear and Integer Programming. J.Wiley and Sons: New York, 1986.
51. R. Segala. Modelling and Verification of Randomized Distributed Real Time Systems. PhD thesis, Massachusetts Institute of Technology, 1995.
52. R. Segala and N.A. Lynch, "Probabilistic simulations for probabilistic processes," Nordic J. Comp., Vol. 2, No. 2, pp. 250-273, 1995.
53. D. Simons and M.I.A. Stoelinga, "Mechanical verification of the IEEE 1394a root contention protocol using UPPAAL2k," Soft. Tools Teehnolo. Trans., Vol. 3, No. 4, pp. 469-485, 2001.
54. M. Stoelinga. Alea jacta est: verification of probabilistic, real-time and parametric systems. PhD thesis, University of Nijmegen, the Netherlands, 2002.
55. M. Zhang and F. Vaandrager, "Analysis of a protocol for dynamic configuration of IPv4 link local addresses using UPPAAL," Technical Report, NIII-R04XX, University of Nijmegen, 2004.