Algorithmic probabilistic game semantics. Playing games with automata

DOI10.1007/s10703-012-0173-1zbMath1291.68294MaRDI QIDQ2248076

Andrzej S. Murawski, James Worrell, Stefan Kiefer, Joël Ouaknine, Björn Wachter

Publication date: 30 June 2014

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-012-0173-1

zbMATH Keywords

full abstraction; game semantics; probabilistic automata; contextual equivalence; probabilistic computation

Mathematics Subject Classification ID

91A80: Applications of game theory

68Q45: Formal languages and automata

68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)

Related Items

Quantitative simulations by matrices

Uses Software

• PRISM
• MRMC
• LiQuor
• Ymer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Functions with local state: regularity and undecidability
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• A trivial algorithm whose analysis isn't
• Fully abstract models of typed \(\lambda\)-calculi
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Game-theoretic analysis of call-by-value computation
• A Fragment of ML Decidable by Visibly Pushdown Automata
• GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS
• The Thousand-and-One Cryptographers
• Abstraction, Refinement and Proof for Probabilistic Systems
• CSP and anonymity
• The impact of higher-order state and control effects on local relational reasoning
• Probabilistic automata
• Computer Aided Verification
• Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
• Probabilistic game semantics
• CONCUR 2005 – Concurrency Theory
• CONCUR 2005 – Concurrency Theory