Fortuna: Model Checking Priced Probabilistic Timed Automata

J. Berendsen,
D.N. Jansen
and F.W. Vaandrager.
Fortuna: Model Checking Priced Probabilistic Timed Automata.
In Quantitative Evaluation of Systems (QEST), 2010 Seventh International Conference on the,
Williamsburg, VA, 15-18 September 2010, pp 273-281.
Full version available as Technical Report, ICIS, Radboud University Nijmegen, 2009.
Abstract

Fortuna
is the first tool for model checking priced probabilistic timed automata (PPTAs).
Fortuna can handle the *combination* of real-time,
probabilistic and cost features. This is required for addressing key design trade-offs that arise in many practical applications such as
the Zeroconf, Bluetooth, IEEE802.11 and Firewire protocols, protocols for sensor networks, and scheduling problems with failures.
PPTAs are an extension of probabilistic timed automata (PTAs) with cost-rates and discrete cost increments on states.
Fortuna is able to compute the maximal probability by which a class of states
can be reached under a certain cost-bound (and time bound.) Although this problem is undecidable in general, there exists a semi-algorithm that produces a non-decreasing sequence of maximal probabilities. This paper enhances that algorithm. We compared the performance of
Fortuna with existing approaches for PTAs. Surprisingly, although PPTAs are more general, our techniques exhibit superior performance.
Local copy:pdf

DOI:10.1109/QEST.2010.41

Technical report

Fortuna homepage