Metrics for weighted transition systems: Axiomatization and complexity - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2011

Metrics for weighted transition systems: Axiomatization and complexity

Abstract

Simulation distances are essentially an approximation of simulation which provide a measure of the extent by which behaviors in systems are inequivalent. In this paper, we consider the general quantitative model of weighted transition systems, where transitions are labeled with elements of a finite metric space. We study the so-called point-wise and accumulating simulation distances which provide extensions to the well-known Boolean notion of simulation on labeled transition systems. We introduce weighted process algebras for finite and regular behavior and offer sound and (approximate) complete inference systems for the proposed simulation distances. We also settle the algorithmic complexity of computing the simulation distances.
Fichier principal
Vignette du fichier
tcs.pdf (438.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

Kim Guldstrand Larsen, Uli Fahrenberg, Claus Thrane. Metrics for weighted transition systems: Axiomatization and complexity. Theoretical Computer Science, 2011, 412, pp.3358 - 3369. ⟨10.1016/j.tcs.2011.04.003⟩. ⟨hal-01088055⟩
183 View
84 Download

Altmetric

Share

Gmail Facebook X LinkedIn More