[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.5555/645683.664572guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

The Metric Analogue of Weak Bisimulation for Probabilistic Processes

Published: 22 July 2002 Publication History

Abstract

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.

Cited By

View all
  1. The Metric Analogue of Weak Bisimulation for Probabilistic Processes

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image Guide Proceedings
    LICS '02: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
    July 2002
    253 pages
    ISBN:0769514839

    Publisher

    IEEE Computer Society

    United States

    Publication History

    Published: 22 July 2002

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 03 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2017)Probabilistic bisimilarity distancesACM SIGLOG News10.1145/3157831.31578374:4(33-51)Online publication date: 3-Nov-2017
    • (2017)A semantic account of metric preservationACM SIGPLAN Notices10.1145/3093333.300989052:1(545-556)Online publication date: 1-Jan-2017
    • (2017)A semantic account of metric preservationProceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages10.1145/3009837.3009890(545-556)Online publication date: 1-Jan-2017
    • (2017)Differential privacy in probabilistic systemsInformation and Computation10.1016/j.ic.2017.03.002254:P1(84-104)Online publication date: 1-Jun-2017
    • (2017)Quantifying Vulnerability of Secret Generation Using Hyper-DistributionsProceedings of the 6th International Conference on Principles of Security and Trust - Volume 1020410.1007/978-3-662-54455-6_2(26-48)Online publication date: 22-Apr-2017
    • (2015)Probabilistic bisimulationACM SIGLOG News10.1145/2815493.28155012:3(72-84)Online publication date: 17-Aug-2015
    • (2015)Metric reasoning about λ-termsProceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)10.1109/LICS.2015.64(633-644)Online publication date: 6-Jul-2015
    • (2015)Converging from Branching to Linear Metrics onźMarkov ChainsProceedings of the 12th International Colloquium on Theoretical Aspects of Computing - ICTAC 2015 - Volume 939910.1007/978-3-319-25150-9_21(349-367)Online publication date: 29-Oct-2015
    • (2014)Bisimulation metrics are optimal value functionsProceedings of the Thirtieth Conference on Uncertainty in Artificial Intelligence10.5555/3020751.3020774(210-219)Online publication date: 23-Jul-2014
    • (2012)Quantitative information flow in interactive systemsJournal of Computer Security10.5555/2590715.259071720:1(3-50)Online publication date: 1-Jan-2012
    • Show More Cited By

    View Options

    View options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media