Out-of-Core Solution of Large Linear Systems of Equations Arising from Stochastic Modelling
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Automated Performance and Dependability Evaluation Using Model Checking
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
Validation of GSPN and SWN Models through the PROD Tool
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Statistical probabilistic model checking with a focus on time-bounded properties
Information and Computation
Formal analysis techniques for gossiping protocols
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Using quantitative analysis to implement autonomic IT systems
ICSE '09 Proceedings of the 31st International Conference on Software Engineering
INFAMY: An Infinite-State Markov Model Checker
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Efficient Probabilistic Model Checking on General Purpose Graphics Processors
Proceedings of the 16th International SPIN Workshop on Model Checking Software
Time-Bounded Model Checking of Infinite-State Continuous-Time Markov Chains
Fundamenta Informaticae - Application of Concurrency to System Design
Bisimulation minimisation mostly speeds up probabilistic model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Performability assessment by model checking of Markov reward models
Formal Methods in System Design
Dependability metrics
The ins and outs of the probabilistic model checker MRMC
Performance Evaluation
Measuring performance of continuous-time stochastic processes using timed automata
Proceedings of the 14th international conference on Hybrid systems: computation and control
K*: A heuristic search algorithm for finding the k shortest paths
Artificial Intelligence
Extended directed search for probabilistic timed reachability
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Model checking infinite-state markov chains
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Model checking interactive markov chains
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Quantitative timed analysis of interactive markov chains
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Time-Bounded Model Checking of Infinite-State Continuous-Time Markov Chains
Fundamenta Informaticae - Application of Concurrency to System Design
| Hi-index | 0.00 |
Over the last two decades, many techniques have been developed to specify and evaluate Markovian dependability models. Most often, these Markovian models are automatically derived from stochastic Petri nets, stochastic process algebras, or stochastic activity networks. However, whereas the model specification has become very comfortable, the specification of the dependability measures of interest most often has remained cumbersome. In this paper, we show that our recently introduced logic CSL (continuous stochastic logic) provides ample means to specify state- as well as path-based dependability measures in a compact and flexible way. Moreover, due to the formal syntax and semantics of CSL, we can exploit the structure of CSL-specified dependability measures in the dependability evaluation process. Typically, the underlying Markov chains that need to be evaluated can be reduced considerably in size by this structure exploitation.