Algorithmic probabilistic game semantics. Playing games with automata

DOI10.1007/S10703-012-0173-1MaRDI QIDQ2248076zbMATH OpenOpenAlexFDO

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

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

probabilistic automatafull abstractiongame semanticscontextual equivalenceprobabilistic computation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Applications of game theory (91A80)

Recommendations

• Probabilistic game semantics
• scientific article; zbMATH DE number 2110612
• Algorithmic nominal game semantics
• CONCUR 2005 – Concurrency Theory
• Static Analysis

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3597592 (Why is no real title available?)
• scientific article; zbMATH DE number 1223609 (Why is no real title available?)
• scientific article; zbMATH DE number 1927425 (Why is no real title available?)
• scientific article; zbMATH DE number 1499102 (Why is no real title available?)
• scientific article; zbMATH DE number 1538048 (Why is no real title available?)
• scientific article; zbMATH DE number 1884411 (Why is no real title available?)
• scientific article; zbMATH DE number 2110612 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 5051652 (Why is no real title available?)
• A fragment of ML decidable by visibly pushdown automata
• A trivial algorithm whose analysis isn't
• Abstraction, Refinement and Proof for Probabilistic Systems
• CONCUR 2005 – Concurrency Theory
• CONCUR 2005 – Concurrency Theory
• CSP and anonymity
• Computer Aided Verification
• Full abstraction for PCF
• Fully abstract models of typed \(\lambda\)-calculi
• Functions with local state: regularity and undecidability
• GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS
• Game-theoretic analysis of call-by-value computation
• Introduction to algorithms
• On full abstraction for PCF: I, II and III
• Probabilistic automata
• Probabilistic game semantics
• Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
• The Thousand-and-One Cryptographers
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• The impact of higher-order state and control effects on local relational reasoning

Cited in

(9)

• QPCF: higher-order languages and quantum circuits
• Static Analysis
• Algorithmic nominal game semantics
• Quantitative simulations by matrices
• scientific article; zbMATH DE number 7445154 (Why is no real title available?)
• Space-bounded probabilistic game automata
• Probabilistic game semantics
• CONCUR 2005 – Concurrency Theory
• Preorder-constrained simulations for program refinement with effects

Describes a project that uses

Uses Software

• Ymer
• LiQuor
• MRMC
• PRISM

This page was built for publication: Algorithmic probabilistic game semantics. Playing games with automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248076)