The quantitative linear-time–branching-time spectrum - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

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 provide fixed-point characterizations of all system distances, and we 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.
Fichier principal
Vignette du fichier
fsttcs.pdf (493.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01088038 , version 1 (27-11-2014)

Identifiers

  • HAL Id : hal-01088038 , version 1

Cite

Uli Fahrenberg, Axel Legay, Claus Thrane. The quantitative linear-time–branching-time spectrum. FSTTCS - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2011, Mumbai, India. pp.54 - 69. ⟨hal-01088038⟩
223 View
88 Download

Share

Gmail Facebook X LinkedIn More