Folgen
Karoliina Lehtinen
Karoliina Lehtinen
CNRS, Aix-Marseille Université, LIS
Bestätigte E-Mail-Adresse bei lis-lab.fr - Startseite
Titel
Zitiert von
Zitiert von
Jahr
A modal μ perspective on solving parity games in quasi-polynomial time
K Lehtinen
LICS 2018 Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in …, 2018
582018
Adventures in monitorability: from branching to linear time and back again
L Aceto, A Achilleos, A Francalanza, A Ingólfsdóttir, K Lehtinen
POPL 2019 Proceedings of the ACM on Programming Languages 3 (POPL), 1-29, 2019
562019
An operational guide to monitorability
L Aceto, A Achilleos, A Francalanza, A Ingólfsdóttir, K Lehtinen
SEFM 2019 International Conference on Software Engineering and Formal …, 2019
292019
Good for games automata: From nondeterminism to alternation
U Boker, K Lehtinen
CONCUR 2019 30th International Conference on Concurrency Theory 140, 19:1--19:16, 2019
222019
Good-for-games -Pushdown Automata
K Lehtinen, M Zimmermann
LICS 2020 Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in …, 2020
162020
History determinism vs. good for gameness in quantitative automata
U Boker, K Lehtinen
arXiv preprint arXiv:2110.14238, 2021
142021
An operational guide to monitorability with applications to regular properties
L Aceto, A Achilleos, A Francalanza, A Ingólfsdóttir, K Lehtinen
Software and Systems Modeling 20, 335-361, 2021
142021
The best a monitor can do
L Aceto, A Achilleos, A Francalanza, A Ingólfsdóttir, K Lehtinen
29th EACSL Annual Conference on Computer Science Logic (CSL 2021), 2021
142021
Alternating weak automata from universal trees
L Daviaud, M Jurdzinski, K Lehtinen
CONCUR 2019 30th International Conference on Concurrency Theory 140, 18:1--18:14, 2019
122019
Deciding the first levels of the modal mu alternation hierarchy by formula construction
K Lehtinen, S Quickert
CSL 2015 24th EACSL Annual Conference on Computer Science Logic, 2015
112015
On the way to alternating weak automata
U Boker, K Lehtinen
FSTTCS 2018 38th IARCS Annual Conference on Foundations of Software …, 2018
102018
Better late than never or: verifying asynchronous components at runtime
DP Attard, L Aceto, A Achilleos, A Francalanza, A Ingólfsdóttir, K Lehtinen
Formal Techniques for Distributed Objects, Components, and Systems: 41st …, 2021
92021
Register Games
K Lehtinen, U Boker
Logical Methods in Computer Science 16 (2), 2020
9*2020
Improving the complexity of Parys' recursive algorithm
K Lehtinen, S Schewe, D Wojtczak
arXiv preprint arXiv:1904.11810, 2019
82019
On the size of good-for-games Rabin automata and its link with the memory in Muller games
A Casares, T Colcombet, K Lehtinen
arXiv preprint arXiv:2204.11333, 2022
72022
A bit of nondeterminism makes pushdown automata expressive and succinct
S Guha, I Jecker, K Lehtinen, M Zimmermann
arXiv preprint arXiv:2105.02611, 2021
72021
Improving the complexity of Parys’ recursive algorithm. CoRR, abs/1904.11810
K Lehtinen, S Schewe, D Wojtczak
arXiv preprint arXiv:1904.11810, 2019
72019
Disjunctive form and the modal alternation hierarchy
K Lehtinen
FICS 2015 Tenth International Workshop on Fixed Points in Computer Science, 2015
72015
Token Games and History-Deterministic Quantitative Automata.
U Boker, K Lehtinen
FoSSaCS, 120-139, 2022
62022
A Recursive Approach to Solving Parity Games in Quasipolynomial Time
D Wojtczak, S Schewe, P Parys, K Lehtinen
Logical Methods in Computer Science 18, 2022
6*2022
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20