98 search results - page 9 / 20 » Weak Bisimulation for Probabilistic Systems |
SEW
2006
IEEE
15 years 3 months ago
2006
IEEE
Complex software systems typically involve features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formaliz...
LICS
1999
IEEE
15 years 1 months ago
1999
IEEE
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
POPL
2000
ACM
15 years 1 months ago
2000
ACM
It has been shown that secret information can be leaked to external observers through covert timing channels. In this paper we are concerned with a kind of timing attack that want...
ATVA
2004
Springer
15 years 2 months ago
2004
Springer
Timed Bisimulation Preserving Abstraction for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, ...
CONCUR
2001
Springer
15 years 2 months ago
2001
Springer
We present a process algebraic approach for extending to the probabilistic setting the classical logical information flow analysis of computer systems. In particular, we employ a ...