Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Quaas, Karin
84  Ergebnisse:
Personensuche X
?
1

First Steps Towards Taming Description Logics with Strings:

, In: Logics in Artificial Intelligence; Lecture Notes in Computer Science,
Demri, Stéphane ; Quaas, Karin - p. 322-337 , 2023
Link: https://doi.org/10.1007/..
 
?
2

Concrete domains in logics : a survey:

Demri, Stéphane ; Quaas, Karin
ACM SIGLOG News.  8 (2021)  3 - p. 6-29 , 2021
Link: https://dl.acm.org/doi/1..
 
?
3

Concrete domains in logics: a survey:

Demri, Stéphane ; Quaas, Karin
ACM SIGLOG News.  8 (2021)  3 - p. 6-29 , 2021
Link: https://doi.org/10.1145/..
 
?
4

Effective definability of the reachability relation in time..:

Fränzle, Martin ; Quaas, Karin ; Shirmohammadi, Mahsa.
Information Processing Letters.  153 (2020)  - p. 105871 , 2020
Link: https://doi.org/10.1016/..
 
?
5

The Containment Problem for Unambiguous Register Automata a..:

Mottet, Antoine ; Quaas, Karin
Theory of Computing Systems.  65 (2020)  4 - p. 706-735 , 2020
Link: https://doi.org/10.1007/..
 
?
6

Computing branching distances with quantitative games:

Fahrenberg, Uli ; Legay, Axel ; Quaas, Karin
Theoretical Computer Science.  847 (2020)  - p. 134-146 , 2020
Link: https://doi.org/10.1016/..
 
?
7

Computing Branching Distances Using Quantitative Games:

, In: Theoretical Aspects of Computing – ICTAC 2019; Lecture Notes in Computer Science,
Fahrenberg, Uli ; Legay, Axel ; Quaas, Karin - p. 59-75 , 2019
Link: https://doi.org/10.1007/..
 
?
8

MTL and TPTL for One-Counter Machines: Expressiveness, Mode..:

Feng, Shiguang ; Carapelle, Claudia ; Gil, Oliver Fernández.
ACM Transactions on Computational Logic.  21 (2019)  2 - p. 1-34 , 2019
Link: https://doi.org/10.1145/..
 
?
9

MTL and TPTL for One-Counter Machines : Expressiveness, ..:

Feng, Shiguang ; Carapelle, Claudia ; Gil, Oliver Fernández.
ACM Transactions on Computational Logic (TOCL).  21 (2019)  2 - p. 1-34 , 2019
Link: https://dl.acm.org/doi/1..
 
?
10

Synchronizing Data Words for Register Automata:

Quaas, Karin ; Shirmohammadi, Mahsa
ACM Transactions on Computational Logic (TOCL).  20 (2019)  2 - p. 1-27 , 2019
Link: https://dl.acm.org/doi/1..
 
?
11

Synchronizing Data Words for Register Automata:

Quaas, Karin ; Shirmohammadi, Mahsa
ACM Transactions on Computational Logic.  20 (2019)  2 - p. 1-27 , 2019
Link: https://doi.org/10.1145/..
 
?
12

Revisiting reachability in timed automata:

, In: Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science,
Quaas, Karin ; Shirmohammadi, Mahsa ; Worrell, James - p. 1-12 , 2017
Link: https://dl.acm.org/doi/1..
 
?
13

Parameterized model checking of weighted networks:

Meinecke, Ingmar ; Quaas, Karin
Theoretical Computer Science.  534 (2014)  - p. 69-85 , 2014
Link: https://doi.org/10.1016/..
 
?
14

MSO logics for weighted timed automata:

Quaas, Karin
Formal Methods in System Design.  38 (2011)  3 - p. 193-222 , 2011
Link: https://doi.org/10.1007/..
 
?
15

A Kleene–Schützenberger theorem for weighted timed automata:

Droste, Manfred ; Quaas, Karin
Theoretical Computer Science.  412 (2011)  12-14 - p. 1140-1153 , 2011
Link: https://doi.org/10.1016/..
 
1-15