Benedikt Bollig
Benedikt Bollig
CNRS, LMF, ENS Paris-Saclay, Université Paris-Saclay
Verified email at - Homepage
Cited by
Cited by
Angluin-Style Learning of NFA.
B Bollig, P Habermehl, C Kern, M Leucker
IJCAI 9, 1004-1009, 2009
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
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
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
Learning communicating automata from MSCs
B Bollig, JP Katoen, C Kern, M Leucker
IEEE Transactions on Software Engineering 36 (3), 390-408, 2010
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
Message-passing automata are expressively equivalent to EMSO logic
B Bollig, M Leucker
Theoretical Computer Science 358 (2-3), 150-172, 2006
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
A robust class of data languages and an application to learning
B Monmege, M Leucker, P Habermehl, B Bollig
Logical Methods in Computer Science 10, 2014
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
Developments in Language Theory: 13th International Conference, DLT 2009 …, 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
Model Checking Languages of Data Words.
B Bollig, A Cyriac, P Gastin, KN Kumar
FoSSaCS 12, 391-405, 2012
An Automaton over Data Words That Captures EMSO Logic.
B Bollig
Concur 11, 171-186, 2011
An optimal construction of Hanf sentences
B Bollig, D Kuske
Journal of Applied Logic 10 (2), 179-186, 2012
Frequency linear-time temporal logic
B Bollig, N Decker, M Leucker
2012 Sixth International Symposium on Theoretical Aspects of Software …, 2012
Realizability of dynamic MSC languages
B Bollig, L Hélouët
Computer Science–Theory and Applications: 5th International Computer Science …, 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, 262-300, 2013
Deciding LTL over Mazurkiewicz traces
B Bollig, M Leucker
Data & Knowledge Engineering 44 (2), 219-238, 2003
The system can't perform the operation now. Try again later.
Articles 1–20