Algorithmic probabilistic game semanticsPlaying games with automata

被引：0
|
作者：
Stefan Kiefer
Andrzej S. Murawski
Joël Ouaknine
Björn Wachter
James Worrell
机构：
[1] Univ. of Oxford,Dept of Computer Science
[2] Univ. of Leicester,Dept of Computer Science
来源：
Formal Methods in System Design | 2013年 / 43卷
关键词：
Probabilistic computation; Probabilistic automata; Contextual equivalence; Full abstraction; Game semantics;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We present a detailed account of a translation from probabilistic call-by-value programs with procedures to Rabin’s probabilistic automata. The translation is fully abstract in that programs exhibit the same computational behaviour if and only if the corresponding automata are language-equivalent. Since probabilistic language equivalence is decidable, we can apply the translation to analyse the behaviour of probabilistic programs and protocols. We illustrate our approach on a number of case studies.
引用
收藏
页码：285 / 312
页数：27
相关论文
共 50 条
  • [1] PROBABILISTIC GAME AUTOMATA
    CONDON, A
    LADNER, R
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1986, 223 : 144 - 162
  • [2] PROBABILISTIC GAME AUTOMATA
    CONDON, A
    LADNER, RE
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1988, 36 (03) : 452 - 489
  • [3] Algorithmic probabilistic game semantics
    Kiefer, Stefan
    Murawski, Andrzej S.
    Ouaknine, Joel
    Wachter, Bjoern
    Worrell, James
    [J]. FORMAL METHODS IN SYSTEM DESIGN, 2013, 43 (02) : 285 - 312
  • [4] Parity Games and Automata for Game Logic
    Hansen, Helle Hvid
    Kupke, Clemens
    Marti, Johannes
    Venema, Yde
    [J]. DYNAMIC LOGIC: NEW TRENDS AND APPLICATIONS, 2018, 10669 : 115 - 132
  • [5] Stochastic Games for Verification of Probabilistic Timed Automata
    Kwiatkowska, Marta
    Norman, Gethin
    Parker, David
    [J]. FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, PROCEEDINGS, 2009, 5813 : 212 - 227
  • [6] SPACE-BOUNDED PROBABILISTIC GAME AUTOMATA
    CONDON, A
    [J]. JOURNAL OF THE ACM, 1991, 38 (02) : 472 - 494
  • [7] Playing games with algorithms: Algorithmic combinatorial game theory
    Demaine, ED
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2001, 2001, 2136 : 18 - 32
  • [8] GAME CHARACTERIZATION OF PROBABILISTIC BISIMILARITY, AND APPLICATIONS TO PUSHDOWN AUTOMATA
    Forejt, Vojtech
    Jancar, Petr
    Kiefer, Stefan
    Worrell, James
    [J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2018, 14 (04) : 1 - 25
  • [9] Modal Stochastic Games Abstraction-Refinement of Probabilistic Automata
    Katoen, Joost-Pieter
    Sher, Falak
    [J]. MODELS, ALGORITHMS, LOGICS AND TOOLS: ESSAYS DEDICATED TO KIM GULDSTRAND LARSEN ON THE OCCASION OF HIS 60TH BIRTHDAY, 2017, 10460 : 426 - 445
  • [10] Are Good-for-Games Automata Good for Probabilistic Model Checking?
    Klein, Joachim
    Mueller, David
    Baier, Christel
    Klueppelholz, Sascha
    [J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2014), 2014, 8370 : 453 - 465
12345