34 search results - page 7 / 7 » Counterexamples for Timed Probabilistic Reachability |
94
Voted
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
Advanced wireless sensor network algorithms pose challenges to their formal modeling and analysis, such as modeling probabilistic and real-time behaviors and novel forms of commun...
108
click to vote
EPEW
2007
Springer
15 years 1 months ago
2007
Springer
In mobile ad hoc networks (MANETs), broadcasting plays a fundamental role, diffusing a message from a given source node to all the other nodes in the network. Flooding is the simpl...
ACSD
2008
IEEE
14 years 11 months ago
2008
IEEE
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The success of probabilistic model checking for discrete-time Markov decision processes and continuous-time Markov chains has led to rich academic and industrial applications. The ...