Algorithmic probabilistic game semantics
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-equivale...
Main Authors: | Kiefer, S, Murawski, A, Ouaknine, J, Wachter, B, Worrell, J |
---|---|
Format: | Journal article |
Published: |
2013
|
Similar Items
-
Language equivalence for probabilistic automata
by: Kiefer, S, et al.
Published: (2011) -
On the Complexity of the Equivalence Problem for Probabilistic Automata
by: Kiefer, S, et al.
Published: (2012) -
APEX: An analyzer for open probabilistic programs
by: Kiefer, S, et al.
Published: (2012) -
Three tokens in Herman's algorithm
by: Kiefer, S, et al.
Published: (2012) -
Operational algorithmic game semantics
by: Bunting, B, et al.
Published: (2023)