Karoliina Lehtinen

According to our database, Karoliina Lehtinen authored at least 37 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.

Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann

Log. Methods Comput. Sci., 2024

2023

When a Little Nondeterminism Goes a Long Way: An Introduction to History-Determinism.

Udi Boker, Karoliina Lehtinen

ACM SIGLOG News, January, 2023

Token Games and History-Deterministic Quantitative-Automata.

Udi Boker, Karoliina Lehtinen

Log. Methods Comput. Sci., 2023

From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History-)Determinism.

Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow, Karoliina Lehtinen

CoRR, 2023

History-deterministic Timed Automata.

Sougata Bose, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, Patrick Totzke

CoRR, 2023

A Brief History of History-Determinism (Invited Talk).

Karoliina Lehtinen

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

History-Deterministic Parikh Automata.

Enzo Erlich, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann

Proceedings of the 34th International Conference on Concurrency Theory, 2023

2022

Good-for-games ω-Pushdown Automata.

Karoliina Lehtinen, Martin Zimmermann

Log. Methods Comput. Sci., 2022

A Recursive Approach to Solving Parity Games in Quasipolynomial Time.

Karoliina Lehtinen, Pawel Parys, Sven Schewe, Dominik Wojtczak

Log. Methods Comput. Sci., 2022

History-Deterministic Timed Automata Are Not Determinizable.

Sougata Bose, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, Patrick Totzke

Proceedings of the Reachability Problems - 16th International Conference, 2022

On the Size of Good-For-Games Rabin Automata and Its Link with the Memory in Muller Games.

Antonio Casares, Thomas Colcombet, Karoliina Lehtinen

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Parikh Automata over Infinite Words.

Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

On the Translation of Automata to Linear Temporal Logic.

Udi Boker, Karoliina Lehtinen, Salomon Sickert

Proceedings of the Foundations of Software Science and Computation Structures, 2022

A Synthesis Tool for Optimal Monitors in a Branching-Time Setting.

Antonis Achilleos, Léo Exibard, Adrian Francalanza, Karoliina Lehtinen, Jasmine Xuereb

Proceedings of the Coordination Models and Languages, 2022

History-Deterministic Timed Automata.

Thomas A. Henzinger, Karoliina Lehtinen, Patrick Totzke

Proceedings of the 33rd International Conference on Concurrency Theory, 2022

On Probabilistic Monitorability.

Luca Aceto, Antonis Achilleos, Elli Anastasiadi, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen, Mathias Ruggaard Pedersen

Proceedings of the Principles of Systems Design, 2022

2021

An operational guide to monitorability with applications to regular properties.

Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen

Softw. Syst. Model., 2021

History Determinism vs. Good for Gameness in Quantitative Automata.

Udi Boker, Karoliina Lehtinen

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

Better Late Than Never or: Verifying Asynchronous Components at Runtime.

Duncan Paul Attard, Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen

Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2021

The Best a Monitor Can Do.

Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen

Proceedings of the 29th EACSL Annual Conference on Computer Science Logic, 2021

2020

Register Games.

Karoliina Lehtinen, Udi Boker

Log. Methods Comput. Sci., 2020

On Succinctness and Recognisability of Alternating Good-for-Games Automata.

Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak

CoRR, 2020

On the Succinctness of Alternating Parity Good-For-Games Automata.

Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2019

Adventures in monitorability: from branching to linear time and back again.

Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen

Proc. ACM Program. Lang., 2019

Improving the complexity of Parys' recursive algorithm.

Karoliina Lehtinen, Sven Schewe, Dominik Wojtczak

CoRR, 2019

An Operational Guide to Monitorability.

Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen

Proceedings of the Software Engineering and Formal Methods - 17th International Conference, 2019

Alternating Weak Automata from Universal Trees.

Laure Daviaud, Marcin Jurdzinski, Karoliina Lehtinen

Proceedings of the 30th International Conference on Concurrency Theory, 2019

Good for Games Automata: From Nondeterminism to Alternation.

Udi Boker, Karoliina Lehtinen

Proceedings of the 30th International Conference on Concurrency Theory, 2019

The Cost of Monitoring Alone.

Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen

Proceedings of the From Reactive Systems to Cyber-Physical Systems, 2019

Testing Equivalence vs. Runtime Monitoring.

Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Karoliina Lehtinen

Proceedings of the Models, Languages, and Tools for Concurrent and Distributed Programming, 2019

2018

A modal μ perspective on solving parity games in quasi-polynomial time.

Karoliina Lehtinen

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

On the Way to Alternating Weak Automata.

Udi Boker, Karoliina Lehtinen

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017

The descriptive complexity of modal mu model-checking parity games.

Karoliina Lehtinen

Proceedings of the Proceedings Eighth International Symposium on Games, 2017

Σ^μ₂ is decidable for Π^μ₂.

Karoliina Lehtinen, Sandra Quickert

CoRR, 2017

∑^μ₂ is decidable for ∏^μ₂.

Karoliina Lehtinen, Sandra Quickert

Proceedings of the Unveiling Dynamics and Complexity, 2017

2015

Disjunctive form and the modal μ alternation hierarchy.

Karoliina Lehtinen

Proceedings of the Proceedings Tenth International Workshop on Fixed Points in Computer Science, 2015

Deciding the First Levels of the Modal mu Alternation Hierarchy by Formula Construction.

Karoliina Lehtinen, Sandra Quickert

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015