From post

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.

 

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

An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems., , и . LPAR, том 2850 из Lecture Notes in Computer Science, стр. 361-375. Springer, (2003)Decidability of Reachability Problems for Classes of Two Counters Automata., и . STACS, том 1770 из Lecture Notes in Computer Science, стр. 346-357. Springer, (2000)Hyper-Ackermannian bounds for pushdown vector addition systems., , и . CSL-LICS, стр. 63:1-63:10. ACM, (2014)Well-Abstracted Transition Systems., , и . CONCUR, том 1877 из Lecture Notes in Computer Science, стр. 566-580. Springer, (2000)On Flatness for 2-Dimensional Vector Addition Systems with States., и . CONCUR, том 3170 из Lecture Notes in Computer Science, стр. 402-416. Springer, (2004)The Context-Freeness Problem Is coNP-Complete for Flat Counter Systems., , и . ATVA, том 8837 из Lecture Notes in Computer Science, стр. 248-263. Springer, (2014)Accelerated Data-Flow Analysis., и . SAS, том 4634 из Lecture Notes in Computer Science, стр. 184-199. Springer, (2007)Lazy abstraction., , , и . POPL, стр. 58-70. ACM, (2002)ACM SIGPLAN Notices 37(1), January 2002.Reachability in Two-Dimensional Vector Addition Systems with States: One Test Is for Free., и . CONCUR, том 171 из LIPIcs, стр. 37:1-37:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Qualitative Transition Systems for the Abstraction and Comparison of Transient Behavior in Parametrized Dynamic Models., , и . CMSB, том 5688 из Lecture Notes in Computer Science, стр. 313-327. Springer, (2009)