144 search results - page 25 / 29 » Model checking the probabilistic pi-calculus |
CTRSA
2012
Springer
12 years 3 months ago
2012
Springer
We study the problem of searching on encrypted data, where the search is performed using a plaintext message or a keyword, rather than a message-specific trapdoor as done by state...
WCNC
2008
IEEE
14 years 1 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 ...
QEST
2008
IEEE
14 years 1 months ago
2008
IEEE
We present Hintikka games for formulae of the probabilistic temporal logic PCTL and countable labeled Markov chains as models, giving an operational account of the denotational se...
QEST
2006
IEEE
14 years 1 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...
IPPS
2006
IEEE
14 years 1 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...