321 search results - page 2 / 65 » Symbolic Model Checking for Probabilistic Timed Automata |
QEST
2008
IEEE
14 years 1 months ago
2008
IEEE
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
CAV
2003
Springer
14 years 20 days ago
2003
Springer
FORMATS
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...
ENTCS
2002
13 years 7 months ago
2002
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...
QEST
2010
IEEE
13 years 5 months ago
2010
IEEE
We introduce Fortuna, the first tool for model checking priced probabilistic timed automata (PPTAs). Fortuna can handle the combination of real-time, probabilistic and cost feature...