Model checking interactive markov chains

Authors:
Lijun Zhang;Martin R. Neuhäußer
Affiliations:
Oxford University Computing Laboratory, UK;Software Modeling and Verification Group, RWTH Aachen University, Germany
Venue:
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Year:
2010

Citing 18
Cited 13

Matrix multiplication via arithmetic progressions

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A compositional approach to performance modelling

A compositional approach to performance modelling
Automated compositional Markov chain generation for a plain-old telephone system

Science of Computer Programming
Process algebra for performance evaluation

Theoretical Computer Science
Dynamic Programming and Optimal Control, Two Volume Set

Dynamic Programming and Optimal Control, Two Volume Set
Model Checking of Probabalistic and Nondeterministic Systems

Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Verifying Continuous Time Markov Chains

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
On the Use of Model Checking Techniques for Dependability Evaluation

SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
Model-Checking Algorithms for Continuous-Time Markov Chains

IEEE Transactions on Software Engineering
Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes

Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
CSL Model Checking for Generalized Stochastic Petri Nets

QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Quantitative evaluation in embedded system design: validation of multiprocessor multithreaded architectures

Proceedings of the conference on Design, automation and test in Europe
sPBC: A Markovian Extension of Petri Box Calculus with Immediate Multiactions

Fundamenta Informaticae
Compositional Dependability Evaluation for STATEMATE

IEEE Transactions on Software Engineering
Delayed Nondeterminism in Continuous-Time Markov Decision Processes

FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Towards Performance Prediction of Compositional Models in Industrial GALS Designs

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Reachability in Stochastic Timed Games

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Interactive Markov chains: and the quest for quantified quality

Interactive Markov chains: and the quest for quantified quality

A study of shared-memory mutual exclusion protocols using CADP

FMICS'10 Proceedings of the 15th international conference on Formal methods for industrial critical systems
Towards analysis of semi-Markov decision processes

AICI'10 Proceedings of the 2010 international conference on Artificial intelligence and computational intelligence: Part I
Time-bounded reachability in distributed input/output interactive probabilistic chains

SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
The how and why of interactive Markov chains

FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Ten years of performance evaluation for concurrent systems using CADP

ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
Model checking algorithms for CTMDPs

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Model-checking and simulation for stochastic timed systems

FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
Quantitative timed analysis of interactive markov chains

NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Playing optimally on timed automata with random delays

FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Model checking and performance evaluation with CADP illustrated on shared-memory mutual exclusion protocols

Science of Computer Programming
A semantics for every GSPN

PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Compositional verification and optimization of interactive markov chains

CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Modelling, reduction and analysis of markov automata

QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hermanns has introduced interactive Markov chains (IMCs) which arise as an orthogonal extension of labelled transition systems and continuous-time Markov chains (CTMCs). IMCs enjoy nice compositional aggregation properties which help to minimize the state space incrementally. However, the model checking problem for IMCs remains unsolved apart from those instances, where the IMC can be converted into a CTMC. This paper tackles this problem: We interpret the continuous stochastic logic (CSL) over IMCs and define the semantics of probabilistic CSL formulas with respect to the class of fully time and history dependent schedulers. Our main contribution is an efficient model checking algorithm for verifying CSL formulas on IMCs. Moreover, we show the applicability of our approach and provide some experimental results.