Author of the publication

The Cost of Monitoring Alone.

, , , , and . From Reactive Systems to Cyber-Physical Systems, volume 11500 of Lecture Notes in Computer Science, page 259-275. 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.

 

Other publications of authors with the same name

Improving the complexity of Parys' recursive algorithm., , and . CoRR, (2019)A modal μ perspective on solving parity games in quasi-polynomial time.. LICS, page 639-648. ACM, (2018)∑μ2 is decidable for ∏μ2., and . CiE, volume 10307 of Lecture Notes in Computer Science, page 292-303. Springer, (2017)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)On the Translation of Automata to Linear Temporal Logic., , and . FoSSaCS, volume 13242 of Lecture Notes in Computer Science, page 140-160. Springer, (2022)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)Parikh Automata over Infinite Words., , , and . FSTTCS, volume 250 of LIPIcs, page 40:1-40:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism., , , and . TheoretiCS, (2024)The descriptive complexity of modal mu model-checking parity games.. GandALF, volume 256 of EPTCS, page 76-90. (2017)