Algorithmic probabilistic game semantics. Playing games with automata
DOI10.1007/S10703-012-0173-1zbMATH Open1291.68294OpenAlexW22667845MaRDI QIDQ2248076FDOQ2248076
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
Recommendations
Formal languages and automata (68Q45) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Applications of game theory (91A80)
Cites Work
- Introduction to algorithms
- Title not available (Why is that?)
- Probabilistic automata
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- Title not available (Why is that?)
- The impact of higher-order state and control effects on local relational reasoning
- Title not available (Why is that?)
- The dining cryptographers problem: Unconditional sender and recipient untraceability
- Abstraction, Refinement and Proof for Probabilistic Systems
- Computer Aided Verification
- Title not available (Why is that?)
- Title not available (Why is that?)
- CONCUR 2005 – Concurrency Theory
- CSP and anonymity
- Game-theoretic analysis of call-by-value computation
- Functions with local state: regularity and undecidability
- Title not available (Why is that?)
- The Thousand-and-One Cryptographers
- A fragment of ML decidable by visibly pushdown automata
- Fully abstract models of typed \(\lambda\)-calculi
- Probabilistic game semantics
- CONCUR 2005 – Concurrency Theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
- Title not available (Why is that?)
- A trivial algorithm whose analysis isn't
- GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS
- Title not available (Why is that?)
Cited In (9)
- QPCF: higher-order languages and quantum circuits
- Static Analysis
- Algorithmic nominal game semantics
- Quantitative simulations by matrices
- Title not available (Why is that?)
- Space-bounded probabilistic game automata
- Probabilistic game semantics
- CONCUR 2005 – Concurrency Theory
- Preorder-constrained simulations for program refinement with effects
Uses Software
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)
