( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Synthesis Tool for Optimal Monitors in a Branching-Time Setting.

, , , , и . COORDINATION, том 13271 из Lecture Notes in Computer Science, стр. 181-199. Springer, (2022)

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.

Karoliina Pelttari

Riia Karoliina Junnila

Emma Karoliina Seppälä

 

Другие публикации лиц с тем же именем

A modal μ perspective on solving parity games in quasi-polynomial time.. LICS, стр. 639-648. ACM, (2018)∑μ2 is decidable for ∏μ2., и . CiE, том 10307 из Lecture Notes in Computer Science, стр. 292-303. Springer, (2017)Improving the complexity of Parys' recursive algorithm., , и . CoRR, (2019)History-Deterministic Timed Automata., , и . CONCUR, том 243 из LIPIcs, стр. 14:1-14:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Alternating Weak Automata from Universal Trees., , и . CONCUR, том 140 из LIPIcs, стр. 18:1-18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Mostowski Index via extended register games., и . CoRR, (2024)Good-for-games ω-Pushdown Automata., и . LICS, стр. 689-702. ACM, (2020)History-Deterministic Timed Automata Are Not Determinizable., , , , и . RP, том 13608 из Lecture Notes in Computer Science, стр. 67-76. Springer, (2022)The descriptive complexity of modal mu model-checking parity games.. GandALF, том 256 из EPTCS, стр. 76-90. (2017)A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct., , , и . MFCS, том 202 из LIPIcs, стр. 53:1-53:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)