Algorithmic probabilistic game semantics

作者：Kiefer Stefan; Murawski Andrzej S^*; Ouaknine Joel; Wachter Bjoern; Worrell James

来源：Formal Methods in System Design, 2013, 43(2): 285-312.

DOI：10.1007/s10703-012-0173-1

• Probabilistic computation
• Probabilistic automata
• Contextual equivalence
• Full abstraction
• Game semantics

We present a detailed account of a translation from probabilistic call-by-value programs with procedures to Rabin%26apos;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.

• 出版日期2013-10