Communicating sequential processes
Communicating sequential processes
Bisimulation through probabilistic testing
Information and Computation
Minimal state graph generation
Science of Computer Programming
Proof-checking a data link protocol
TYPES '93 Proceedings of the international workshop on Types for proofs and programs
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Multi-Terminal Binary Decision Diagrams: An Efficient DataStructure for Matrix Representation
Formal Methods in System Design
Algebric Decision Diagrams and Their Applications
Formal Methods in System Design
Reachability Analysis of Probabilistic Systems by Successive Refinements
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
A Bounded Retransmission Protocol for Large Data Packets
AMAST '96 Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology
The Bounded Retransmission Protocol Must Be on Time!
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Minimization of Timed Transition Systems
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Partition Refinement in Real-Time Model Checking
FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
It Usually Works: The Temporal Logic of Stochastic Systems
Proceedings of the 7th International Conference on Computer Aided Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Quantitative Analysis and Model Checking
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Formal Methods in System Design
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reachability Analysis of Probabilistic Systems by Successive Refinements
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Possibilistic and Probabilistic Abstraction-Based Model Checking
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Verifying Randomized Byzantine Agreement
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Performance Evaluation: = (Process Algebra + Model Checking) × Markov Chains
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Simulation for Continuous-Time Markov Chains
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
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
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
Probabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
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
Time-bounded reachability in tree-structured QBDs by abstraction
Performance Evaluation
A linear process-algebraic format with data for probabilistic automata
Theoretical Computer Science
Partial order reduction for markov decision processes: a survey
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Symbolic and parametric model checking of discrete-time markov chains
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
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
Safety verification for probabilistic hybrid systems
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
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
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
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
LTL model checking of interval markov chains
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Automated reliability estimation over partial systematic explorations
Proceedings of the 2013 International Conference on Software Engineering
State-of-the-art tools and techniques for quantitative modeling and analysis of embedded systems
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Tulip: model checking probabilistic systems using expectation maximisation algorithm
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Least upper bounds for probability measures and their applications to abstractions
Information and Computation
Algorithmic probabilistic game semantics
Formal Methods in System Design
| Hi-index | 0.00 |
We report on a novel development to model check quantitative reachability properties on Markov decision processes together with its prototype implementation. The innovation of the technique is that the analysis is performed on an abstraction of the model under analysis. Such an abstraction is significantly smaller than the original model and may safely refute or accept the required property. Otherwise, the abstraction is refined and the process repeated. As the numerical analysis necessary to determine the validity of the property is more costly than the refinement process, the technique profits from applying such numerical analysis on smaller state spaces.