150 citations · 623 across the 65 of their papers we have counts for
Showing 2019 · cs.LOShow all
2 papers · 2 filters
cs.LO2019
Computing Branching Distances Using Quantitative Games
Uli Fahrenberg, Axel Legay, Karin Quaas
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, pa…
cs.LO2019★ 2 cited
Sequential Relational Decomposition
Dror Fried, Axel Legay, Joël Ouaknine +1
The concept of decomposition in computer science and engineering is considered a fundamental component of computational thinking and is prevalent in design of algorithms, software…