Computing branching distances with quantitative games
(2020) Theoretical Computer Science — Vol. 847, n° 847, p. 134-146 (2020)
Files
tcskarin.pdf
Open Access - Adobe PDF
- 534.83 KB
Details
- Authors
- Abstract
- We lay out a general method for computing branching distances between labeled transition systems. We translate the quantitative games used for defining these distances to other, path-building games which are amenable to methods from the theory of quantitative games. We then show for all common types of branching distances how the resulting path-building games can be solved. In the end, we achieve a method which can be used to compute all branching distances in the linear-time–branching-time spectrum
- Affiliations
Citations
Fahrenberg, U., Legay, A., & Quaas, K. (2020). Computing branching distances with quantitative games. Theoretical Computer Science, 847(847), 134-146. https://doi.org/10.1016/j.tcs.2020.10.001 (Original work published 2020)