2000 character limit reached
Computing Branching Distances Using Quantitative Games (1910.08943v1)
Published 20 Oct 2019 in cs.LO
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.