Benedikt Bollig
Full-time Researcher, CNRS
Research interests
- Formal languages and automata theory
- Concurrency theory
Some publications
- Realizability of Dynamic MSC Languages (with L. Hélouët). CSR 2010, to appear. (submitted version, slides)
- Angluin-Style Learning of NFA (with C. Kern, P. Habermehl, and M. Leucker). IJCAI 2009.
- Realizability of Concurrent Recursive Programs (with M.-L. Grindei and P. Habermehl). FoSSaCS 2009.
- On the Expressive Power of 2-Stack Visibly Pushdown Automata. LMCS 4(4:16)2008.
- Distributed Timed Automata with Independently Evolving Clocks (with S. Akshay, P. Gastin, M. Mukund, and K. Narayan Kumar). CONCUR 2008.
Teaching
-
Weighted automata, (12h) MPRI, 2009/2010
Lecture notes (version: February 1, 2010) -
Modeling and verification of distributed and timed systems
(18h) MPRI, 2007/2008 -
Modeling and verification of distributed systems
(12h) MPRI, 2006/2007 - Research internships
- Teaching at RWTH Aachen (until 2005)
Other activities
- Organizing-committee member of
- PC member of YR-CONCUR 2009 (satellite workshop of CONCUR 2009), Bologna, Italy.
Tools
- libalf - The Automata Learning Framework (New)
- Smyle - Synthesizing Models by Learning from Examples
- MSCan - A Tool for Analyzing MSC Specifications
Book
