The complexity of stochastic games
Information and Computation
Symbolic model checking for real-time systems
Information and Computation
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Automatic verification of real-time systems with discrete probability distributions
Theoretical Computer Science
On probabilistic timed automata
Theoretical Computer Science
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Verifying Progress in Timed Systems
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM
International Journal on Software Tools for Technology Transfer (STTT)
Checking Timed Büchi Automata Emptiness Efficiently
Formal Methods in System Design
Performance analysis of probabilistic timed automata using digital clocks
Formal Methods in System Design
Game-based Abstraction for Markov Decision Processes
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Symbolic model checking for probabilistic timed automata
Information and Computation
SAT-based Abstraction Refinement for Real-time Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Time-Abstracting Bisimulation for Probabilistic Timed Automata
TASE '08 Proceedings of the 2008 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering
Abstraction Refinement for Probabilistic Software
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Automatic abstraction refinement for timed automata
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
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
Superposition-based analysis of first-order probabilistic timed automata
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
PRISM 4.0: verification of probabilistic real-time systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Safety verification for probabilistic hybrid systems
CAV'10 Proceedings of the 22nd 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
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
A model checker for hierarchical probabilistic real-time systems
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
An extension of the inverse method to probabilistic timed automata
Formal Methods in System Design
Formal verification of real-time wireless sensor networks protocols with realistic radio links
Proceedings of the 21st International conference on Real-Time Networks and Systems
Model checking for probabilistic timed automata
Formal Methods in System Design
Hi-index | 0.00 |
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic timed automata, forwards reachability is the analysis method of choice, since it can be implemented extremely efficiently. However, for PTAs, such techniques are only able to compute upper bounds on maximum reachability probabilities. In this paper, we propose a new approach to the analysis of PTAs using abstraction and stochastic games. We show how efficient forwards reachability techniques can be extended to yield both lower and upper bounds on maximum (and minimum) reachability probabilities. We also present abstraction-refinement techniques that are guaranteed to improve the precision of these probability bounds, providing a fully automatic method for computing the exact values. We have implemented these techniques and applied them to a set of large case studies. We show that, in comparison to alternative approaches to verifying PTAs, such as backwards reachability and digital clocks, our techniques exhibit superior performance and scalability.