Follow
Vojtěch Havlena
Vojtěch Havlena
Verified email at fit.vutbr.cz
Title
Cited by
Cited by
Year
Approximate reduction of finite automata for high-speed network intrusion detection
M Češka, V Havlena, L Holík, O Lengál, T Vojnar
International Journal on Software Tools for Technology Transfer 22 (5), 523-539, 2020
212020
Flow based monitoring of ICS communication in the smart grid
P Matoušek, O Ryšavý, M Grégr, V Havlena
Journal of Information Security and Applications 54, 102535, 2020
132020
Deep packet inspection in FPGAs via approximate nondeterministic automata
M Ceška, V Havlena, L Holík, J Korenek, O Lengál, D Matoušek, ...
2019 IEEE 27th Annual International Symposium on Field-Programmable Custom …, 2019
122019
Simulations in rank-based Büchi automata complementation
YF Chen, V Havlena, O Lengál
Asian Symposium on Programming Languages and Systems, 447-467, 2019
92019
Reducing (To) the ranks: efficient rank-based Büchi automata complementation
V Havlena, O Lengál
32nd International Conference on Concurrency Theory (CONCUR 2021), 2021
72021
Ranker (2021)
V Havlena, O Lengál, B Šmahlíková
URL: https://github. com/vhavlena/ba-inclusion, 0
5
Sky Is Not the Limit
V Havlena, O Lengál, B Šmahlíková
International Conference on Tools and Algorithms for the Construction and …, 2022
42022
Automata terms in a lazy WSkS decision procedure
V Havlena, L Holík, O Lengál, T Vojnar
Journal of Automated Reasoning 65 (7), 971-999, 2021
32021
Deciding S1S: Down the rabbit hole and through the looking glass
V Havlena, O Lengál, B Šmahlíková
International Conference on Networked Systems, 215-222, 2021
32021
Efficient modelling of ics communication for anomaly detection using probabilistic automata
P Matoušek, V Havlena, L Holík
2021 IFIP/IEEE International Symposium on Integrated Network Management (IM …, 2021
32021
Reducing (to) the Ranks: Efficient Rank-based B\"{u} chi Automata Complementation (Technical Report)
V Havlena, O Lengál
arXiv preprint arXiv:2010.07834, 2020
32020
A symbolic algorithm for the case-split rule in string constraint solving
YF Chen, V Havlena, O Lengál, A Turrini
Asian Symposium on Programming Languages and Systems, 343-363, 2020
22020
Antiprenexing for WSkS: A Little Goes a Long Way.
V Havlena, L Holík, O Lengal, O Vales, T Vojnar
LPAR, 298-316, 2020
22020
Complementing B\" uchi Automata with Ranker (Technical Report)
V Havlena, O Lengál, B Šmahlíková
arXiv preprint arXiv:2206.01946, 2022
12022
Complementing Büchi automata with Ranker
V Havlena, O Lengál, B Šmahlíková
International Conference on Computer Aided Verification, 188-201, 2022
12022
Learning Probabilistic Automata in the Context of IEC 104
V Havlena, L Holık, P Matoušek
Brno University of Technology, Tech. Rep, 2020
12020
Automata terms in a lazy WSkS decision procedure (technical report)
V Havlena, L Holík, O Lengál, T Vojnar
arXiv preprint arXiv:1905.08697, 2019
12019
Sky Is Not the Limit: Tighter Rank Bounds for Elevator Automata in B\"{u} chi Automata Complementation (Technical Report)
V Havlena, O Lengál, B Šmahlíková
arXiv preprint arXiv:2110.10187, 2021
2021
Simulations in Rank-Based B\" uchi Automata Complementation (Technical Report)
YF Chen, V Havlena, O Lengál
arXiv preprint arXiv:1905.07139, 2019
2019
Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection (Technical Report)
M Ceska, V Havlena, L Holik, O Lengal, T Vojnar
arXiv preprint arXiv:1710.08647, 2017
2017
The system can't perform the operation now. Try again later.
Articles 1–20