From post

On the Decidability of Temporal Properties of Probabilistic Pushdown Automata.

, , и . STACS, том 3404 из Lecture Notes in Computer Science, стр. 145-157. Springer, (2005)

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.

 

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

On Relative Randomness.. Ann. Pure Appl. Log., 63 (1): 61-67 (1993)Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems., , и . CONCUR, том 3170 из Lecture Notes in Computer Science, стр. 193-208. Springer, (2004)On Homogeneous Segments., , и . TSD, том 2807 из Lecture Notes in Computer Science, стр. 152-157. Springer, (2003)Efficient Analysis of Probabilistic Programs with an Unbounded Counter., , и . CAV, том 6806 из Lecture Notes in Computer Science, стр. 208-224. Springer, (2011)Preface., , , , и . Fundam. Informaticae, (2013)Preface., и . Theor. Comput. Sci., (2012)Regstar: efficient strategy synthesis for adversarial patrolling games., , , и . UAI, том 161 из Proceedings of Machine Learning Research, стр. 471-481. AUAI Press, (2021)Optimizing Local Satisfaction of Long-Run Average Objectives in Markov Decision Processes., , , , и . AAAI, стр. 20143-20150. AAAI Press, (2024)The Satisfiability Problem for a Quantitative Fragment of PCTL., и . FCT, том 12867 из Lecture Notes in Computer Science, стр. 149-161. Springer, (2021)The satisfiability problem for a quantitative fragment of PCTL., и . J. Comput. Syst. Sci., (февраля 2024)