Approximated computationally bounded simulation relations for probabilistic automata

被引：10
|
作者：
Segala, Roberto [1 ]
Turrini, Andrea [1 ]
机构：
[1] Univ Verona, Dipartimento Informat, I-37100 Verona, Italy
来源：
20TH IEEE COMPUTER SECURITY FOUNDATIONS SYMPOSIUM (CSFS20), PROCEEDINGS | 2007年
关键词：
D O I：
10.1109/CSF.2007.8
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. These relations are meant to provide rigorous grounds to parts of correctness proofs for cryptographic protocols that are usually carried out by semi-formal arguments. We illustrate our ideas by recasting a correctness proof of Bellare and Rogaway based on the notion of matching conversation.
引用
收藏
页码：140 / +
页数：2
相关论文
共 50 条
  • [21] EFFICIENT SIMULATION-BASED VERIFICATION OF PROBABILISTIC TIMED AUTOMATA
    Hartmanns, Arnd
    Sedwards, Sean
    D'Argenio, Pedro R.
    2017 WINTER SIMULATION CONFERENCE (WSC), 2017, : 1419 - 1430
  • [22] FAIR SIMULATION FOR NONDETERMINISTIC AND PROBABILISTIC BUCHI AUTOMATA: A COALGEBRAIC PERSPECTIVE
    Urabe, Natsuki
    Hasuo, Ichiro
    LOGICAL METHODS IN COMPUTER SCIENCE, 2017, 13 (03)
  • [23] PROBABILISTIC AUTOMATA
    RABIN, MO
    INFORMATION AND CONTROL, 1963, 6 (03): : 230 - &
  • [24] Verification of temporal properties on hybrid automata by simulation relations
    D'Innocenzo, A.
    Julius, A. A.
    Pappas, G. J.
    Di Benedeto, M. D.
    Di Gennaro, S.
    PROCEEDINGS OF THE 46TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-14, 2007, : 4338 - +
  • [25] Probabilistic ω-Automata
    Baier, Christel
    Groesser, Marcus
    Bertrand, Nathalie
    JOURNAL OF THE ACM, 2012, 59 (01)
  • [26] Probabilistic Automata and Probabilistic Logic
    Weidner, Thomas
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012, 2012, 7464 : 813 - 824
  • [27] Computationally efficient reasoning using approximated fuzzy intervals
    Gera, Zsolt
    FUZZY SETS AND SYSTEMS, 2007, 158 (07) : 689 - 703
  • [28] One-Way Bounded-Error Probabilistic Pushdown Automata and Kolmogorov Complexity
    Yamakami, Tomoyuki
    DEVELOPMENTS IN LANGUAGE THEORY, DLT 2017, 2017, 10396 : 353 - 364
  • [29] Approximated Symbolic Computations over Hybrid Automata
    Casagrande, Alberto
    Dreossi, Tommaso
    Piazza, Carla
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2013, (124): : 43 - 57
  • [30] Bounded Parikh Automata
    Cadilhac, Michael
    Finkel, Alain
    McKenzie, Pierre
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2011, (63): : 93 - 102
12345