default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKarin Quaas
Person information
- affiliation: University of Leipzig, Department of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c21]Stéphane Demri, Karin Quaas:
Constraint Automata on Infinite Data Trees: from CTL(ℤ)/ CTL^*}(ℤ) to Decision Procedures. CONCUR 2023: 29:1-29:18- [c20]Stéphane Demri, Karin Quaas:
First Steps Towards Taming Description Logics with Strings. JELIA 2023: 322-337 - [i12]Stéphane Demri, Karin Quaas:
Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures. CoRR abs/2302.05327 (2023) - 2022
- [c19]Dominik Peteler, Karin Quaas:
Deciding Emptiness for Constraint Automata on Strings with the Prefix and Suffix Order. MFCS 2022: 76:1-76:15 - 2021
- [j16]Antoine Mottet
, Karin Quaas:
The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata. Theory Comput. Syst. 65(4): 706-735 (2021) - [j15]Stéphane Demri, Karin Quaas:
Concrete domains in logics: a survey. ACM SIGLOG News 8(3): 6-29 (2021) - [c18]Wojciech Czerwinski, Antoine Mottet, Karin Quaas:
New Techniques for Universality in Unambiguous Register Automata. ICALP 2021: 129:1-129:16 - [i11]Wojciech Czerwinski, Antoine Mottet, Karin Quaas:
New Techniques for Universality in Unambiguous Register Automata. CoRR abs/2102.08331 (2021) - [i10]Thomas Colcombet, Karin Quaas, Michal Skrzypczak:
Unambiguity in Automata Theory (Dagstuhl Seminar 21452). Dagstuhl Reports 11(10): 57-71 (2021) - 2020
- [j14]Martin Fränzle, Karin Quaas, Mahsa Shirmohammadi, James Worrell:
Effective definability of the reachability relation in timed automata. Inf. Process. Lett. 153 (2020) - [j13]Uli Fahrenberg, Axel Legay, Karin Quaas:
Computing branching distances with quantitative games. Theor. Comput. Sci. 847: 134-146 (2020) - [j12]Shiguang Feng, Claudia Carapelle, Oliver Fernández Gil, Karin Quaas:
MTL and TPTL for One-Counter Machines: Expressiveness, Model Checking, and Satisfiability. ACM Trans. Comput. Log. 21(2): 12:1-12:34 (2020)
2010 – 2019
- 2019
- [j11]Benedikt Bollig, Karin Quaas, Arnaud Sangnier:
The Complexity of Flat Freeze LTL. Log. Methods Comput. Sci. 15(3) (2019) - [j10]Karin Quaas, Mahsa Shirmohammadi:
Synchronizing Data Words for Register Automata. ACM Trans. Comput. Log. 20(2): 11:1-11:27 (2019) - [c17]Uli Fahrenberg, Axel Legay, Karin Quaas:
Computing Branching Distances Using Quantitative Games. ICTAC 2019: 59-75 - [c16]Antoine Mottet, Karin Quaas:
The Containment Problem for Unambiguous Register Automata. STACS 2019: 53:1-53:15 - [i9]Martin Fränzle, Karin Quaas, Mahsa Shirmohammadi, James Worrell:
Effective Definability of the Reachability Relation in Timed Automata. CoRR abs/1903.09773 (2019) - [i8]Antoine Mottet, Karin Quaas:
On the Containment Problem for Unambiguous Single-Register Automata with Guessing. CoRR abs/1905.12445 (2019) - [i7]Uli Fahrenberg, Axel Legay, Karin Quaas:
Computing Branching Distances Using Quantitative Games. CoRR abs/1910.08943 (2019) - 2018
- [i6]Antoine Mottet, Karin Quaas:
The Containment Problem for Unambiguous Register Automata. CoRR abs/1809.08985 (2018) - 2017
- [j9]Zoltán Ésik, Uli Fahrenberg, Axel Legay, Karin Quaas:
An Algebraic Approach to Energy Problems I - *-Continuous Kleene ω-Algebras. Acta Cybern. 23(1): 203-228 (2017) - [j8]Zoltán Ésik, Uli Fahrenberg, Axel Legay, Karin Quaas:
An Algebraic Approach to Energy Problems II - The Algebra of Energy Functions. Acta Cybern. 23(1): 229-268 (2017) - [j7]Shiguang Feng, Markus Lohrey, Karin Quaas:
Path Checking for MTL and TPTL over Data Words. Log. Methods Comput. Sci. 13(3) (2017) - [c15]Benedikt Bollig, Karin Quaas, Arnaud Sangnier:
The Complexity of Flat Freeze LTL. CONCUR 2017: 33:1-33:16 - [c14]Karin Quaas, Mahsa Shirmohammadi, James Worrell:
Revisiting reachability in timed automata. LICS 2017: 1-12 - [i5]Karin Quaas, Mahsa Shirmohammadi, James Worrell:
Revisiting Reachability in Timed Automata. CoRR abs/1702.03450 (2017) - [i4]Karin Quaas, Mahsa Shirmohammadi:
Synchronizing Data Words for Register Automata. CoRR abs/1710.02329 (2017) - 2016
- [c13]Parvaneh Babari, Karin Quaas, Mahsa Shirmohammadi:
Synchronizing Data Words for Register Automata. MFCS 2016: 15:1-15:15 - [i3]Benedikt Bollig, Karin Quaas, Arnaud Sangnier:
On Parameterized One-Counter Automata. CoRR abs/1609.06124 (2016) - 2015
- [j6]Karin Quaas:
Verification for Timed Automata extended with Discrete Data Structure. Log. Methods Comput. Sci. 11(3) (2015) - [c12]Shiguang Feng, Markus Lohrey, Karin Quaas:
Path Checking for MTL and TPTL over Data Words. DLT 2015: 326-339 - 2014
- [j5]Ingmar Meinecke, Karin Quaas:
Parameterized model checking of weighted networks. Theor. Comput. Sci. 534: 69-85 (2014) - [c11]Karin Quaas:
Verification for Timed Automata Extended with Unbounded Discrete Data Structures. CONCUR 2014: 512-526 - [c10]Claudia Carapelle, Shiguang Feng, Oliver Fernandez Gil, Karin Quaas:
Satisfiability for MTL and TPTL over Non-monotonic Data Words. LATA 2014: 248-259 - [c9]Karin Quaas:
MTL-Model Checking of One-Clock Parametric Timed Automata is Undecidable. SynCoP 2014: 5-17 - [c8]Claudia Carapelle, Shiguang Feng, Oliver Fernandez Gil, Karin Quaas:
Ehrenfeucht-Fraisse Games for TPTL and MTL over Non-monotonic Data Words. AFL 2014: 174-187 - [i2]Shiguang Feng, Markus Lohrey, Karin Quaas:
Path-Checking for MTL and TPTL over Data Words. CoRR abs/1412.3644 (2014) - 2013
- [c7]Zoltán Ésik, Uli Fahrenberg, Axel Legay, Karin Quaas:
Kleene Algebras and Semimodules for Energy Problems. ATVA 2013: 102-117 - [c6]Karin Quaas:
Model Checking Metric Temporal Logic over Automata with One Counter. LATA 2013: 468-479 - [i1]Zoltán Ésik, Uli Fahrenberg, Axel Legay, Karin Quaas:
Kleene Algebras and Semimodules for Energy Problems. CoRR abs/1307.0635 (2013) - 2011
- [j4]Karin Quaas:
MSO logics for weighted timed automata. Formal Methods Syst. Des. 38(3): 193-222 (2011) - [j3]Daniel Kirsten, Karin Quaas:
Recognizability of the support of recognizable series over the semiring of the integers is undecidable. Inf. Process. Lett. 111(10): 500-502 (2011) - [j2]Manfred Droste, Karin Quaas:
A Kleene-Schützenberger theorem for weighted timed automata. Theor. Comput. Sci. 412(12-14): 1140-1153 (2011) - [c5]Karin Quaas:
On the Interval-Bound Problem for Weighted Timed Automata. LATA 2011: 452-464 - 2010
- [b1]Karin Quaas:
Kleene-Schützenberger and Büchi theorems for weighted timed automata. University of Leipzig, Logos 2010, ISBN 978-3-8325-2500-2, pp. 1-123
2000 – 2009
- 2009
- [c4]Karin Quaas:
Weighted Timed MSO Logics. Developments in Language Theory 2009: 419-430 - [c3]Karin Quaas:
On the Supports of Recognizable Timed Series. FORMATS 2009: 243-257 - 2008
- [j1]Parosh Aziz Abdulla, Johann Deneux, Joël Ouaknine, Karin Quaas, James Worrell:
Universality Analysis for One-Clock Timed Automata. Fundam. Informaticae 89(4): 419-450 (2008) - [c2]Manfred Droste, Karin Quaas:
A Kleene-Schützenberger Theorem for Weighted Timed Automata. FoSSaCS 2008: 142-156 - 2007
- [c1]Parosh Aziz Abdulla, Joël Ouaknine, Karin Quaas, James Worrell:
Zone-Based Universality Analysis for Single-Clock Timed Automata. FSEN 2007: 98-112
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
