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.

 

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

Accelerated Verification of Parametric Protocols with Decision Trees., , , , и . ICCD, стр. 397-404. IEEE, (2020)Requirements-Level Semantics and Model Checking of Object-Oriented Statecharts, , и . Requirements Engineering, V7 (4): 243--263 (декабря 2002)An O(mlogn) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation., , , и . ACM Trans. Comput. Log., 18 (2): 13:1-13:34 (2017)Formal Verification of Consensus in the Taurus Distributed Database., , , , , , и . FM, том 13047 из Lecture Notes in Computer Science, стр. 741-751. Springer, (2021)CHA: Supporting SVA-Like Assertions in Formal Verification of Chisel Programs (Tool Paper)., , , , , , и . SEFM, том 13550 из Lecture Notes in Computer Science, стр. 324-331. Springer, (2022)Probably on Time and within Budget: On Reachability in Priced Probabilistic Timed Automata., , и . QEST, стр. 311-322. IEEE Computer Society, (2006)Fortuna: Model Checking Priced Probabilistic Timed Automata., , и . QEST, стр. 273-281. IEEE Computer Society, (2010)A Probabilistic Extension of UML Statecharts: Specification and Verification, , и . Intl. Symp. on Formal Techniques in Real-Time and Fault-Tolerant Systems, стр. 355--374. Springer, (сентября 2002)Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata., , и . TAMC, том 5532 из Lecture Notes in Computer Science, стр. 128-137. Springer, (2009)Minimal Separating Sequences for All Pairs of States., , и . LATA, том 9618 из Lecture Notes in Computer Science, стр. 181-193. Springer, (2016)