| Angluin-Style Learning of NFA. B Bollig, P Habermehl, C Kern, M Leucker IJCAI 9, 1004-1009, 2009 | 183 | 2009 |
| libalf: The Automata Learning Framework B Bollig, JP Katoen, C Kern, M Leucker, D Neider, DR Piegdon International Conference on Computer Aided Verification, 360-364, 2010 | 139 | 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 | 125 | 2004 |
| Emptiness of multi-pushdown automata is 2ETIME-complete MF Atig, B Bollig, P Habermehl International Conference on Developments in Language Theory, 121-133, 2008 | 78 | 2008 |
| Local parallel model checking for the alternation-free μ-calculus B Bollig, M Leucker, M Weber International SPIN Workshop on Model Checking of Software, 128-147, 2002 | 65 | 2002 |
| Message-passing automata are expressively equivalent to EMSO logic B Bollig, M Leucker Theoretical Computer Science 358 (2-3), 150-172, 2006 | 61 | 2006 |
| Parallel model checking for the alternation free μ-calculus B Bollig, M Leucker, M Weber International Conference on Tools and Algorithms for the Construction and …, 2001 | 58 | 2001 |
| Weighted versus probabilistic logics B Bollig, P Gastin International Conference on Developments in Language Theory, 18-38, 2009 | 50 | 2009 |
| Learning communicating automata from MSCs B Bollig, JP Katoen, C Kern, M Leucker IEEE Transactions on Software Engineering 36 (3), 390-408, 2010 | 48 | 2010 |
| Distributed timed automata with independently evolving clocks S Akshay, B Bollig, P Gastin, M Mukund, K Narayan Kumar International Conference on Concurrency Theory, 82-97, 2008 | 47 | 2008 |
| A fresh approach to learning register automata B Bollig, P Habermehl, M Leucker, B Monmege International Conference on Developments in Language Theory, 118-130, 2013 | 45 | 2013 |
| Propositional dynamic logic for message-passing systems B Bollig, D Kuske, I Meinecke Logical Methods in Computer Science 6, 2010 | 40 | 2010 |
| Pebble weighted automata and transitive closure logics B Bollig, P Gastin, B Monmege, M Zeitoun International Colloquium on Automata, Languages, and Programming, 587-598, 2010 | 40 | 2010 |
| Replaying play in and play out: Synthesis of design models from scenarios by learning B Bollig, JP Katoen, C Kern, M Leucker International Conference on Tools and Algorithms for the Construction and …, 2007 | 38 | 2007 |
| Model checking languages of data words B Bollig, A Cyriac, P Gastin, K Narayan Kumar International Conference on Foundations of Software Science and …, 2012 | 35 | 2012 |
| 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 | 34 | 2014 |
| An optimal construction of Hanf sentences B Bollig, D Kuske Journal of Applied Logic 10 (2), 179-186, 2012 | 31 | 2012 |
| An automaton over data words that captures EMSO logic B Bollig International Conference on Concurrency Theory, 171-186, 2011 | 31 | 2011 |
| Frequency linear-time temporal logic B Bollig, N Decker, M Leucker 2012 Sixth International Symposium on Theoretical Aspects of Software …, 2012 | 28 | 2012 |
| An automata-theoretic approach to the verification of distributed algorithms C Aiswarya, B Bollig, P Gastin Information and Computation 259, 305-327, 2018 | 27 | 2018 |
