Game Refinement Relations and Metrics

DOI10.2168/LMCS-4(3:7)2008MaRDI QIDQ3535612zbMATH OpenFDO

Authors Luca De Alfaro, Rupak Majumdar, Vishwanath Raman, Mariëlle I. A. Stoelinga

Publication date 13 November 2008

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/LMCS-4(3:7)2008

zbMATH Keywords

simulationreachabilitybisimulationsafetyprobability of winning from a given statequantitative mu-calculustwo-player games over finite state spaces

Mathematics Subject Classification ID

2-person games (91A05) Multistage and repeated games (91A20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Algorithms for game metrics
• Algorithms for Game Metrics
• Computing Game Metrics on Markov Decision Processes
• Quantitative solution of -regular games
• Distances for weighted transition systems: games and properties

Cited in

(27)

• The complexity of computing a bisimilarity pseudometric on probabilistic automata
• A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces
• Simulation Hemi-metrics between Infinite-State Stochastic Games
• Sound approximate and asymptotic probabilistic bisimulations for PCTL
• A survey of stochastic -regular games
• Approximating Markov processes through filtration
• Simulation distances
• An algorithm for probabilistic alternating simulation
• SOS specifications for uniformly continuous operators
• Dynamic Cheap Talk for Robust Adversarial Learning
• Bisimulations meet PCTL equivalences for probabilistic automata
• A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
• Explainability of probabilistic bisimilarity distances for labelled Markov chains
• Group-by-group probabilistic bisimilarities and their logical characterizations
• Logical characterization of trace metrics
• Logical characterization of bisimulation metrics
• Relating strong behavioral equivalences for processes with nondeterminism and probabilities
• Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
• Logical characterization of branching metrics for nondeterministic probabilistic transition systems
• Measuring and synthesizing systems in probabilistic environments
• Weighted modal transition systems
• Algorithms for game metrics
• On behavioural pseudometrics and closure ordinals
• Interface simulation distances
• Algorithms for Game Metrics
• Symbolic model checking in non-Boolean domains
• Compositional weak metrics for group key update

This page was built for publication: Game Refinement Relations and Metrics

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