98 search results - page 6 / 20 » Weak Bisimulation for Probabilistic Systems |
105
click to vote
QEST
2008
IEEE
15 years 3 months ago
2008
IEEE
We tackle the problem of non robustness of simulation and bisimulation when dealing with probabilistic processes. It is important to ignore tiny deviations in probabilities becaus...
CCS
2006
ACM
15 years 1 months ago
2006
ACM
Type systems for secure information flow aim to prevent a program from leaking information from variables classified as H to variables classified as L. In this work we extend such...
BIRTHDAY
2000
Springer
15 years 1 months ago
2000
Springer
The axiom system ACP of [10] was extended to discrete time in [6]. Here, we proceed to define the silent step in this theory in branching bisimulation semantics [7, 15] rather th...
103
click to vote
FOSSACS
1999
Springer
15 years 1 months ago
1999
Springer
This paper presents a mu-calculus-based modal logic for describing properties of reactive probabilistic labeled transition systems (RPLTSs) and develops a modelchecking algorithm ...
104
click to vote
CBSE
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Automata-based interface and protocol specifications provide an elegant framework to capture and automatically verify the interactive behavior of component-based software...