( en | de | ru )

 

Disambiguation of "Lengál, Ondrej"

Author of the publication

copydeleteadd this publication to your clipboard
Fair Termination for Parameterized Probabilistic Concurrent Systems (Technical Report).

, , , and . CoRR, (2017)

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. You can also use the button next to the name to display some publications already assigned to the person.

Ondrej Burkacky

Ondrej Kuncar

Ondrej Vorisek

Ondrej Zofka

Ondrej Rypacek

 

Other publications of authors with the same name

Fair Termination for Parameterized Probabilistic Concurrent Systems (Technical Report)., , , and . CoRR, (2017)Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection., , , , and . CoRR, (2017)Z3-Noodler: An Automata-based String Solver (Technical Report)., , , , , and . CoRR, (2023)Complementing Büchi Automata with Ranker (Technical Report)., , and . CoRR, (2022)Approximate reduction of finite automata for high-speed network intrusion detection., , , , and . Int. J. Softw. Tools Technol. Transf., 22 (5): 523-539 (2020)Reducing (to) the Ranks: Efficient Rank-based Büchi Automata Complementation (Technical Report)., and . CoRR, (2020)HAVEN: An Open Framework for FPGA-Accelerated Functional Verification of Hardware., , and . Haifa Verification Conference, volume 7261 of Lecture Notes in Computer Science, page 247-253. Springer, (2011)Nested antichains for WS1S., , , and . Acta Inf., 56 (3): 205-228 (2019)Simulations in Rank-Based Büchi Automata Complementation., , and . APLAS, volume 11893 of Lecture Notes in Computer Science, page 447-467. Springer, (2019)Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation., and . CONCUR, volume 203 of LIPIcs, page 2:1-2:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)