The Quantitative Linear-Time–Branching-Time Spectrum

Claus Thrane, Uli Fahrenberg, Axel Legay

Publikation: Bidrag til bog/antologi/rapport/konference proceedingKonferenceartikel i proceedingForskningpeer review

21 Citationer (Scopus)

Abstrakt

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.
OriginalsprogEngelsk
TitelIARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)
RedaktørerSupratik Chakraborty, Amit Kumar
Antal sider19
Vol/bind13
ForlagSchloss Dagstuhl. Leibniz-Zentrum für Informatik
Publikationsdato2011
Sider103--114
ISBN (Trykt)978-3-939897-34-7
DOI
StatusUdgivet - 2011
BegivenhedFSTTCS'11 - Mumbai, Indien
Varighed: 12 dec. 201114 dec. 2011

Konference

KonferenceFSTTCS'11
LandIndien
ByMumbai
Periode12/12/201114/12/2011
NavnLeibniz International Proceedings in Informatics
Vol/bind13
ISSN1868-8969

Fingeraftryk Dyk ned i forskningsemnerne om 'The Quantitative Linear-Time–Branching-Time Spectrum'. Sammen danner de et unikt fingeraftryk.

Citationsformater