Author of the publication

Revisiting Parameter Synthesis for One-Counter Automata.

, and . CSL, volume 216 of LIPIcs, page 33:1-33:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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. 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

Graph-Based Reductions for Parametric and Weighted MDPs., , and . ATVA (1), volume 14215 of Lecture Notes in Computer Science, page 137-157. Springer, (2023)The complexity of reachability in parametric Markov decision processes., , , and . J. Comput. Syst. Sci., (2021)The fixed initial credit problem for energy games with partial-observation is Ackermann-complete.. CoRR, (2015)The Extended HOA Format for Synthesis.. CoRR, (2019)Learning Realtime One-Counter Automata., , and . TACAS (1), volume 13243 of Lecture Notes in Computer Science, page 244-262. Springer, (2022)Formally-Sharp DAgger for MCTS: Lower-Latency Monte Carlo Tree Search using Data Aggregation with Formal Methods., , , and . AAMAS, page 1354-1362. ACM, (2023)When is Containment Decidable for Probabilistic Automata?., , , , , and . ICALP, volume 107 of LIPIcs, page 121:1-121:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The Impatient May Use Limited Optimism to Minimize Regret., , and . FoSSaCS, volume 11425 of Lecture Notes in Computer Science, page 133-149. Springer, (2019)The Wasserstein Believer: Learning Belief Updates for Partially Observable Environments through Reliable Latent Space Models., , , , and . ICLR, OpenReview.net, (2024)On the Complexity of Reachability in Parametric Markov Decision Processes., , , and . CONCUR, volume 140 of LIPIcs, page 14:1-14:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)