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
Partial order methods for statistical model checking and simulation
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Performability modeling of exceptions-aware systems in multiformalism tools
ASMTA'11 Proceedings of the 18th international conference on Analytical and stochastic modeling techniques and applications
PRISM 4.0: verification of probabilistic real-time systems
CAV'11 Proceedings of the 23rd 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
mctau: bridging the gap between modest and UPPAAL
SPIN'12 Proceedings of the 19th international conference on Model Checking Software
Modelling and decentralised runtime control of self-stabilising power micro grids
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
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
Model checking for probabilistic timed automata
Formal Methods in System Design
A compositional modelling and analysis framework for stochastic hybrid systems
Formal Methods in System Design
| Hi-index | 0.00 |
Probabilistic timed automata (PTA) combine discrete probabilistic choice, real time and nondeterminism. This paper presents a fully automatic tool for model checking PTA with respect to probabilistic and expected reachability properties. PTA are specified in Modest, a high-level compositional modelling language that includes features such as exception handling, dynamic parallelism and recursion, and thus enables model specification in a convenient fashion. For model checking, we use an integral semantics of time, representing clocks with bounded integer variables. This makes it possible to use the probabilistic model checker PRISM as analysis backend. We describe details of the approach and its implementation, and report results obtained for three different case studies.