Follow
Karoliina Lehtinen
Karoliina Lehtinen
CNRS, Aix-Marseille Université, LIS
Verified email at lis-lab.fr - Homepage
Title
Cited by
Cited by
Year
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
642019
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
622018
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
332019
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
302019
Good-for-games -Pushdown Automata
K Lehtinen, M Zimmermann
LICS 2020 Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in …, 2020
222020
History determinism vs. good for gameness in quantitative automata
U Boker, K Lehtinen
arXiv preprint arXiv:2110.14238, 2021
212021
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
212021
A recursive approach to solving parity games in quasipolynomial time
K Lehtinen, P Parys, S Schewe, D Wojtczak
Logical Methods in Computer Science 18, 2022
182022
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
182021
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
152022
Better late than never or: verifying asynchronous components at runtime
DP Attard, L Aceto, A Achilleos, A Francalanza, A Ingólfsdóttir, K Lehtinen
International Conference on Formal Techniques for Distributed Objects …, 2021
142021
A bit of nondeterminism makes pushdown automata expressive and succinct
S Guha, I Jecker, K Lehtinen, M Zimmermann
Logical Methods in Computer Science 20, 2024
122024
Token Games and History-Deterministic Quantitative Automata.
U Boker, K Lehtinen
FoSSaCS, 120-139, 2022
122022
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
On the succinctness of alternating parity good-for-games automata
U Boker, D Kuperberg, K Lehtinen, M Skrzypczak
arXiv preprint arXiv:2009.14437, 2020
92020
Register Games
K Lehtinen, U Boker
Logical Methods in Computer Science 16 (2), 2020
9*2020
When a little nondeterminism goes a long way: An introduction to history-determinism
U Boker, K Lehtinen
ACM SIGLOG News 10 (1), 24-51, 2023
72023
Parikh automata over infinite words
S Guha, I Jecker, K Lehtinen, M Zimmermann
arXiv preprint arXiv:2207.07694, 2022
72022
The system can't perform the operation now. Try again later.
Articles 1–20