Computing branching distances with quantitative games
From MaRDI portal
(Redirected from Publication:2210522)
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
Cites work
- A behavioural pseudometric for probabilistic transition systems
- A Compositional Approach to Performance Modelling
- A linear-time-branching-time spectrum for behavioral specification theories
- A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories
- A logic for reasoning about time and reliability
- A quantitative characterization of weighted Kripke structures in temporal logic
- A theory of timed automata
- Algebraic laws for nondeterminism and concurrency
- An application of games to the completeness problem for formalized theories
- An introduction to metric semantics: Operational and denotational models for programming and specification languages
- Approximation Metrics for Discrete and Continuous Systems
- Bisimulation through probabilistic testing
- Borel determinacy
- Compositionality for quantitative specifications
- Computer Aided Verification
- Computing branching distances using quantitative games
- Formal Modeling and Analysis of Timed Systems
- From model checking to model measuring
- General quantitative specification theories with modal transition systems
- General quantitative specification theories with modalities
- scientific article; zbMATH DE number 3115890 (Why is no real title available?)
- scientific article; zbMATH DE number 729460 (Why is no real title available?)
- scientific article; zbMATH DE number 2038772 (Why is no real title available?)
- scientific article; zbMATH DE number 2080040 (Why is no real title available?)
- HySAT: An efficient proof engine for bounded model checking of hybrid systems
- HyTech: A model checker for hybrid systems
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Making weighted containment feasible: a heuristic based on simulation and abstraction
- Metrics for labelled Markov processes
- Metrics for weighted transition systems: axiomatization and complexity
- Model checking discounted temporal properties
- Model-checking continuous-time Markov chains
- Positional strategies for mean payoff games
- Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games
- Quantitative analysis of weighted transition systems
- Quantitative fair simulation games
- Quantitative languages
- Quantitative refinement for weighted modal transition systems
- Recoverability of Communication Protocols--Implications of a Theoretical Study
- Simulation distances
- Structured operational semantics and bisimulation as a congruence
- Symbolic model checking for real-time systems
- The algorithmic analysis of hybrid systems
- The complexity of computing a bisimilarity pseudometric on probabilistic automata
- The complexity of mean payoff games on graphs
- The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
- The quantitative linear-time-branching-time spectrum
- The quantitative linear-time-branching-time spectrum
- Uppaal in a nutshell
- Weighted modal transition systems
Cited in
(5)
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)
