244 search results - page 45 / 49 » Counterexamples in Probabilistic Model Checking |
WCNC
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— This paper explores integrated source-channel decoding, driven by wireless sensor network applications where correlated information acquired by the network is gathered ...
198
click to vote
POPL
2008
ACM
15 years 12 months ago
2008
ACM
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
QEST
2006
IEEE
15 years 5 months ago
2006
IEEE
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...
106
click to vote
IPPS
2006
IEEE
15 years 5 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...
FOSSACS
2003
Springer
15 years 4 months ago
2003
Springer
rized Verification by Probabilistic Abstraction . . . . . . . . . . . . . . . . 87 Tamarah Arons, Amir Pnueli, Lenore Zuck Genericity and the π-Calculus . . . . . . . . . . . . ....