The quantitative linear-time–branching-time spectrum - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science 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 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
qltbt.pdf (581.33 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01087368 , version 1 (25-11-2014)

Identifiers

Cite

Uli Fahrenberg, Axel Legay. The quantitative linear-time–branching-time spectrum. Theoretical Computer Science, 2014, pp.54-69. ⟨10.1016/j.tcs.2013.07.030⟩. ⟨hal-01087368⟩
192 View
90 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More