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.
Originalsprog | Engelsk |
---|---|
Tidsskrift | Theoretical Computer Science |
Vol/bind | 847 |
Sider (fra-til) | 134-146 |
Antal sider | 13 |
ISSN | 0304-3975 |
DOI | |
Status | Udgivet - 22 dec. 2020 |
Bibliografisk note
Publisher Copyright:© 2020 Elsevier B.V.