Quantitative Simulation Games

DOI10.1007/978-3-642-13754-9_3zbMath1288.68180OpenAlexW1531170032MaRDI QIDQ3587251

Arjun Radhakrishna, Pavol Černý, Thomas A. Henzinger

Publication date: 7 September 2010

Published in: Time for Verification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13754-9_3

Mathematics Subject Classification ID

Games involving graphs (91A43) Applications of game theory (91A80) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Error probability in coding theory (94B70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Metrics for labelled Markov processes
• Positional strategies for mean payoff games
• The complexity of mean payoff games on graphs
• Weighted automata and weighted logics
• Approximating and computing behavioural distances in probabilistic transition systems
• Expressiveness and Closure Properties for Quantitative Languages
• Quantitative Languages
• Better Quality in Synthesis through Quantitative Objectives
• The Use of Triple-Modular Redundancy to Improve Computer Reliability
• An introduction to metric semantics: Operational and denotational models for programming and specification languages

This page was built for publication: Quantitative Simulation Games