Solving QBF by abstraction J Hecking-Harbusch, L Tentrup arXiv preprint arXiv:1604.06752, 2016 | 20* | 2016 |
Model checking data flows in concurrent network updates B Finkbeiner, M Gieseking, J Hecking-Harbusch, ER Olderog Automated Technology for Verification and Analysis: 17th International …, 2019 | 17 | 2019 |
AdamMC: A Model Checker for Petri Nets with Transits against Flow-LTL B Finkbeiner, M Gieseking, J Hecking-Harbusch, ER Olderog Proceedings of CAV, 2020 | 15 | 2020 |
Translating asynchronous games for distributed synthesis R Beutner, B Finkbeiner, J Hecking-Harbusch CONCUR, 2019 | 14* | 2019 |
Symbolic vs. bounded synthesis for Petri games B Finkbeiner, M Gieseking, J Hecking-Harbusch, ER Olderog arXiv preprint arXiv:1711.10637, 2017 | 13 | 2017 |
Efficient trace encodings of bounded synthesis for asynchronous distributed systems J Hecking-Harbusch, NO Metzger Automated Technology for Verification and Analysis: 17th International …, 2019 | 10 | 2019 |
A Web Interface for Petri Nets with Transits and Petri Games M Gieseking, J Hecking-Harbusch, A Yanich Tools and Algorithms for the Construction and Analysis of Systems 27th …, 2021 | 6 | 2021 |
Model checking branching properties on Petri nets with transits B Finkbeiner, M Gieseking, J Hecking-Harbusch, ER Olderog Automated Technology for Verification and Analysis: 18th International …, 2020 | 6* | 2020 |
Global Winning Conditions in Synthesis of Distributed Systems with Causal Memory B Finkbeiner, M Gieseking, J Hecking-Harbusch, ER Olderog Proceedings of CSL, 1-36, 2022 | 5* | 2022 |
Synthesis of asynchronous distributed systems from global specifications J Hecking-Harbusch Saarländische Universitäts-und Landesbibliothek, 2021 | | 2021 |