Stochastic model checking with stochastic comparison

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

Volumn 3670 LNCS, Issue , 2005, Pages 109-123

  Pekergin, Nihal ^a,b   Younès, Sana ^a  

^a UNIVERSITY OF VERSAILLES   (France)

^b UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; AUTOMATA THEORY; COMPUTATION THEORY; COMPUTER NETWORKS; MATHEMATICAL MODELS; PROBLEM SOLVING;

MODEL CHECKING; STEADY-STATE BOUNDING DISTRIBUTIONS; STOCHASTIC AUTOMATA NETWORKS; STOCHASTIC PROCESS ALGEBRAS;

MARKOV PROCESSES;

EID: 33646121495     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11549970_9     Document Type: Conference Paper

References (19)

1. Abu-Amsha, O., Vincent, J.M.: An algorithm to bound functionals of Markov chains with large state space. In: 4th INFORMS Conference on Telecommunications, Boca Raton, Florida, (1998)
2. Andova, S., Hermanns, H., Katoen, J.P.: Disrete-time rewards model-checked. In Formal Modelling and Analysis of Timed Systems (FORMATS 2003), Marseille France.
3. Aziz, A., Sanwal, K., Singhal, V. and Brayton R.: Model checking continuous time Markov chains. ACM Trans. on Comp. Logic, 1(1), p. 162-170, 2000.
4. Baier, C., Haverkort, B., Hermanns, H., Katoen, J.P.: Automated performance and dependability evaluation using Model Checking. LNCS 2459, Performance evaluation of complex systems: Techniques and Tools, pp 64-88, 2002.
5. Benmammoun, M., Fourneau, J.M., Pekergin, N., Troubnikoff, A.: An algorithmic and numerical approach to bound the performance of high speed networks. In IEEE MASCOTS 2002, Fort Worth, USA, pp. 375-382.
6. Clarke, E.M., Emerson, A., Sistla, A. P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. on Programming Languages and Systems 8(2):244-263, 1986.
7. D'Argenio, P.R. Jeannet, B., Jensen, H.E. and Larsen, K.G. Reduction and Refinement Strategies for Probabilistic Analysis. In Proc Process Algebra and Probabilistic Methods Performance Modeling and Verification, Springer-Verlag, 2001.
8. Fourneau, J.M., Pekergin, N., Younès, S.: Improving Stochastic Model Checking with Stochastic Bounds. In SAINT Modelling and Performance Evaluation in Next Generation Internet Workshop, 2005.
9. Fourneau, J.M., Lecoz, M., Pekergin, N., Quessette, F.: An open tool to compute stochastic bounds on steady-state distributions and rewards. In IEEE MASCOTS 2003, pp. 219-225.
10. Fourneau, J.M., Pekergin, N.: An algorithmic approach to stochastic bounds. LNCS 2459, Performance evaluation of complex systems: Techniques and Tools, pp 64-88, 2002.
11. Fourneau, J.M., Lecoz, M. and Quessette, F.: Algorithms for irreducible and lumpable strong stochastic bound. Linear Algebra and its Applications 386(2004) 167-185, 2004.
12. Hansson, H. and Jonsson B.: A logic for reasoning about time and reliability. In Form. Asp. of Comp. 6: 512-535, 1994.
13. Haverkort, B., Cloth, L., Hermanns, H., Katoen, J.P. and E C. Baier: Model Checking Performability Properties In Proc. Dependability Systems and NETWORKS (DSN) 2002, IEEE CS Press, 2002.
14. Kulkarni, V.G.: Modeling and Analysis of Stochastic Systems.Chapman& Hall, 1995.
15. Kwiatkowska, M., Norman, G., Parker D.: PRISM: Probabilistic Symbolic Model Checker. In Proc. TOOLS 2002, volume 2324 of LNCS, p. 200-204, Springer-Verlag April 2002.
16. Muller, A. and Stoyan, D.: Comparison Methods for Stochastic Models and Risks, Wiley , New York, 2002.
17. Pekergin N.: Stochastic performance bounds by state space reduction. Performance Evaluation, 36-37, pages 1-17, 1999.
18. Shaked, M. and Shantikumar, J.G.: Stochastic Orders and Their Applications, Academic Press, San Diago, 1994.
19. Stewart W. J: Introduction to the Numerical Solution of Markov Chains. Princeton University Press, (1994)