( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
When is Containment Decidable for Probabilistic Automata?.

, , , , , и . ICALP, том 107 из LIPIcs, стр. 121:1-121:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)

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.

Gerald Jurdzinski

Marcin Wlodarski

Marcin Siatkowski

Marcin Wlodarczak

Marcin Tysiac

 

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

Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games., , , , , и . SODA, стр. 2333-2349. SIAM, (2019)Model Checking Probabilistic Timed Automata with One or Two Clocks, , и . CoRR, (2008)Trading Probability for Fairness., , и . CSL, том 2471 из Lecture Notes in Computer Science, стр. 292-305. Springer, (2002)Interface Compatibility Checking for Software Modules., , , , и . CAV, том 2404 из Lecture Notes in Computer Science, стр. 428-441. Springer, (2002)A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games., , и . FSTTCS, том 250 из LIPIcs, стр. 44:1-44:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)When are emptiness and containment decidable for probabilistic automata?, , , , , и . J. Comput. Syst. Sci., (2021)Quantitative stochastic parity games., , и . SODA, стр. 121-130. SIAM, (2004)Zero-Sum Game Techniques for Approximate Nash Equilibria., , и . AAMAS, стр. 1514-1516. ACM, (2017)Average-Price-per-Reward Games on Hybrid Automata with Strong Resets., , и . VMCAI, том 5403 из Lecture Notes in Computer Science, стр. 167-181. Springer, (2009)Games with Secure Equilibria., , и . LICS, стр. 160-169. IEEE Computer Society, (2004)