Formal analysis techniques for gossiping protocols
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Least Upper Bounds for Probability Measures and Their Applications to Abstractions
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Abstraction for Stochastic Systems by Erlang's Method of Stages
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Game-Based Probabilistic Predicate Abstraction in PRISM
Electronic Notes in Theoretical Computer Science (ENTCS)
Model Checking Quantitative Linear Time Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Analysis of a gossip protocol in PRISM
ACM SIGMETRICS Performance Evaluation Review
Abstraction Refinement for Probabilistic Software
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Approximating Probabilistic Behaviors of Biological Systems Using Abstract Interpretation
Electronic Notes in Theoretical Computer Science (ENTCS)
Sliding Window Abstraction for Infinite Markov Chains
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
On Quantitative Software Verification
Proceedings of the 16th International SPIN Workshop on Model Checking Software
Refinement Sensitive Formal Semantics of State Machines With Persistent Choice
Electronic Notes in Theoretical Computer Science (ENTCS)
Compositional Abstraction for Stochastic Systems
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Stochastic Games for Verification of Probabilistic Timed Automata
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
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
Three-valued abstraction for continuous-time Markov chains
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Magnifying-lens abstraction for Markov decision processes
CAV'07 Proceedings of the 19th international conference on Computer aided verification
A counterexample-guided abstraction-refinement framework for markov decision processes
ACM Transactions on Computational Logic (TOCL)
A game-based abstraction-refinement framework for Markov decision processes
Formal Methods in System Design
A framework for verification of software with time and probabilities
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Time-bounded reachability in tree-structured QBDs by abstraction
Performance Evaluation
A linear process-algebraic format with data for probabilistic automata
Theoretical Computer Science
Probabilistic model checking of biological systems with uncertain kinetic rates
Theoretical Computer Science
Best probabilistic transformers
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
PASS: abstraction refinement for infinite probabilistic models
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A general framework for probabilistic characterizing formulae
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Heuristics for probabilistic timed automata with abstraction refinement
MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
p-Automata: New foundations for discrete-time probabilistic verification
Performance Evaluation
Mechanized extraction of topology anti-patterns in wireless networks
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
Variable probabilistic abstraction refinement
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Probabilistic graph transformation systems
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
An analysis for proving probabilistic termination of biological systems
Theoretical Computer Science
Least upper bounds for probability measures and their applications to abstractions
Information and Computation
Model checking for probabilistic timed automata
Formal Methods in System Design
Hi-index | 0.00 |
In this paper we present a novel abstraction technique for Markov decision processes (MDPs), which are widely used for modelling systems that exhibit both probabilistic and nondeterministic behaviour. In the field of model checking, abstraction has proved an extremely successful tool to combat the state-space explosion problem. In the probabilistic setting, however, little practical progress has been made in this area. We propose an abstraction method for MDPs based on stochastic two-player games. The key idea behind this approach is to maintain a separation between nondeterminism present in the original MDP and nondeterminism introduced through abstraction, each type being represented by a different player in the game. Crucially, this allows us to obtain distinct lower and upper bounds for both the best and worst-case performance (minimum or maximum probabilities) of the MDP. We have implemented our techniques and illustrate their practical utility by applying them to a quantitative analysis of the Zeroconf dynamic network configuration protocol.