Weak Bisimulation is Sound and Complete for PCTL*
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
A process-algebraic approach for the analysis of probabilistic noninterference
Journal of Computer Security
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
Metrics for finite Markov decision processes
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
A behavioural pseudometric for metric labelled transition systems
CONCUR 2005 - Concurrency Theory
On finite-state approximants for probabilistic computation tree logic
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Bisimulation and cocongruence for probabilistic systems
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Approximating and computing behavioural distances in probabilistic transition systems
Theoretical Computer Science
Measuring the confinement of probabilistic systems
Theoretical Computer Science - Theoretical foundations of security analysis and design II
Recursively defined metric spaces without contraction
Theoretical Computer Science
Proving Approximate Implementations for Probabilistic I/O Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Characterize branching distance in terms of (η,α)-bisimilarity
Information and Computation
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
A Behavioural Pseudometric based on λ--Bisimilarity
Electronic Notes in Theoretical Computer Science (ENTCS)
Quantifying Timing Leaks and Cost Optimisation
ICICS '08 Proceedings of the 10th International Conference on Information and Communications Security
On metrics for probabilistic systems: Definitions and algorithms
Computers & Mathematics with Applications
ISPEC '09 Proceedings of the 5th International Conference on Information Security Practice and Experience
Metrics for finite Markov decision processes
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Measuring Anonymous Systems with the Probabilistic Applied Pi Calculus
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part II
The Kantorovich Metric in Computer Science: A Brief Survey
Electronic Notes in Theoretical Computer Science (ENTCS)
Security, Probability and Nearly Fair Coins in the Cryptographers' Café
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Weak Bisimulation for Action-Type Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
A Quantitative Approach to Noninterference for Probabilistic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Metrics for Action-labelled Quantitative Transition Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Bisimulation and cocongruence for probabilistic systems
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Discounting the future in systems theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Approximating a behavioural pseudometric without discount for probabilistic systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Non-expansive ε-bisimulations for probabilistic processes
Theoretical Computer Science
Measuring anonymity with relative entropy
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
Timed, distributed, probabilistic, typed processes
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Simulation hemi-metrics between infinite-state stochastic games
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Approximating labelled Markov processes again!
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Weak bisimulation for Probabilistic Timed Automata
Theoretical Computer Science
Information flow in interactive systems
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
ARSPA-WITS'10 Proceedings of the 2010 joint conference on Automated reasoning for security protocol analysis and issues in the theory of security
An accessible approach to behavioural pseudometrics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Computing the leakage of information-hiding systems
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
On behavioural pseudometrics and closure ordinals
Information Processing Letters
Bisimulation Metrics for Continuous Markov Decision Processes
SIAM Journal on Computing
Dexter kozen's influence on the theory of labelled markov processes
Logic and Program Semantics
A pseudometric in supervisory control of probabilistic discrete event systems
Discrete Event Dynamic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Quantitative information flow in interactive systems
Journal of Computer Security - ARSPA-WITS'10
| Hi-index | 0.00 |
We observe that equivalence is not a robust concept in the presence of numerical information 驴 such as probabilities 驴 in the model. We develop a metric analogue of weak bisimulation in the spirit of our earlier work on metric analogues for strong bisimulation. We give a fixed point characterization of the metric. This makes available coinductive reasoning principles and allows us to prove metric analogues of the usual algebraic laws for process combinators. We also show that quantitative properties of interest are continuous with respect to the metric, which says that if two processes are close in the metric then observable quantitative properties of interest are indeed close. As an important example of this we show that nearby processes have nearby channel capacities 驴 a quantitative measure of their propensity to leak information.