Computing Branching Distances Using Quantitative Games
Logic in Computer Science
2019-10-22 v1
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.
Keywords
Cite
@article{arxiv.1910.08943,
title = {Computing Branching Distances Using Quantitative Games},
author = {Uli Fahrenberg and Axel Legay and Karin Quaas},
journal= {arXiv preprint arXiv:1910.08943},
year = {2019}
}