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)Reachability for Two-Counter Machines with One Test and One Reset., , и . FSTTCS, том 122 из LIPIcs, стр. 31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)McScM: A General Framework for the Verification of Communicating Machines., , и . TACAS, том 7214 из Lecture Notes in Computer Science, стр. 478-484. Springer, (2012)Extrapolation-Based Path Invariants for Abstraction Refinement of Fifo Systems., , и . SPIN, том 5578 из Lecture Notes in Computer Science, стр. 107-124. Springer, (2009)Temporal-Safety Proofs for Systems Code., , , , , и . CAV, том 2404 из Lecture Notes in Computer Science, стр. 526-538. Springer, (2002)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)Verification of Embedded Reactive Fiffo Systems., , , , и . LATIN, том 2286 из Lecture Notes in Computer Science, стр. 400-414. Springer, (2002)Acceleration in Convex Data-Flow Analysis., и . FSTTCS, том 4855 из Lecture Notes in Computer Science, стр. 520-531. Springer, (2007)Flat counter automata almost everywhere!., и . Software Verification: Infinite-State Model Checking and Static Program Analysis, том 06081 из Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2006)