Probabilistic Timed Automata for Security Analysis and Design
| Citations: | 1 - 1 self |
BibTeX
@MISC{Troina_probabilistictimed,
author = {Angelo Troina and Supervisor Prof and Andrea Maggiolo Schettini and Referee Prof and Catuscia Palamidessi and Referee Prof and Christel Baier},
title = {Probabilistic Timed Automata for Security Analysis and Design},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
4 Abstract The usefulness of formal methods for the description and verification of complex systems is nowa-days widely accepted. While some system properties can be studied in a non-timed and nonprobabilistic setting, others, such as quantitative security properties, system performance andreliability properties, require a timed and probabilistic description of the system. This thesis focuses on methods for the formal modeling of probabilistic timed systems, and on algorithms forthe automated verification of their properties. The models considered describe the behavior of a system in terms of time and probability, and the formal description languages used are based onextensions of Timed Automata, Markov Decision Processes and combinations of them.
