8 citations · 18 across the 10 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
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.FL2019★ 4 cited
On the Containment Problem for Unambiguous Single-Register Automata with Guessing
Antoine Mottet, Karin Quaas
Register automata extend classical finite automata with a finite set of registers that can store data from an infinite data domain for later equality comparisons with data from an…
cs.FL2019
Effective Definability of the Reachability Relation in Timed Automata
Martin Fränzle, Karin Quaas, Mahsa Shirmohammadi +1
We give a new proof of the result of Comon and Jurski that the binary reachability relation of a timed automaton is definable in linear arithmetic.