4 citations · 4 across the 2 of their papers we have counts for
5 papers
New Techniques for Universality in Unambiguous Register Automata
Wojciech Czerwiński, Antoine Mottet, Karin Quaas
Register automata are finite automata equipped with a finite set of registers ranging over the domain of some relational structure like or . Register…
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…
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…
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.
The Containment Problem for Unambiguous Register Automata
Antoine Mottet, Karin Quaas
We investigate the complexity of the containment problem "Does hold?", where is an unambiguous register automaton and is an arbitrary register automato…