Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Uli Fahrenberg Connect in order to contact the contributor
Submitted on : Thursday, November 27, 2014 - 11:48:08 AM
Last modification on : Thursday, January 20, 2022 - 5:33:09 PM
Long-term archiving on: : Monday, March 2, 2015 - 9:22:54 AM


Files produced by the author(s)



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



Record views


Files downloads