Karin Quaas

51 papers A* 2A 1B 8C 6Journal 29Unranked 4
YearRankTypeTitle / Venue / Authors
2025 J jnl
Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures.
Log. Methods Comput. Sci.
Stéphane Demri, Karin Quaas
2023 J jnl
Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures.
CoRR
Stéphane Demri, Karin Quaas
2023 B conf
Constraint Automata on Infinite Data Trees: from CTL(ℤ)/ CTL^*}(ℤ) to Decision Procedures.
CONCUR
Stéphane Demri, Karin Quaas
2023 B conf
First Steps Towards Taming Description Logics with Strings.
JELIA
Stéphane Demri, Karin Quaas
2022 B conf
Deciding Emptiness for Constraint Automata on Strings with the Prefix and Suffix Order.
MFCS
Dominik Peteler, Karin Quaas
2021 J jnl
Concrete domains in logics: a survey.
ACM SIGLOG News
Stéphane Demri, Karin Quaas
2021 A* conf
New Techniques for Universality in Unambiguous Register Automata.
ICALP
Wojciech Czerwinski, Antoine Mottet, Karin Quaas
2021 J jnl
New Techniques for Universality in Unambiguous Register Automata.
CoRR
Wojciech Czerwinski, Antoine Mottet, Karin Quaas
2021 J jnl
The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata.
Theory Comput. Syst.
Antoine Mottet, Karin Quaas
2021 J jnl
Unambiguity in Automata Theory (Dagstuhl Seminar 21452).
Dagstuhl Reports
Thomas Colcombet, Karin Quaas, Michal Skrzypczak
2020 J jnl
Computing branching distances with quantitative games.
Theor. Comput. Sci.
Uli Fahrenberg, Axel Legay, Karin Quaas
2020 J jnl
Effective definability of the reachability relation in timed automata.
Inf. Process. Lett.
Martin Fränzle, Karin Quaas, Mahsa Shirmohammadi, James Worrell
2020 J jnl
MTL and TPTL for One-Counter Machines: Expressiveness, Model Checking, and Satisfiability.
ACM Trans. Comput. Log.
Shiguang Feng, Claudia Carapelle, Oliver Fernández Gil, Karin Quaas
2019 C conf
Computing Branching Distances Using Quantitative Games.
ICTAC
Uli Fahrenberg, Axel Legay, Karin Quaas
2019 J jnl
Computing Branching Distances Using Quantitative Games.
CoRR
Uli Fahrenberg, Axel Legay, Karin Quaas
2019 J jnl
Effective Definability of the Reachability Relation in Timed Automata.
CoRR
Martin Fränzle, Karin Quaas, Mahsa Shirmohammadi, James Worrell
2019 J jnl
On the Containment Problem for Unambiguous Single-Register Automata with Guessing.
CoRR
Antoine Mottet, Karin Quaas
2019 J jnl
Synchronizing Data Words for Register Automata.
ACM Trans. Comput. Log.
Karin Quaas, Mahsa Shirmohammadi
2019 J jnl
The Complexity of Flat Freeze LTL.
Log. Methods Comput. Sci.
Benedikt Bollig, Karin Quaas, Arnaud Sangnier
2019 A conf
The Containment Problem for Unambiguous Register Automata.
STACS
Antoine Mottet, Karin Quaas
2018 J jnl
The Containment Problem for Unambiguous Register Automata.
CoRR
Antoine Mottet, Karin Quaas
2017 J jnl
An Algebraic Approach to Energy Problems I -
Acta Cybern.
Zoltán Ésik, Uli Fahrenberg, Axel Legay, Karin Quaas
2017 J jnl
An Algebraic Approach to Energy Problems II - The Algebra of Energy Functions.
Acta Cybern.
Zoltán Ésik, Uli Fahrenberg, Axel Legay, Karin Quaas
2017 J jnl
Path Checking for MTL and TPTL over Data Words.
Log. Methods Comput. Sci.
Shiguang Feng, Markus Lohrey, Karin Quaas
2017 J jnl
Revisiting Reachability in Timed Automata.
CoRR
Karin Quaas, Mahsa Shirmohammadi, James Worrell
2017 A* conf
Revisiting reachability in timed automata.
LICS
Karin Quaas, Mahsa Shirmohammadi, James Worrell
2017 J jnl
Synchronizing Data Words for Register Automata.
CoRR
Karin Quaas, Mahsa Shirmohammadi
2017 B conf
The Complexity of Flat Freeze LTL.
CONCUR
Benedikt Bollig, Karin Quaas, Arnaud Sangnier
2016 J jnl
On Parameterized One-Counter Automata.
CoRR
Benedikt Bollig, Karin Quaas, Arnaud Sangnier
2016 B conf
Synchronizing Data Words for Register Automata.
MFCS
Parvaneh Babari, Karin Quaas, Mahsa Shirmohammadi
2015 C conf
Path Checking for MTL and TPTL over Data Words.
DLT
Shiguang Feng, Markus Lohrey, Karin Quaas
2015 J jnl
Verification for Timed Automata extended with Discrete Data Structure.
Log. Methods Comput. Sci.
Karin Quaas
2014 — conf
Ehrenfeucht-Fraisse Games for TPTL and MTL over Non-monotonic Data Words.
AFL
Claudia Carapelle, Shiguang Feng, Oliver Fernandez Gil, Karin Quaas
2014 — conf
MTL-Model Checking of One-Clock Parametric Timed Automata is Undecidable.
SynCoP
Karin Quaas
2014 J jnl
Parameterized model checking of weighted networks.
Theor. Comput. Sci.
Ingmar Meinecke, Karin Quaas
2014 J jnl
Path-Checking for MTL and TPTL over Data Words.
CoRR
Shiguang Feng, Markus Lohrey, Karin Quaas
2014 C conf
Satisfiability for MTL and TPTL over Non-monotonic Data Words.
LATA
Claudia Carapelle, Shiguang Feng, Oliver Fernandez Gil, Karin Quaas
2014 B conf
Verification for Timed Automata Extended with Unbounded Discrete Data Structures.
CONCUR
Karin Quaas
2013 B conf
Kleene Algebras and Semimodules for Energy Problems.
ATVA
Zoltán Ésik, Uli Fahrenberg, Axel Legay, Karin Quaas
2013 J jnl
Kleene Algebras and Semimodules for Energy Problems.
CoRR
Zoltán Ésik, Uli Fahrenberg, Axel Legay, Karin Quaas
2013 C conf
Model Checking Metric Temporal Logic over Automata with One Counter.
LATA
Karin Quaas
2011 J jnl
A Kleene-Schützenberger theorem for weighted timed automata.
Theor. Comput. Sci.
Manfred Droste, Karin Quaas
2011 J jnl
MSO logics for weighted timed automata.
Formal Methods Syst. Des.
Karin Quaas
2011 C conf
On the Interval-Bound Problem for Weighted Timed Automata.
LATA
Karin Quaas
2011 J jnl
Recognizability of the support of recognizable series over the semiring of the integers is undecidable.
Inf. Process. Lett.
Daniel Kirsten, Karin Quaas
2010 — —
Kleene-Schützenberger and Büchi theorems for weighted timed automata.
Karin Quaas
2009 — conf
On the Supports of Recognizable Timed Series.
FORMATS
Karin Quaas
2009 C conf
Weighted Timed MSO Logics.
Developments in Language Theory
Karin Quaas
2008 B conf
A Kleene-Schützenberger Theorem for Weighted Timed Automata.
FoSSaCS
Manfred Droste, Karin Quaas
2008 J jnl
Universality Analysis for One-Clock Timed Automata.
Fundam. Informaticae
Parosh Aziz Abdulla, Johann Deneux, Joël Ouaknine, Karin Quaas, James Worrell
2007 — conf
Zone-Based Universality Analysis for Single-Clock Timed Automata.
FSEN
Parosh Aziz Abdulla, Joël Ouaknine, Karin Quaas, James Worrell