Computing Branching Distances Using Quantitative Games
(2019) Theoretical Aspects of Computing - {ICTAC} 2019 - 16th International Colloquium — Location: Hammamet Tunisia (31.October.2019)
Files
uli1.pdf
Open Access - Adobe PDF
- 433.2 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. (2019). Computing Branching Distances Using Quantitative Games. Theoretical Aspects of Computing – ICTAC 2019 : Lecture Notes in Computer Science, p. 59-75. https://doi.org/10.1007/978-3-030-32505-3_4