Expected Cost Analysis of Attack-Defense Trees. - Julia Eisentraut; Jan Kretínský (QEST, 2019)

Stopping Criteria for Value and Strategy Iteration on Concurrent Stochastic Reachability Games. - Julia Eisentraut; Jan Kretínský; Alexej Rotar (CoRR, 2019)

Assessing Security of Cryptocurrencies with Attack-Defense Trees: Proof of Concept and Future Directions. - Julia Eisentraut; Stephan Holzer; Katharina Klioba; Jan Kretínský; Lukas Pin; Alexander Wagner (ICTAC, 2021)

Value iteration for simple stochastic games: Stopping criterion and learning algorithm. - Julia Eisentraut; Edon Kelmendi; Jan Kretínský; Maximilian Weininger (Inf. Comput., 2022)

Learning Attack Trees by Genetic Algorithms. - Florian Dorfhuber; Julia Eisentraut; Jan Kretínský (ICTAC, 2023)

QuADTool: Attack-Defense-Tree Synthesis, Analysis and Bridge to Verification. - Florian Dorfhuber; Julia Eisentraut; Katharina Klioba; Jan Kretínský (QEST+FORMATS, 2024)

QuADTool: Attack-Defense-Tree Synthesis, Analysis and Bridge to Verification. - Florian Dorfhuber; Jan Kretínský; Julia Eisentraut (Zenodo, 2024)

QuADTool: Attack-Defense-Tree Synthesis, Analysis and Bridge to Verification. - Florian Dorfhuber; Jan Kretínský; Julia Eisentraut (Zenodo, 2024)