Model checking durational probabilistic systems

Lecture Notes in Computer Science

Volumn 3441, Issue , 2005, Pages 140-154

  Laroussinie, François ^a   Sproston, Jeremy ^b  

^a CNRS   (France)

^b UNIVERSITY OF TURIN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DISCRETE TIME CONTROL SYSTEMS; FORMAL LOGIC; IDENTIFICATION (CONTROL SYSTEMS); MATHEMATICAL MODELS; SEMANTICS;

DURATIONAL SYSTEMS; MODEL-CHECKING ALGORITHMS; PROBABILISTIC SYSTEMS; TEMPORAL LOGIC;

PROBABILISTIC LOGICS;

EID: 24644488964     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31982-5_9     Document Type: Conference Paper

References (19)

1. R. Alur, C. Courcoubetis, and D. L. Dill. Model-checking in dense real-time. Information and Computation, 104(1):2-34, 1993.
2. S. Andova, H. Hermanns, and J.-P. Katoen. Discrete-time rewards model-checked. In Proc. 1st Int. Workshop on Formal Modeling and Analysis of Timed Systems (FORMATS 2003), volume 2791 of LNCS, pages 88-104. Springer, 2004.
3. 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.
4. C. Baier and M. Kwiatkowska. Model checking for a probabilistic branching time logic with fairness. Distributed Computing, 11(3):125-155, 1998.
5. A. Bianco and L. de Alfaro. Model checking of probabilistic and nondeterministic systems. In Proc. 15th Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'95), volume 1026 of LNCS, pages 499-513. Springer, 1995.
6. S. Campos, E. M. Clarke, W. R. Marrero, M. Minea, and H. Hiraishi. Computing quantitative characteristic of finite-state real-time systems. In Proc. IEEE Real-Time Systems Symposium (RTSS'94), pages 266-270. IEEE Computer Society Press, 1994.
7. E. M. Clarke, O. Grumberg, and D. Peled. Model checking. MIT Press, 1999.
8. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the ACM, 42(4):857-907, 1995.
9. L. de Alfaro. Formal verification of probabilistic systems. PhD thesis, Stanford University, Department of Computer Science, 1997.
10. L. de Alfaro. Temporal logics for the specification of performance and reliability. In Proc. 14th Annual Symp. on Theoretical Aspects of Computer Science (STACS'97), volume 1200 of LNCS, pages 165-176. Springer, 1997.
11. E. A. Emerson, A. K. Mok, A. P. Sistla, and J. Srinivasan. Quantitative temporal reasoning. Real Time Systems, 4(4):331-352, 1992.
12. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
13. H. A. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6(5):512-535, 1994.
14. M. Kwiatkowska. Model checking for probability and time: From theory to practice. In Proc. 18th Annual IEEE Symposium on Logic in Computer Science (LICS'03), pages 351-360. IEEE Computer Society Press, 2003.
15. 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.
16. F. Laroussinie, N. Markey, and P. Schnoebelen. On model checking durational Kripke structures (extended abstract). In Proc. 5th Int. Conf. Foundations of Software Science and Computation Structures (FOSSACS 2002), volume 2303 of LNCS, pages 264-279. Springer, 2002.
17. F. Laroussinie, N. Markey, and P. Schnoebelen. Efficient timed model checking for discrete time systems. Submitted, 2004.
18. S. Tripakis. Verifying progress in timed systems. In Proc. 5th AMAST Workshop on Real-Time and Probabilistic Systems (ARTS'99), volume 1601 of LNCS, pages 299-314. Springer, 1999.
19. M. Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proc. 16th Annual Symp. on Foundations of Computer Science (FOCS'85), pages 327-338. IEEE Computer Society Press, 1985.