Computing branching distances with quantitative games
From MaRDI portal
Publication:2210522
DOI10.1016/j.tcs.2020.10.001zbMath1464.68239OpenAlexW2982420068MaRDI QIDQ2210522
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
Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- General quantitative specification theories with modal transition systems
- Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games
- Quantitative fair simulation games
- Metrics for weighted transition systems: axiomatization and complexity
- Metrics for labelled Markov processes
- The algorithmic analysis of hybrid systems
- Quantitative analysis of weighted transition systems
- Simulation distances
- HySAT: An efficient proof engine for bounded model checking of hybrid systems
- Positional strategies for mean payoff games
- Bisimulation through probabilistic testing
- Structured operational semantics and bisimulation as a congruence
- Borel determinacy
- A theory of timed automata
- Symbolic model checking for real-time systems
- A logic for reasoning about time and reliability
- The complexity of mean payoff games on graphs
- A behavioural pseudometric for probabilistic transition systems
- Compositionality for quantitative specifications
- HyTech: A model checker for hybrid systems
- Uppaal in a nutshell
- Weighted modal transition systems
- Computing branching distances using quantitative games
- A linear-time-branching-time spectrum for behavioral specification theories
- The quantitative linear-time-branching-time spectrum
- Model checking discounted temporal properties
- From Model Checking to Model Measuring
- General Quantitative Specification Theories with Modalities
- Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction
- Quantitative languages
- A Linear-Time–Branching-Time Spectrum of Behavioral Specification Theories
- Quantitative Refinement for Weighted Modal Transition Systems
- An application of games to the completeness problem for formalized theories
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Algebraic laws for nondeterminism and concurrency
- Recoverability of Communication Protocols--Implications of a Theoretical Study
- Approximation Metrics for Discrete and Continuous Systems
- The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata
- A Compositional Approach to Performance Modelling
- Computer Aided Verification
- Model-checking continuous-time Markov chains
- Formal Modeling and Analysis of Timed Systems
- An introduction to metric semantics: Operational and denotational models for programming and specification languages
This page was built for publication: Computing branching distances with quantitative games
