@inproceedings{2d7710d893ff44d68b4cc0f7d904ff19,
title = "The Quantitative Linear-Time–Branching-Time Spectrum",
abstract = "We present a distance-agnostic approach to quantitative verification. Taking as input an unspecified distance on system traces, or executions, we develop a game-based framework which allows us to define a spectrum of different interesting system distances corresponding to the given trace distance. Thus we extend the classic linear-time–branching-time spectrum to a quantitative setting, parametrized by trace distance. We also prove a general transfer principle which allows us to transfer counterexamples from the qualitative to the quantitative setting, showing that all system distances are mutually topologically inequivalent.",
keywords = "Quantitative verification, System distance, Distance hierarchy, Linear time, Branching time",
author = "Claus Thrane and Uli Fahrenberg and Axel Legay",
year = "2011",
doi = "10.4230/LIPIcs.FSTTCS.2011.103",
language = "English",
isbn = "978-3-939897-34-7",
volume = "13",
series = "Leibniz International Proceedings in Informatics",
publisher = "Schloss Dagstuhl. Leibniz-Zentrum f{\"u}r Informatik",
pages = "103----114",
editor = "Supratik Chakraborty and Amit Kumar",
booktitle = "IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)",
note = "FSTTCS'11 ; Conference date: 12-12-2011 Through 14-12-2011",
}