Simulation distances
DOI10.1016/j.tcs.2011.08.002zbMath1234.68253OpenAlexW2913545290MaRDI QIDQ764284
Thomas A. Henzinger, Arjun Radhakrishna, Pavol Černý
Publication date: 13 March 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.08.002
2-person games (91A05) 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) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Metrics for labelled Markov processes
- 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
- Game Refinement Relations and Metrics
- Simulation Distances
- Better Quality in Synthesis through Quantitative Objectives
- Error Detecting and Error Correcting Codes
- The Use of Triple-Modular Redundancy to Improve Computer Reliability
- An introduction to metric semantics: Operational and denotational models for programming and specification languages
- Fair simulation
This page was built for publication: Simulation distances