Model checking expected time and expected reward formulae with random time bounds

Computers and Mathematics with Applications

Volumn 51, Issue 2, 2006, Pages 305-316

  Kwiatkowska, M ^a   Norman, G ^a   Pacheco, A ^b  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

^b INSTITUTO SUPERIOR TÉCNICO   (Portugal)

Author keywords

Continuous stochastic logic; Continuous time Markov chains; Expected reward operator; Expected time operator; Markov reward processes; Mixed Poisson expected sojourn times; Uniformisation

Indexed keywords

FORMAL LOGIC; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PARAMETER ESTIMATION; POISSON DISTRIBUTION;

CONTINUOUS STOCHASTIC LOGIC; CONTINUOUS TIME MARKOV CHAINS; EXPECTED REWARD OPERATOR; EXPECTED TIME OPERATOR; MARKOV REWARD PROCESSES; MIXED POISSON EXPECTED SOJOURN TIMES; UNIFORMISATION;

RANDOM PROCESSES;

EID: 33244482257     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.camwa.2005.11.016     Document Type: Conference Paper

References (19)

1. st Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM/PROBMIV'01) Lecture Notes in Computer Science Volume 2165 2001 Springer-Verlag Chichester 23 38
2. th International Conference on Computer Aided Verification (CAV'96) Lecture Notes in Computer Science Volume 1102 1996 Springer-Verlag 269 276
3. A. Aziz, K. Sanwal, V. Singhal, and R. Brayton Model checking continuous time Markov chains ACM Transactions on Computational Logic 1 1 2000 162 170
4. th International Conference on Concurrency Theory (CONCUR'99) Lecture Notes in Computer Science Volume 1664 1999 Springer-Verlag 146 161
5. E. Clarke, E. Emerson, and A. Sistla Automatic verification of finite-state concurrent systems using temporal logic specifications ACM Transactions on Programming Languages and Systems 8 2 1986 244 263
6. H. Hansson, and B. Jonsson A logic for reasoning about time and probability Formal Aspects of Computing 6 1994 512 535
7. th International Conference on Computer Aided Verification (CAV'00) Lecture Notes in Computer Science Volume 1855 2000 Springer-Verlag 358 372
8. A. Jensen Markov chains as an aid in the study of Markov processes Skandinavisk Aktuarietidsskrift, Marts. 1953 87 91
9. D. Gross, and D. Miller The randomization technique as a modeling tool and solution procedure for transient Markov processes Operations Research 32 2 1984 343 361
10. th International Conference on Modelling Techniques and Tools for Computer Performance Evaluation (TOOLS'02) Lecture Notes in Computer Science Volume 2324 2002 Springer-Verlag 200 204
11. R. German Performance Analysis of Communication Systems: Modeling with Non-Markovian Stochastic Petri Nets 2000 John Wiley and Sons
12. st Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM/PROBMIV'01) Lecture Notes in Computer Science Volume 2165 2001 Springer-Verlag 57 70
13. nd Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification (PAPM/PROBMIV'02) Lecture Notes in Computer Science Volume 2399 2002 Springer-Verlag 152 168
14. th Annual IEEE International Workshop on High Level Design Validation and Test (HLDVT'02) 2002 IEEE Computer Society Press 45 50
15. M. Telek, A. Pfening, and G. Fodor An effective numerical method to compute the moments of the completion time of Markov reward models Computers Math. Applic. 36 8 1998 59 65
16. V.G. Kulkarni Modeling and Analysis of Stochastic Systems 1995 Chapman and Hall
17. S.I. Resnick A Probability Path 1999 Birkhäuser
18. J. Muppala, and K. Trivedi Numerical transient solution of finite Markovian queueing systems U. Bhat I. Basawa Queueing Systems, Queueing and Related Models 1992 Oxford University Press Boston, MA 262 284
19. Q. Qiu, Q. Wu, and M. Pedram Stochastic modeling of a power-managed system: Construction and optimization IEEE Transactions on Computer Aided Design 20 9 2001 1200 1217