8 citations · 18 across the 10 of their papers we have counts for
7 papers · 1 filter
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…
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…
Synchronizing Data Words for Register Automata
Karin Quaas, Mahsa Shirmohammadi
Register automata (RAs) are finite automata extended with a finite set of registers to store and compare data from an infinite domain. We study the concept of synchronizing data wo…
The Complexity of Flat Freeze LTL
Benedikt Bollig, Karin Quaas, Arnaud Sangnier
We consider the model-checking problem for freeze LTL on one-counter automata (OCA). Freeze LTL extends LTL with the freeze quantifier, which allows one to store different counter…
Kleene Algebras and Semimodules for Energy Problems
Zoltán Ésik, Uli Fahrenberg, Axel Legay +1
With the purpose of unifying a number of approaches to energy problems found in the literature, we introduce generalized energy automata. These are finite automata whose edges are…