Model checking for probabilistic timed systems

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

Volumn 2925, Issue , 2004, Pages 189-229

  Sproston, Jeremy ^a  

^a UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CONTINUOUS TIME SYSTEMS; MULTIMEDIA SYSTEMS; REAL TIME SYSTEMS; ROBOTS; SEMANTICS; STATE SPACE METHODS; TIME SHARING SYSTEMS;

EQUIVALENCE RELATIONS; FINITE STATE SYSTEMS; INFINITE STATE SPACE; MULTIMEDIA EQUIPMENT; PROBABILISTIC EXTENSION; PROBABILISTIC TIMED AUTOMATA; PROBABILISTIC TIMED SYSTEM; REAL-TIME PROBABILISTIC PROCESS;

MODEL CHECKING;

EID: 33746662137     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24611-4_6     Document Type: Article

References (53)

1. R. Alur. Timed automata. In N. Halbwachs and D. Peled, editors, Proceedings of the 11th International Conference on Computer-Aided Verification (CAV'99), volume 1633 of LNCS, pages 8-22. Springer, 1999.
2. R. Alur, C. Courcoubetis, and D. L. Dill. Model-checking for probabilistic real-time systems. In J. Leach Albert, B. Monien, and M. Artalejo Rodríguez, editors, Proceedings of the 18th International Conference on Automata, Languages and Programming (ICALP'91), volume 510 of LNCS, pages 115-136. Springer, 1991.
3. R. Alur, C. Courcoubetis, and D. L. Dill. Verifying automata specifications of probabilistic real-time systems. In J. W. de Bakker, C. Huizing, W. P. de Roever, and G. Rozenberg, editors, Proceedings of Real-Time: Theory in Practice, REX Workshop, volume 600 of LNCS, pages 28-44. Springer, 1991.
4. R. Alur, C. Courcoubetis, and D. L. Dill. Model-checking in dense real-time. Information and Computation, 104(1):2-34, 1993.
5. R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 1994.
6. T. Amnell, G. Behrmann, J. Bengtsson, P. R. D'Argenio, A. David, A. Fehnker, T. Hune, B. Jeannet, K. G. Larsen, M. O. Möller, P. Pettersson, C. Weise, , and W. Yi. UPPAAL - Now, next, and future. In F. Cassez, C. Jard, B. Rozoy, and M. Ryan, editors, Proceedings of the Summer School on Modelling and Verification of Parallel Processes (MOVEP'2k), volume 2067 of LNCS, pages 100-125. Springer, 2001.
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, editors, Proceedings of the 9th International Conference on Concurrency Theory (CONCUR'98), volume 1466 of LNCS, pages 470-484. Springer, 1998.
8. C. Baier, B. Haverkort, H. Hermanns, and J.-P. Katoen. Model-checking algorithms for continuous-time Markov chains. IEEE Transactions on Software Engineering, 29(6):524-541, 2003.
9. C. Baier and M. Kwiatkowska. Model checking for a probabilistic branching time logic with fairness. Distributed Computing, 11(3):125-155, 1998.
10. D. Beauquier. On probabilistic timed automata. Theoretical Computer Science, 292(1):65-84, 2003.
11. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In P. S. Thiagarajan, editor, Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'95), volume 1026 of LNCS, pages 499-513. Springer, 1995.
12. A. Bouajjani, S. Tripakis, and S. Yovine. On-the-fly symbolic model checking for real-time systems. In K.-J. Lin and S. H. Son, editors, Proceedings of the 18th IEEE Real-Time Systems Symposium (RTSS'97). IEEE Computer Society Press, 1997.
13. M. Bozga, O. Maler, and S. Tripakis. Efficient verification of timed automata using dense and discrete time semantics. In L. Pierre and T. Kropf, editors, Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods (CHARME'99), volume 1703 of LNCS, pages 125-141. Springer, 1999.
14. J. Bryans, H. Bowman, and J. Derrick. Model checking stochastic automata. To appear in ACM Transactions on Computational Logic, 2003.
15. E. M. Clarke and E. A. Emerson. The design and synthesis of synchronization skeletons using temporal logic. In D. Kozen, editor, Proceedings of the Workshop on Logics of Programs, volume 131 of LNCS, pages 52-71. Springer, 1981.
16. E. M. Clarke, O. Grümberg, and D. Peled. Model checking. MIT Press, 1999.
17. C. Courcoubetis and S. Tripakis. Probabilistic model checking: formalisms and algorithms for discrete and real-time systems. In M. K. Inan and R. P. Kurshan, editors, Verification of Digital and Hybrid Systems, pages 183-219. Springer, 2000.
18. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857-907, 1995.
19. P. R. D'Argenio. A compositional translation of stochastic automata into timed automata. Technical Report CTIT 00-08, University of Twente, 2000.
20. P. R. D'Argenio, J.-P. Katoen, and E. Brinksma. An algebraic approach to the specification of stochastic systems (extended abstract). In D. Gries and. W.-P. de Roever, editors, Proceedings of the IFIP Working conference on Programming Concepts and Methods (PROCOMET'98), IFIP Series, pages 126-147. Chapman & Hall, 1998.
21. C. Daws, M. Kwiatkowska, and G. Norman. Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM. In R. Cleaveland and H. Garavel, editors, Proceedings of the 7th International Workshop on Formal Methods for Industrial Critical Systems (FMICS 2002), volume 66(2) of Electronic Notes in Theoretical Computer Science, 2002.
22. L. de Alfaro. Formal verification of probabilistic systems. PhD thesis, Stanford University, Department of Computer Science, 1997.
23. C. Derman. Finite-State Markovian Decision Processes. Academic Press, 1970.
24. P. W. Glynn. A GSMP formalism for discrete-event systems. Proceedings of the IEEE, 77:14-23, 1989.
25. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6(5):512-535, 1994.
26. T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. Information and Computation, 111(2):193-244, 1994.
27. T.A. Henzinger, Z. Manna, and A. Pnueli. What good are digital clocks? In W. Kuich, editor, Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP'92), volume 623 of LNCS, pages 545-558. Springer, 1992.
28. H. Hermanns, J.-P. Katoen, J. Meyer-Kayser, and M. Siegle. A Markov chain model checker. Software Tools for Technology Transfer, 4(2):153-172, 2003.
29. B. Jeannet, P. R. D'Argenio, and K. G. Larsen. RAPTURE: A tool for verifying Markov Decision Processes. In I. Cerna, editor, Tools Day'02, Brno, Czech Republic, Technical Report. Faculty of Informatics, Masaryk University Brno, 2002.
30. H. E. Jensen. Model checking probabilistic real time systems. In B. Bjerner, M. Larsson, and B. Nordström, editors, Proceedings of the 7th Nordic Workshop on Programming Theory, volume 86, pages 247-261. Chalmers Institute of Technology, 1996.
31. J. G. Kemeny, J. L. Snell, and A. W Knapp. Denumerable Markov Chains. Graduate Texts in Mathematics. Springer, 2nd edition, 1976.
32. M. Kwiatkowska, G. Norman, and D. Parker. PRISM: Probabilistic symbolic model checker. In T. Field, P. Harrison, J. Bradley, and U. Harder, editors, Proceedings of the 12th International Conference on Modelling Techniques and Tools for Computer Performance Evaluation (TOOLS 2002), volume 2324 of LNCS, pages 200-204. Springer, 2002.
33. M. Kwiatkowska, G. Norman, D. Parker, and J. Sproston. Performance analysis of probabilistic timed automata using digital clocks. In K. G. Larsen and P. Niebert, editors, Proceedings of the 1st International Workshop on Formal Modeling and Analysis of Timed Systems (FORMATS 2003), LNCS. Springer, 2003.
34. M. Kwiatkowska, G. Norman, R. Segala, and J. Sproston. Verifying quantitative properties of continuous probabilistic timed automata. In C. Palamidessi, editor, Proceedings of the 11th International Conference On Concurrency Theory (CONCUR 2000), volume 1877 of LNCS, pages 123-137. Springer, 2000.
35. M. Kwiatkowska, G. Norman, R. Segala, and J. Sproston. Automatic verification of real-time systems with discrete probability distributions. Theoretical Computer Science, 286:101-150, 2002.
36. M. Kwiatkowska, G. Norman, and J. Sproston. Symbolic computation of maximal probabilistic reachability. In K. Larsen and M. Nielsen, editors, Proceedings of the 13th International Conference on Concurrency Theory (CONCUR 2001), volume 2154 of LNCS, pages 169-183. Springer, 2001.
37. M. Kwiatkowska, G. Norman, and J. Sproston. Probabilistic model checking of the IEEE 802.11 wireless local area network protocol. In H. Hermanns and R. Segala, editors, Proceedings of the 2nd Joint International Workshop on Process Algebra and Performance Modelling and Probabilistic Methods in Verification (PAPM-PROBMIV 2002), volume 2399 of LNCS, pages 169-187. Springer, 2002.
38. 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.
39. K. G. Larsen, P. Pettersson, and W. Yi. Compositional and symbolic model-checking of real-time systems. In A. Burns, Y.-H. Lee, and K. Ramamritham, editors, Proceedings of the 16th IEEE Real-Time Systems Symposium (RTSS'95), pages 76-87. IEEE Computer Society Press, 1995.
40. K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1-28, 1991.
41. G. Infante Lòpez, H. Hermanns, and J.-P. Katoen. Beyond memoryless distributions: Model checking semi-Markov chains. In L. de Alfaro and S. Gilmore, editors, Proceedings of Process Algebra and Probabilistic Methods. Performance Modeling and Verification. Joint International Workshop (PAPM-PROBMIV 2001), volume 2165 of LNCS, pages 57-70. Springer, 2001.
42. A. V. Moura and G. A. Pinto. A note on the verification of automata specifications of probabilistic real-time systems. Information Processing Letters, 82(5):223-228, 2002.
43. M. L. Puterman. Markov Decision Processes. J. Wiley & Sons, 1994.
44. J.-P. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In M. Dezani-Ciancaglini and U. Montanari, editors, Proceedings of the International Symposium on Programming, volume 137 of LNCS, pages 337-351. Springer, 1982.
45. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Massachusetts Institute of Technology, 1995.
46. R. Segala and N. A. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250-273, 1995.
47. S. Tripakis. Verifying progress in timed systems. In J.-P. Katoen, editor, Proceedings of the 5th International AMAST Workshop on Real-Time and Probabilistic Systems (ARTS'99), volume 1601 of LNCS, pages 299-314. Springer, 1999.
48. M. Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proceedings of the 16th Annual Symposium on Foundations of Computer Science (FOCS'85), pages 327-338. IEEE Computer Society Press, 1985.
49. W. Whitt. Continuity of generalized semi-Markov processes. Mathematics of Operations Research, 5:494-501, 1980.
50. W. Yi, P. Pettersson, and M. Daniels. Automatic verification of real-time communicating systems by constraint-solving. In D. Hogrefe and S. Leue, editors, Proceedings of the 7th International Conference on Formal Description Techniques, pages 223-238. North-Holland, 1994.
51. H. L. S. Younes and R. G. Simmons. Probabilistic verification of discrete event systems using acceptance sampling. In E. Brinskma and K. G. Larsen, editors, Proceedings of the 14th International Conference on Computer Aided Verification (CAV2002), volume 2404 of LNCS, pages 223-235. Springer, 2002.
52. S. Yovine. Kronos: A verification tool for real-time systems. International Journal of Software Tools for Technology Transfer, 1(1/2):123-133, 1997.
53. S. Yovine. Model checking timed automata. In G. Rozenberg and F. Vaandrager, editors, Embedded Systems, volume 1494 of LNCS, pages 114-152. Springer, 1998.