| Angluin-Style Learning of NFA. B Bollig, P Habermehl, C Kern, M Leucker IJCAI 9, 1004-1009, 2009 | 162 | 2009 |
| libalf: The automata learning framework B Bollig, JP Katoen, C Kern, M Leucker, D Neider, DR Piegdon Computer Aided Verification: 22nd International Conference, CAV 2010 …, 2010 | 124 | 2010 |
| Controller synthesis for probabilistic systems C Baier, M Größer, M Leucker, B Bollig, F Ciesinski Exploring New Frontiers of Theoretical Informatics: IFIP 18th World Computer …, 2004 | 122 | 2004 |
| Emptiness of ordered multi-pushdown automata is 2ETIME-complete MF Atig, B Bollig, P Habermehl International Journal of Foundations of Computer Science 28 (08), 945-975, 2017 | 87* | 2017 |
| Learning communicating automata from MSCs B Bollig, JP Katoen, C Kern, M Leucker IEEE Transactions on Software Engineering 36 (3), 390-408, 2010 | 73* | 2010 |
| A robust class of data languages and an application to learning B Bollig, P Habermehl, M Leucker, B Monmege Logical Methods in Computer Science 10, 2014 | 65* | 2014 |
| Message-passing automata are expressively equivalent to EMSO logic B Bollig, M Leucker Theoretical Computer Science 358 (2-3), 150-172, 2006 | 61 | 2006 |
| Local parallel model checking for the alternation-free μ-calculus B Bollig, M Leucker, M Weber Model Checking Software: 9th International SPIN Workshop Grenoble, France …, 2002 | 61 | 2002 |
| Parallel model checking for the alternation free μ-calculus B Bollig, M Leucker, M Weber Tools and Algorithms for the Construction and Analysis of Systems: 7th …, 2001 | 57 | 2001 |
| Distributed timed automata with independently evolving clocks S Akshay, B Bollig, P Gastin, M Mukund, KN Kumar Fundamenta Informaticae 130 (4), 377-407, 2014 | 51* | 2014 |
| Weighted versus probabilistic logics B Bollig, P Gastin International Conference on Developments in Language Theory, 18-38, 2009 | 49 | 2009 |
| Pebble weighted automata and weighted logics B Bollig, P Gastin, B Monmege, M Zeitoun ACM Transactions on Computational Logic (TOCL) 15 (2), 1-35, 2014 | 46* | 2014 |
| Propositional dynamic logic for message-passing systems B Bollig, D Kuske, I Meinecke Logical Methods in Computer Science 6, 2010 | 39 | 2010 |
| Model checking languages of data words B Bollig, A Cyriac, P Gastin, K Narayan Kumar International Conference on Foundations of Software Science and …, 2012 | 33 | 2012 |
| An optimal construction of Hanf sentences B Bollig, D Kuske Journal of Applied Logic 10 (2), 179-186, 2012 | 30 | 2012 |
| An automaton over data words that captures EMSO logic B Bollig International Conference on Concurrency Theory, 171-186, 2011 | 29 | 2011 |
| Frequency linear-time temporal logic B Bollig, N Decker, M Leucker 2012 Sixth International Symposium on Theoretical Aspects of Software …, 2012 | 28 | 2012 |
| Analysis of recurrent neural networks via property-directed verification of surrogate models I Khmelnitsky, D Neider, R Roy, X Xie, B Barbot, B Bollig, A Finkel, ... International Journal on Software Tools for Technology Transfer 25 (3), 341-354, 2023 | 25* | 2023 |
| An automata-theoretic approach to the verification of distributed algorithms C Aiswarya, B Bollig, P Gastin Information and Computation 259, 305-327, 2018 | 25 | 2018 |
| Realizability of dynamic MSC languages B Bollig, L Hélouët International Computer Science Symposium in Russia, 48-59, 2010 | 25 | 2010 |
