321 search results - page 28 / 65 » Symbolic Model Checking for Probabilistic Timed Automata |
CONCUR
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Delaying the synchronization of actions may reveal some hidden behavior that would not happen if the synchronization met the specified deadlines. This precise phenomenon...
TASE
2008
IEEE
13 years 8 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...
FM
2001
Springer
14 years 1 months ago
2001
Springer
Classical logic cannot be used to effectively reason about systems with uncertainty (lack of essential information) or inconsistency (contradictory information often occurring when...
QEST
2007
IEEE
14 years 3 months ago
2007
IEEE
— Probabilistic models are widely used to analyze embedded, networked, and more recently biological systems. Existing numerical analysis techniques are limited to finitestate mo...
CONCUR
2006
Springer
13 years 10 months ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...