( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets.

, и . FoSSaCS, том 5504 из Lecture Notes in Computer Science, стр. 348-363. Springer, (2009)

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.

Richard Mayr

Richard Mayr

Richard Mayr

Richard Mayr

Richard Mayr

 

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

Minimal Cost Reachability/Coverability in Priced Timed Petri Nets., и . FoSSaCS, том 5504 из Lecture Notes in Computer Science, стр. 348-363. Springer, (2009)Strategy Complexity of Parity Objectives in Countable MDPs., , , и . CONCUR, том 171 из LIPIcs, стр. 39:1-39:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Simple Stochastic Games with Almost-Sure Energy-Parity Objectives are in NP and coNP., , , и . FoSSaCS, том 12650 из Lecture Notes in Computer Science, стр. 427-447. Springer, (2021)Memoryless Strategies in Stochastic Reachability Games., , , и . CoRR, (2024)Transience in Countable MDPs., , , и . CoRR, (2020)Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs., и . CoRR, (2022)Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs., и . Log. Methods Comput. Sci., (2023)Strategy Complexity of Mean Payoff, Total Payoff and Point Payoff Objectives in Countable MDPs., и . CONCUR, том 203 из LIPIcs, стр. 12:1-12:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Transience in Countable MDPs., , , и . CONCUR, том 203 из LIPIcs, стр. 11:1-11:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Büchi Objectives in Countable MDPs., , , и . ICALP, том 132 из LIPIcs, стр. 119:1-119:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)