Computing branching distances with quantitative games
DOI10.1016/J.TCS.2020.10.001zbMATH Open1464.68239OpenAlexW2982420068MaRDI QIDQ2210522FDOQ2210522
Authors: Uli Fahrenberg, Axel Legay, Karin Quaas 
Publication date: 6 November 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.10.001
Recommendations
- Computing branching distances using quantitative games
- On the complexity of branching games with regular conditions
- Mean field games with branching
- Quantifying in extensive games
- The Computational Complexity of Game Trees by Eigen-Distribution
- Equilibria in quantitative reachability games
- Tree projections: Game characterization and computational aspects
- Distance \(d\)-domination games
- Computing Game Metrics on Markov Decision Processes
Formal languages and automata (68Q45) Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- HyTech: A model checker for hybrid systems
- Uppaal in a nutshell
- Title not available (Why is that?)
- Computer Aided Verification
- HySAT: An efficient proof engine for bounded model checking of hybrid systems
- The complexity of mean payoff games on graphs
- A theory of timed automata
- Structured operational semantics and bisimulation as a congruence
- Borel determinacy
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
- Algebraic laws for nondeterminism and concurrency
- Title not available (Why is that?)
- Simulation distances
- Bisimulation through probabilistic testing
- A logic for reasoning about time and reliability
- Approximation Metrics for Discrete and Continuous Systems
- A Compositional Approach to Performance Modelling
- Metrics for labelled Markov processes
- Symbolic model checking for real-time systems
- The algorithmic analysis of hybrid systems
- Title not available (Why is that?)
- An application of games to the completeness problem for formalized theories
- Positional strategies for mean payoff games
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- A behavioural pseudometric for probabilistic transition systems
- Making weighted containment feasible: a heuristic based on simulation and abstraction
- Title not available (Why is that?)
- Weighted modal transition systems
- General quantitative specification theories with modalities
- The quantitative linear-time-branching-time spectrum
- Quantitative languages
- Quantitative refinement for weighted modal transition systems
- General quantitative specification theories with modal transition systems
- Metrics for weighted transition systems: axiomatization and complexity
- Formal Modeling and Analysis of Timed Systems
- Quantitative analysis of weighted transition systems
- Recoverability of Communication Protocols--Implications of a Theoretical Study
- Model-checking continuous-time Markov chains
- An introduction to metric semantics: Operational and denotational models for programming and specification languages
- Model checking discounted temporal properties
- Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games
- Quantitative fair simulation games
- A quantitative characterization of weighted Kripke structures in temporal logic
- The complexity of computing a bisimilarity pseudometric on probabilistic automata
- Compositionality for quantitative specifications
- From model checking to model measuring
- The quantitative linear-time-branching-time spectrum
- Computing branching distances using quantitative games
- A linear-time-branching-time spectrum for behavioral specification theories
- A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories
Cited In (4)
Uses Software
This page was built for publication: Computing branching distances with quantitative games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2210522)
