( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Geometry of Reachability in Continuous Vector Addition Systems with States.

, , , и . MFCS, том 272 из LIPIcs, стр. 11:1-11:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

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

Roberto Francisco Pérez Benito

Ema Pérez Bravo

José Guadalupe Pérez-Ramírez

Elsa Pérez Rodriguez

 

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

The fixed initial credit problem for energy games with partial-observation is Ackermann-complete.. CoRR, (2015)The Extended HOA Format for Synthesis.. CoRR, (2019)Graph-Based Reductions for Parametric and Weighted MDPs., , и . ATVA (1), том 14215 из Lecture Notes in Computer Science, стр. 137-157. Springer, (2023)Learning Realtime One-Counter Automata., , и . TACAS (1), том 13243 из Lecture Notes in Computer Science, стр. 244-262. Springer, (2022)When is Containment Decidable for Probabilistic Automata?., , , , , и . ICALP, том 107 из LIPIcs, стр. 121:1-121:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The Wasserstein Believer: Learning Belief Updates for Partially Observable Environments through Reliable Latent Space Models., , , , и . ICLR, OpenReview.net, (2024)Revisiting Parameter Synthesis for One-Counter Automata., и . CSL, том 216 из LIPIcs, стр. 33:1-33:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Algorithms for Markov Binomial Chains., , , и . CoRR, (2024)Correction to: Reactive synthesis without regret., , и . Acta Informatica, 59 (5): 671 (2022)Reactive Synthesis Without Regret., , и . CONCUR, том 42 из LIPIcs, стр. 114-127. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)