Zone-Based Universality Analysis for Single-Clock Timed Automata. - Parosh Aziz Abdulla; Joël Ouaknine; Karin Quaas; James Worrell 001 (FSEN, 2007)

A Kleene-Schützenberger Theorem for Weighted Timed Automata. - Manfred Droste; Karin Quaas (FoSSaCS, 2008)

Universality Analysis for One-Clock Timed Automata. - Parosh Aziz Abdulla; Johann Deneux; Joël Ouaknine; Karin Quaas; James Worrell 001 (Fundam. Informaticae, 2008)

Weighted Timed MSO Logics. - Karin Quaas (Developments in Language Theory, 2009)

On the Supports of Recognizable Timed Series. - Karin Quaas (FORMATS, 2009)

Kleene-Schützenberger and Büchi theorems for weighted timed automata. - Karin Quaas (Logos, 2010)

On the Interval-Bound Problem for Weighted Timed Automata. - Karin Quaas (LATA, 2011)

MSO logics for weighted timed automata. - Karin Quaas (Formal Methods Syst. Des., 2011)

Recognizability of the support of recognizable series over the semiring of the integers is undecidable. - Daniel Kirsten; Karin Quaas (Inf. Process. Lett., 2011)

Kleene Algebras and Semimodules for Energy Problems. - Zoltán Ésik; Uli Fahrenberg; Axel Legay; Karin Quaas (ATVA, 2013)

Model Checking Metric Temporal Logic over Automata with One Counter. - Karin Quaas (LATA, 2013)

Verification for Timed Automata Extended with Unbounded Discrete Data Structures. - Karin Quaas (CONCUR, 2014)

Satisfiability for MTL and TPTL over Non-monotonic Data Words. - Claudia Carapelle; Shiguang Feng; Oliver Fernandez Gil; Karin Quaas (LATA, 2014)

Ehrenfeucht-Fraisse Games for TPTL and MTL over Non-monotonic Data Words. - Claudia Carapelle; Shiguang Feng; Oliver Fernandez Gil; Karin Quaas (AFL, 2014)

MTL-Model Checking of One-Clock Parametric Timed Automata is Undecidable. - Karin Quaas (SynCoP, 2014)

Parameterized model checking of weighted networks. - Ingmar Meinecke; Karin Quaas (Theor. Comput. Sci., 2014)

Path Checking for MTL and TPTL over Data Words. - Shiguang Feng; Markus Lohrey; Karin Quaas (DLT, 2015)

Verification for Timed Automata extended with Discrete Data Structure. - Karin Quaas (Log. Methods Comput. Sci., 2015)

Synchronizing Data Words for Register Automata. - Parvaneh Babari; Karin Quaas; Mahsa Shirmohammadi (MFCS, 2016)

On Parameterized One-Counter Automata. - Benedikt Bollig; Karin Quaas; Arnaud Sangnier (CoRR, 2016)

The Complexity of Flat Freeze LTL. - Benedikt Bollig; Karin Quaas; Arnaud Sangnier (CONCUR, 2017)

Revisiting reachability in timed automata. - Karin Quaas; Mahsa Shirmohammadi; James Worrell 001 (LICS, 2017)

An Algebraic Approach to Energy Problems I - *-Continuous Kleene ω-Algebras. - Zoltán Ésik; Uli Fahrenberg; Axel Legay; Karin Quaas (Acta Cybern., 2017)

An Algebraic Approach to Energy Problems II - The Algebra of Energy Functions. - Zoltán Ésik; Uli Fahrenberg; Axel Legay; Karin Quaas (Acta Cybern., 2017)

Computing Branching Distances Using Quantitative Games. - Uli Fahrenberg; Axel Legay; Karin Quaas (ICTAC, 2019)

The Containment Problem for Unambiguous Register Automata. - Antoine Mottet; Karin Quaas (STACS, 2019)

On the Containment Problem for Unambiguous Single-Register Automata with Guessing. - Antoine Mottet; Karin Quaas (CoRR, 2019)

Synchronizing Data Words for Register Automata. - Karin Quaas; Mahsa Shirmohammadi (ACM Trans. Comput. Log., 2019)

Effective definability of the reachability relation in timed automata. - Martin Fränzle; Karin Quaas; Mahsa Shirmohammadi; James Worrell 001 (Inf. Process. Lett., 2020)

Computing branching distances with quantitative games. - Uli Fahrenberg; Axel Legay; Karin Quaas (Theor. Comput. Sci., 2020)

MTL and TPTL for One-Counter Machines: Expressiveness, Model Checking, and Satisfiability. - Shiguang Feng; Claudia Carapelle; Oliver Fernández Gil; Karin Quaas (ACM Trans. Comput. Log., 2020)

New Techniques for Universality in Unambiguous Register Automata. - Wojciech Czerwinski; Antoine Mottet; Karin Quaas (ICALP, 2021)

Unambiguity in Automata Theory (Dagstuhl Seminar 21452). - Thomas Colcombet; Karin Quaas; Michal Skrzypczak (Dagstuhl Reports, 2021)

The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata. - Antoine Mottet; Karin Quaas (Theory Comput. Syst., 2021)

Concrete domains in logics: a survey. - Stéphane Demri; Karin Quaas (ACM SIGLOG News, 2021)

Deciding Emptiness for Constraint Automata on Strings with the Prefix and Suffix Order. - Dominik Peteler; Karin Quaas (MFCS, 2022)

Constraint Automata on Infinite Data Trees: from CTL(ℤ)/ CTL^*\

First Steps Towards Taming Description Logics with Strings. - Stéphane Demri; Karin Quaas (JELIA, 2023)