321 search results - page 2 / 65 » Symbolic Model Checking for Probabilistic Timed Automata |
136
click to vote
QEST
2008
IEEE
15 years 9 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...
145
Voted
CAV
2003
Springer
15 years 8 months ago
2003
Springer
148
Voted
FORMATS
2006
Springer
15 years 7 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 ...
133
Voted
ENTCS
2002
15 years 3 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...
140
Voted
QEST
2010
IEEE
15 years 1 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...