32 search results - page 5 / 7 » Model Checking Probabilistic Timed Automata with One or Two ... |
ACSD
2006
IEEE
14 years 1 months ago
2006
IEEE
Timed Automata (TA) and Time Petri Nets (TPN) are two well-established formal models for real-time systems. Recently, a linear transformation of TA to TPNs preserving reachability...
TACAS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We study schedulability problems of timed systems with nonuniformly recurring computation tasks. Assume a set of real time tasks whose best and worst execution times, and...
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...
TASE
2008
IEEE
13 years 7 months ago
2008
IEEE
Soon after the birth of the flourishing research area of model checking in the early eighties, researchers started to apply this technique to finite automata equipped with probabi...
TCS
2002
13 years 7 months ago
2002
We consider the timed automata model of [3], which allows the analysis of realtime systems expressed in terms of quantitative timing constraints. Traditional approaches to real-ti...