Skip to Main content Skip to Navigation
Conference papers

Distances for Weighted Transition Systems: Games and Properties

Uli Fahrenberg 1, * Claus Thrane 2 Kim Guldstrand Larsen 2
* Corresponding author
1 ESTASYS - Efficient STAtistical methods in SYstems of systems
Inria Rennes – Bretagne Atlantique , IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL
Abstract : We develop a general framework for reasoning about distances between transition systems with quantitative information. Taking as starting point an arbitrary distance on system traces, we show how this leads to natural definitions of a linear and a branching distance on states of such a transition system. We show that our framework generalizes and unifies a large variety of previously considered system distances, and we develop some general properties of our distances. We also show that if the trace distance admits a recursive characterization, then the corresponding branching distance can be obtained as a least fixed point to a similar recursive characterization. The central tool in our work is a theory of infinite path-building games with quantitative objectives.
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/hal-01088053
Contributor : Uli Fahrenberg <>
Submitted on : Thursday, November 27, 2014 - 11:43:52 AM
Last modification on : Tuesday, June 15, 2021 - 4:26:48 PM
Long-term archiving on: : Monday, March 2, 2015 - 9:22:47 AM

File

qapl.pdf
Files produced by the author(s)

Identifiers

Citation

Uli Fahrenberg, Claus Thrane, Kim Guldstrand Larsen. Distances for Weighted Transition Systems: Games and Properties. QAPL, Apr 2011, Saarbrücken, Germany. pp.134 - 147, ⟨10.4204/EPTCS.57.10⟩. ⟨hal-01088053⟩

Share

Metrics

Record views

548

Files downloads

244