( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Coverability in 1-VASS with Disequality Tests.

, , , , и . CONCUR, том 171 из LIPIcs, стр. 38:1-38:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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.

Guillermo Pérez Hernández

Ema Pérez Bravo

José Guadalupe Pérez-Ramírez

Elsa Pérez Rodriguez

Carmen Pérez Samaniego

 

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

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