( en | de | ru )

 

Disambiguation of "Lehtinen, Karoliina"

Author of the publication

copydeleteadd this publication to your clipboard
Testing Equivalence vs. Runtime Monitoring.

, , , , and . Models, Languages, and Tools for Concurrent and Distributed Programming, volume 11665 of Lecture Notes in Computer Science, page 28-44. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Karoliina Pelttari

Riia Karoliina Junnila

Emma Karoliina Seppälä

 

Other publications of authors with the same name

∑μ2 is decidable for ∏μ2., and . CiE, volume 10307 of Lecture Notes in Computer Science, page 292-303. Springer, (2017)A modal μ perspective on solving parity games in quasi-polynomial time.. LICS, page 639-648. ACM, (2018)Improving the complexity of Parys' recursive algorithm., , and . CoRR, (2019)History-Deterministic Timed Automata., , and . CONCUR, volume 243 of LIPIcs, page 14:1-14:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Alternating Weak Automata from Universal Trees., , and . CONCUR, volume 140 of LIPIcs, page 18:1-18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Mostowski Index via extended register games., and . CoRR, (2024)History-Deterministic Timed Automata Are Not Determinizable., , , , and . RP, volume 13608 of Lecture Notes in Computer Science, page 67-76. Springer, (2022)The descriptive complexity of modal mu model-checking parity games.. GandALF, volume 256 of EPTCS, page 76-90. (2017)Good-for-games ω-Pushdown Automata., and . LICS, page 689-702. ACM, (2020)An Operational Guide to Monitorability., , , , and . SEFM, volume 11724 of Lecture Notes in Computer Science, page 433-453. Springer, (2019)