( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Deciding Fast Termination for Probabilistic VASS with Nondeterminism.

, , , , и . ATVA, том 11781 из Lecture Notes in Computer Science, стр. 462-478. Springer, (2019)

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.

Krishnendu Mukherjee

Gudrun Chatterjee

Amitava Chatterjee

Indranil Chatterjee

Daniel Chatterjee

 

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

Reduction of stochastic parity to stochastic mean-payoff games., и . Inf. Process. Lett., 106 (1): 1-7 (2008)The Complexity of Mean-Payoff Pushdown Games., и . J. ACM, 64 (5): 34:1-34:49 (2017)Graph Planning with Expected Finite Horizon., и . CoRR, (2018)Sensor Synthesis for POMDPs with Reachability Objectives., , и . ICAPS, стр. 47-55. AAAI Press, (2018)Pushdown reachability with constant treewidth., и . Inf. Process. Lett., (2017)Qualitative concurrent parity games., , и . ACM Trans. Comput. Log., 12 (4): 28:1-28:51 (2011)Quantitative languages., , и . ACM Trans. Comput. Log., 11 (4): 23:1-23:38 (2010)Automated analysis of real-time scheduling using graph games., , и . HSCC, стр. 163-172. ACM, (2013)The Cost of Exactness in Quantitative Reachability., , и . Models, Algorithms, Logics and Tools, том 10460 из Lecture Notes in Computer Science, стр. 367-381. Springer, (2017)Timed Parity Games: Complexity and Robustness., , и . FORMATS, том 5215 из Lecture Notes in Computer Science, стр. 124-140. Springer, (2008)