Performance analysis of probabilistic timed automata using digital clocks
Formal Methods in System Design
Symbolic model checking for probabilistic timed automata
Information and Computation
Stochastic Games for Verification of Probabilistic Timed Automata
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
A Decidable Probability Logic for Timed Probabilistic Systems
Fundamenta Informaticae
Trace Machines for Observing Continuous-Time Markov Chains
Electronic Notes in Theoretical Computer Science (ENTCS)
Quantitative Analysis With the Probabilistic Model Checker PRISM
Electronic Notes in Theoretical Computer Science (ENTCS)
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
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
PRTS: an approach for model checking probabilistic real-time hierarchical systems
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Stochastic restricted broadcast process theory
EPEW'11 Proceedings of the 8th European conference on Computer Performance Engineering
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
| Hi-index | 0.00 |
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time model checker Kronos and the probabilistic model checker Prism. The system is modelled as a probabilistic timed automaton. We first use Kronos to perform a symbolic forwards reachability analysis to generate the set of states that are reachable with non-zero probability from the initial state and before the deadline expires. We then encode this information as a Markov decision process to be analyzed with Prism. We apply this technique to compute the minimal probability of a leader being elected before a deadline, for different deadlines, and study how this minimal probability is influenced by using a biased coin and considering different wire lengths.