Distances for Weighted Transition Systems: Games and Properties

Uli Fahrenberg 1, * Claus Thrane 2 Kim Guldstrand Larsen 2
* Auteur correspondant
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.
Type de document :
Communication dans un congrès
QAPL, Apr 2011, Saarbrücken, Germany. 57, pp.134 - 147, 2011, 〈10.4204/EPTCS.57.10〉
Liste complète des métadonnées

Littérature citée [24 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01088053
Contributeur : Uli Fahrenberg <>
Soumis le : jeudi 27 novembre 2014 - 11:43:52
Dernière modification le : mercredi 16 mai 2018 - 11:24:07
Document(s) archivé(s) le : lundi 2 mars 2015 - 09:22:47

Fichier

qapl.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

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

Partager

Métriques

Consultations de la notice

452

Téléchargements de fichiers

44