The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Dynamic Programming and Optimal Control
Dynamic Programming and Optimal Control
Finite State Markovian Decision Processes
Finite State Markovian Decision Processes
Algebric Decision Diagrams and Their Applications
Formal Methods in System Design
Probabilistic Simulations for Probabilistic Processes
CONCUR '94 Proceedings of the Concurrency Theory
Weak Bisimulation for Fully Probabilistic Processes
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Quantitative solution of omega-regular games
Journal of Computer and System Sciences - STOC 2001
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Abstract interpretation of programs as Markov decision processes
Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
On finite-state approximants for probabilistic computation tree logic
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Game-based Abstraction for Markov Decision Processes
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Model minimization in Markov decision processes
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Don’t know in probabilistic systems
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
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)
Abstraction Refinement for Probabilistic Software
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Sliding Window Abstraction for Infinite Markov Chains
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Compositional Abstraction for Stochastic Systems
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
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
Probabilistic Logical Characterization
Information and Computation
Time-bounded reachability in tree-structured QBDs by abstraction
Performance Evaluation
Symbolic algorithms for qualitative analysis of Markov decision processes with Buchi objectives
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
A linear process-algebraic format with data for probabilistic automata
Theoretical Computer Science
Scaling probabilistic timing verification of hardware using abstractions in design source code
Proceedings of the International Conference on Formal Methods in Computer-Aided Design
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
Proximity-based non-uniform abstractions for approximate planning
Journal of Artificial Intelligence Research
Variable probabilistic abstraction refinement
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
An analysis for proving probabilistic termination of biological systems
Theoretical Computer Science
Quantitative abstraction refinement
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
Formal Methods in System Design
| Hi-index | 0.00 |
We present a novel abstraction technique which allows the analysis of reachability and safety properties of Markov decision processes with very large state spaces. The technique, called magnifying-lens abstraction, (MLA) copes with the state-explosion problem by partitioning the state-space into regions, and by computing upper and lower bounds for reachability and safety properties on the regions, rather than on the states. To compute these bounds, MLA iterates over the regions, considering the concrete states of each region in turn, as if one were sliding across the abstraction a magnifying lens which allowed viewing the concrete states. The algorithm adaptively refines the regions, using smaller regions where more detail is needed, until the difference between upper and lower bounds is smaller than a specified accuracy. We provide experimental results on three case studies illustrating that MLA can provide accurate answers, with savings in memory requirements.