Follow
Benedikt Bollig
Benedikt Bollig
CNRS, LMF, ENS Paris-Saclay, UniversitÚ Paris-Saclay
Verified email at lsv.ens-cachan.fr - Homepage
Title
Cited by
Cited by
Year
Angluin-Style Learning of NFA.
B Bollig, P Habermehl, C Kern, M Leucker
IJCAI 9, 1004-1009, 2009
1542009
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
1222010
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
1202004
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
86*2017
Learning communicating automata from MSCs
B Bollig, JP Katoen, C Kern, M Leucker
IEEE Transactions on Software Engineering 36 (3), 390-408, 2010
71*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
61*2014
Message-passing automata are expressively equivalent to EMSO logic
B Bollig, M Leucker
Theoretical Computer Science 358 (2-3), 150-172, 2006
612006
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
612002
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
572001
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
492009
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
392010
Model checking languages of data words
B Bollig, A Cyriac, P Gastin, K Narayan Kumar
International Conference on Foundations of Software Science andá…, 2012
322012
An optimal construction of Hanf sentences
B Bollig, D Kuske
Journal of Applied Logic 10 (2), 179-186, 2012
302012
An automaton over data words that captures EMSO logic
B Bollig
International Conference on Concurrency Theory, 171-186, 2011
282011
Frequency linear-time temporal logic
B Bollig, N Decker, M Leucker
2012 Sixth International Symposium on Theoretical Aspects of Softwareá…, 2012
262012
An automata-theoretic approach to the verification of distributed algorithms
C Aiswarya, B Bollig, P Gastin
Information and Computation 259, 305-327, 2018
252018
Event clock message passing automata: a logical characterization and an emptiness checking algorithm
S Akshay, B Bollig, P Gastin
Formal Methods in System Design 42, 262-300, 2013
24*2013
Realizability of dynamic MSC languages
B Bollig, L HÚlouŰt
International Computer Science Symposium in Russia, 48-59, 2010
242010
The system can't perform the operation now. Try again later.
Articles 1–20