Benedikt Bollig
Benedikt Bollig
CNRS, LSV, ENS Paris-Saclay
Verified email at - Homepage
Cited by
Cited by
Controller synthesis for probabilistic systems
C Baier, M Gr÷▀er, M Leucker, B Bollig, F Ciesinski
Exploring New Frontiers of Theoretical Informatics, 493-506, 2004
Angluin-Style Learning of NFA.
B Bollig, P Habermehl, C Kern, M Leucker
IJCAI 9, 1004-1009, 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
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
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
Learning communicating automata from MSCs
B Bollig, JP Katoen, C Kern, M Leucker
IEEE Transactions on Software Engineering 36 (3), 390-408, 2010
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
Message-passing automata are expressively equivalent to EMSO logic
B Bollig, M Leucker
Theoretical Computer Science 358 (2-3), 150-172, 2006
Distributed timed automata with independently evolving clocks
S Akshay, B Bollig, P Gastin, M Mukund, KN Kumar
Fundamenta Informaticae 130 (4), 377-407, 2014
Weighted versus probabilistic logics
B Bollig, P Gastin
International Conference on Developments in Language Theory, 18-38, 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
Propositional Dynamic Logic for Message-Passing Systems
I Meinecke, D Kuske, B Bollig
Logical Methods in Computer Science 6, 2010
A robust class of data languages and an application to learning
B Bollig, P Habermehl, M Leucker, B Monmege
arXiv preprint arXiv:1411.6646, 2014
Model checking languages of data words
B Bollig, A Cyriac, P Gastin, KN Kumar
International Conference on Foundations of Software Science andá…, 2012
An automaton over data words that captures EMSO logic
B Bollig
International Conference on Concurrency Theory, 171-186, 2011
Realizability of dynamic MSC languages
B Bollig, L HÚlouŰt
International Computer Science Symposium in Russia, 48-59, 2010
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 (3), 262-300, 2013
Deciding LTL over Mazurkiewicz traces
B Bollig, M Leucker
Data & Knowledge Engineering 44 (2), 219-238, 2003
Temporal logics for concurrent recursive programs: Satisfiability and model checking
B Bollig, A Cyriac, P Gastin, M Zeitoun
Journal of Applied Logic 12 (4), 395-416, 2014
An optimal construction of Hanf sentences
B Bollig, D Kuske
Journal of Applied Logic 10 (2), 179-186, 2012
The system can't perform the operation now. Try again later.
Articles 1–20