Karin Quaas

According to our database, Karin Quaas authored at least 38 papers between 2007 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2023

First Steps Towards Taming Description Logics with Strings.

Stéphane Demri, Karin Quaas

Proceedings of the Logics in Artificial Intelligence - 18th European Conference, 2023

Constraint Automata on Infinite Data Trees: from CTL(ℤ)/ CTL^*}(ℤ) to Decision Procedures.

Stéphane Demri, Karin Quaas

Proceedings of the 34th International Conference on Concurrency Theory, 2023

2022

Deciding Emptiness for Constraint Automata on Strings with the Prefix and Suffix Order.

Dominik Peteler, Karin Quaas

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021

Concrete domains in logics: a survey.

Stéphane Demri, Karin Quaas

ACM SIGLOG News, 2021

The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata.

Antoine Mottet, Karin Quaas

Theory Comput. Syst., 2021

Unambiguity in Automata Theory (Dagstuhl Seminar 21452).

Thomas Colcombet, Karin Quaas, Michal Skrzypczak

Dagstuhl Reports, 2021

New Techniques for Universality in Unambiguous Register Automata.

Wojciech Czerwinski, Antoine Mottet, Karin Quaas

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

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

Computing branching distances with quantitative games.

Uli Fahrenberg, Axel Legay, Karin Quaas

Theor. Comput. Sci., 2020

Effective definability of the reachability relation in timed automata.

Martin Fränzle, Karin Quaas, Mahsa Shirmohammadi, James Worrell

Inf. Process. Lett., 2020

2019

Synchronizing Data Words for Register Automata.

Karin Quaas, Mahsa Shirmohammadi

ACM Trans. Comput. Log., 2019

The Complexity of Flat Freeze LTL.

Benedikt Bollig, Karin Quaas, Arnaud Sangnier

Log. Methods Comput. Sci., 2019

On the Containment Problem for Unambiguous Single-Register Automata with Guessing.

Antoine Mottet, Karin Quaas

CoRR, 2019

The Containment Problem for Unambiguous Register Automata.

Antoine Mottet, Karin Quaas

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Computing Branching Distances Using Quantitative Games.

Uli Fahrenberg, Axel Legay, Karin Quaas

Proceedings of the Theoretical Aspects of Computing - ICTAC 2019 - 16th International Colloquium, Hammamet, Tunisia, October 31, 2019

2017

Path Checking for MTL and TPTL over Data Words.

Shiguang Feng, Markus Lohrey, Karin Quaas

Log. Methods Comput. Sci., 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

An Algebraic Approach to Energy Problems I - ^*-Continuous Kleene ω-Algebras.

Zoltán Ésik, Uli Fahrenberg, Axel Legay, Karin Quaas

Acta Cybern., 2017

Revisiting reachability in timed automata.

Karin Quaas, Mahsa Shirmohammadi, James Worrell

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016

On Parameterized One-Counter Automata.

Benedikt Bollig, Karin Quaas, Arnaud Sangnier

CoRR, 2016

Synchronizing Data Words for Register Automata.

Parvaneh Babari, Karin Quaas, Mahsa Shirmohammadi

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015

Verification for Timed Automata extended with Discrete Data Structure.

Karin Quaas

Log. Methods Comput. Sci., 2015

2014

Parameterized model checking of weighted networks.

Ingmar Meinecke, Karin Quaas

Theor. Comput. Sci., 2014

MTL-Model Checking of One-Clock Parametric Timed Automata is Undecidable.

Karin Quaas

Proceedings of the Proceedings 1st International Workshop on Synthesis of Continuous Parameters, 2014

Ehrenfeucht-Fraisse Games for TPTL and MTL over Non-monotonic Data Words.

Claudia Carapelle, Shiguang Feng, Oliver Fernandez Gil, Karin Quaas

Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Satisfiability for MTL and TPTL over Non-monotonic Data Words.

Claudia Carapelle, Shiguang Feng, Oliver Fernandez Gil, Karin Quaas

Proceedings of the Language and Automata Theory and Applications, 2014

Verification for Timed Automata Extended with Unbounded Discrete Data Structures.

Karin Quaas

Proceedings of the CONCUR 2014 - Concurrency Theory - 25th International Conference, 2014

2013

Model Checking Metric Temporal Logic over Automata with One Counter.

Karin Quaas

Proceedings of the Language and Automata Theory and Applications, 2013

Kleene Algebras and Semimodules for Energy Problems.

Zoltán Ésik, Uli Fahrenberg, Axel Legay, Karin Quaas

Proceedings of the Automated Technology for Verification and Analysis, 2013

2011

A Kleene-Schützenberger theorem for weighted timed automata.

Manfred Droste, Karin Quaas

Theor. Comput. Sci., 2011

Recognizability of the support of recognizable series over the semiring of the integers is undecidable.

Daniel Kirsten, Karin Quaas

Inf. Process. Lett., 2011

MSO logics for weighted timed automata.

Karin Quaas

Formal Methods Syst. Des., 2011

On the Interval-Bound Problem for Weighted Timed Automata.

Karin Quaas

Proceedings of the Language and Automata Theory and Applications, 2011

2010

Kleene-Schützenberger and Büchi theorems for weighted timed automata.

Karin Quaas

PhD thesis, 2010

2009

On the Supports of Recognizable Timed Series.

Karin Quaas

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2009

Weighted Timed MSO Logics.

Karin Quaas

Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008

Universality Analysis for One-Clock Timed Automata.

Parosh Aziz Abdulla, Johann Deneux, Joël Ouaknine, Karin Quaas, James Worrell

Fundam. Informaticae, 2008

2007

Zone-Based Universality Analysis for Single-Clock Timed Automata.

Parosh Aziz Abdulla, Joël Ouaknine, Karin Quaas, James Worrell

Proceedings of the International Symposium on Fundamentals of Software Engineering, 2007