Parallel Model Checking for the Alternation Free µ-Calculus. - Benedikt Bollig; Martin Leucker; Michael Weber 002 (TACAS, 2001)

Modelling, Specifying, and Verifying Message Passing Systems. - Benedikt Bollig; Martin Leucker (TIME, 2001)

Generalised Regular MSC Languages. - Benedikt Bollig; Martin Leucker; Thomas Noll 001 (FoSSaCS, 2002)

Extending Compositional Message Sequence Graphs. - Benedikt Bollig; Martin Leucker; Philipp Lucas 001 (LPAR, 2002)

Local Parallel Model Checking for the Alternation-Free µ-Calculus. - Benedikt Bollig; Martin Leucker; Michael Weber 002 (SPIN, 2002)

Model Checking Probabilistic Distributed Systems. - Benedikt Bollig; Martin Leucker (ASIAN, 2003)

Deciding LTL over Mazurkiewicz traces. - Benedikt Bollig; Martin Leucker (Data Knowl. Eng., 2003)

Controller Synthesis for Probabilistic Systems. - Christel Baier; Marcus Größer; Martin Leucker; Benedikt Bollig; Frank Ciesinski (IFIP TCS, 2004)

Verifying Qualitative Properties of Probabilistic Programs. - Benedikt Bollig; Martin Leucker (Validation of Stochastic Systems, 2004)

On the Expressiveness of Asynchronous Cellular Automata. - Benedikt Bollig (FCT, 2005)

A Hierarchy of Implementable MSC Languages. - Benedikt Bollig; Martin Leucker (FORTE, 2005)

Automata and logics for message sequence charts. - Benedikt Bollig (2005)

Formal Models of Communicating Systems - Languages, Automata, and Monadic Second-Order Logic - Benedikt Bollig (Springer, 2006)

MSCan - A Tool for Analyzing MSC Specifications. - Benedikt Bollig; Carsten Kern; Markus Schlütter; Volker Stolz (TACAS, 2006)

Message-passing automata are expressively equivalent to EMSO logic. - Benedikt Bollig; Martin Leucker (Theor. Comput. Sci., 2006)

Automata and Logics for Timed Message Sequence Charts. - S. Akshay 001; Benedikt Bollig; Paul Gastin (FSTTCS, 2007)

Weighted Distributed Systems and Their Logics. - Benedikt Bollig; Ingmar Meinecke (LFCS, 2007)

Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning. - Benedikt Bollig; Joost-Pieter Katoen; Carsten Kern; Martin Leucker (TACAS, 2007)

Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning. - Benedikt Bollig; Joost-Pieter Katoen; Carsten Kern; Martin Leucker (CONCUR, 2008)

Emptiness of Multi-pushdown Automata Is 2ETIME-Complete. - Mohamed Faouzi Atig; Benedikt Bollig; Peter Habermehl (Developments in Language Theory, 2008)

Muller message-passing automata and logics. - Benedikt Bollig; Dietrich Kuske (Inf. Comput., 2008)

On the Expressive Power of 2-Stack Visibly Pushdown Automata. - Benedikt Bollig (Log. Methods Comput. Sci., 2008)

Weighted versus Probabilistic Logics. - Benedikt Bollig; Paul Gastin (Developments in Language Theory, 2009)

Angluin-Style Learning of NFA. - Benedikt Bollig; Peter Habermehl; Carsten Kern; Martin Leucker (IJCAI, 2009)

libalf: The Automata Learning Framework. - Benedikt Bollig; Joost-Pieter Katoen; Carsten Kern; Martin Leucker; Daniel Neider; David R. Piegdon (CAV, 2010)

Realizability of Dynamic MSC Languages. - Benedikt Bollig; Loïc Hélouët (CSR, 2010)

Pebble Weighted Automata and Transitive Closure Logics. - Benedikt Bollig; Paul Gastin; Benjamin Monmege; Marc Zeitoun (ICALP (2), 2010)

SMA - The Smyle Modeling Approach. - Benedikt Bollig; Joost-Pieter Katoen; Carsten Kern; Martin Leucker (Comput. Informatics, 2010)

Propositional Dynamic Logic for Message-Passing Systems - Benedikt Bollig; Dietrich Kuske; Ingmar Meinecke (Log. Methods Comput. Sci., 2010)

Learning Communicating Automata from MSCs. - Benedikt Bollig; Joost-Pieter Katoen; Carsten Kern; Martin Leucker (IEEE Trans. Software Eng., 2010)

An Automaton over Data Words That Captures EMSO Logic. - Benedikt Bollig (CONCUR, 2011)

A Probabilistic Kleene Theorem. - Benedikt Bollig; Paul Gastin; Benjamin Monmege; Marc Zeitoun (ATVA, 2012)

Model Checking Languages of Data Words. - Benedikt Bollig; Aiswarya Cyriac; Paul Gastin; K. Narayan Kumar (FoSSaCS, 2012)

Frequency Linear-time Temporal Logic. - Benedikt Bollig; Normann Decker; Martin Leucker (TASE, 2012)

An optimal construction of Hanf sentences. - Benedikt Bollig; Dietrich Kuske (J. Appl. Log., 2012)

A Fresh Approach to Learning Register Automata. - Benedikt Bollig; Peter Habermehl; Martin Leucker; Benjamin Monmege (Developments in Language Theory, 2013)

Weighted Specifications over Nested Words. - Benedikt Bollig; Paul Gastin; Benjamin Monmege (FoSSaCS, 2013)

Dynamic Communicating Automata and Branching High-Level MSCs. - Benedikt Bollig; Aiswarya Cyriac; Loïc Hélouët; Ahmet Kara 002; Thomas Schwentick (LATA, 2013)

Event clock message passing automata: a logical characterization and an emptiness checking algorithm. - S. Akshay 001; Benedikt Bollig; Paul Gastin (Formal Methods Syst. Des., 2013)

Logic for communicating automata with parameterized topology. - Benedikt Bollig (CSL-LICS, 2014)

Logical characterization of weighted pebble walking automata. - Benedikt Bollig; Paul Gastin; Benjamin Monmege; Marc Zeitoun (CSL-LICS, 2014)

Parameterized Communicating Automata: Complementation and Model Checking. - Benedikt Bollig; Paul Gastin; Akshay Kumar (FSTTCS, 2014)

Parameterized Verification of Communicating Automata under Context Bounds. - Benedikt Bollig; Paul Gastin; Jana Schubert (RP, 2014)

A Robust Class of Data Languages and an Application to Learning. - Benedikt Bollig; Peter Habermehl; Martin Leucker; Benjamin Monmege (Log. Methods Comput. Sci., 2014)

Distributed Timed Automata with Independently Evolving Clocks. - S. Akshay 001; Benedikt Bollig; Paul Gastin; Madhavan Mukund; K. Narayan Kumar (Fundam. Informaticae, 2014)

Temporal logics for concurrent recursive programs: Satisfiability and model checking. - Benedikt Bollig; C. Aiswarya; Paul Gastin; Marc Zeitoun (J. Appl. Log., 2014)

Pebble Weighted Automata and Weighted Logics. - Benedikt Bollig; Paul Gastin; Benjamin Monmege; Marc Zeitoun (ACM Trans. Comput. Log., 2014)

Automata and Logics for Concurrent Systems: Realizability and Verification. - Benedikt Bollig (2015)

Towards Formal Verification of Distributed Algorithms. - Benedikt Bollig (TIME, 2015)

Automata and Logics for Concurrent Systems: Five Models in Five Pages. - Benedikt Bollig (CIAA, 2015)

One-Counter Automata with Counter Observability. - Benedikt Bollig (FSTTCS, 2016)

One-Counter Automata with Counter Visibility. - Benedikt Bollig (CoRR, 2016)

On Parameterized One-Counter Automata. - Benedikt Bollig; Karin Quaas; Arnaud Sangnier (CoRR, 2016)

Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete. - Mohamed Faouzi Atig; Benedikt Bollig; Peter Habermehl (Int. J. Found. Comput. Sci., 2017)

The Complexity of Model Checking Multi-Stack Systems. - Benedikt Bollig; Dietrich Kuske; Roy Mennicke (Theory Comput. Syst., 2017)

Round-Bounded Control of Parameterized Systems. - Benedikt Bollig; Mathieu Lehaut; Nathalie Sznajder (ATVA, 2018)

It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before". - Benedikt Bollig; Marie Fortin; Paul Gastin (CONCUR, 2018)

Communicating Finite-State Machines and Two-Variable Logic. - Benedikt Bollig; Marie Fortin; Paul Gastin (STACS, 2018)

Gossiping in Message-Passing Systems. - Benedikt Bollig; Marie Fortin; Paul Gastin (CoRR, 2018)

Realizability of concurrent recursive programs. - Benedikt Bollig; Manuela-Lidia Grindei; Peter Habermehl (Formal Methods Syst. Des., 2018)

An automata-theoretic approach to the verification of distributed algorithms. - C. Aiswarya; Benedikt Bollig; Paul Gastin (Inf. Comput., 2018)

Identifiers in Registers - Describing Network Algorithms with Logic. - Benedikt Bollig; Patricia Bouyer; Fabian Reiter (FoSSaCS, 2019)

Non-Sequential Theory of Distributed Systems. - Benedikt Bollig; Paul Gastin (CoRR, 2019)

The Complexity of Flat Freeze LTL. - Benedikt Bollig; Karin Quaas; Arnaud Sangnier (Log. Methods Comput. Sci., 2019)

Parameterized Synthesis for Fragments of First-Order Logic Over Data Words. - Béatrice Bérard; Benedikt Bollig; Mathieu Lehaut; Nathalie Sznajder (FoSSaCS, 2020)

Synthesis in Presence of Dynamic Links. - Béatrice Bérard; Benedikt Bollig; Patricia Bouyer; Matthias Függer; Nathalie Sznajder (GandALF, 2020)

Property-Directed Verification of Recurrent Neural Networks. - Igor Khmelnitsky; Daniel Neider; Rajarshi Roy 002; Benoît Barbot; Benedikt Bollig; Alain Finkel; Serge Haddad; Martin Leucker; Lina Ye (CoRR, 2020)

Erratum to "Frequency Linear-time Temporal Logic". - Benedikt Bollig; Normann Decker; Martin Leucker (CoRR, 2020)

Property-Directed Verification and Robustness Certification of Recurrent Neural Networks. - Igor Khmelnitsky; Daniel Neider; Rajarshi Roy 002; Xuan Xie; Benoît Barbot; Benedikt Bollig; Alain Finkel; Serge Haddad; Martin Leucker; Lina Ye (ATVA, 2021)

A Unifying Framework for Deciding Synchronizability. - Benedikt Bollig; Cinzia Di Giusto; Alain Finkel; Laetitia Laversa; Étienne Lozes; Amrita Suresh 001 (CONCUR, 2021)

Reachability in Distributed Memory Automata. - Benedikt Bollig; Fedor Ryabinin; Arnaud Sangnier (CSL, 2021)

Local First-Order Logic with Two Data Values. - Benedikt Bollig; Arnaud Sangnier; Olivier Stietel (FSTTCS, 2021)

Extracting Context-Free Grammars from Recurrent Neural Networks using Tree-Automata Learning and A* Search. - Benoît Barbot; Benedikt Bollig; Alain Finkel; Serge Haddad; Igor Khmelnitsky; Martin Leucker; Daniel Neider; Rajarshi Roy 002; Lina Ye (ICGI, 2021)

Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic. - Benedikt Bollig; Marie Fortin; Paul Gastin (J. Comput. Syst. Sci., 2021)

A Survey of Model Learning Techniques for Recurrent Neural Networks. - Benedikt Bollig; Martin Leucker; Daniel Neider (A Journey from Process Algebra via Timed Automata to Model Learning, 2022)

On the Existential Fragments of Local First-Order Logics with Data. - Benedikt Bollig; Arnaud Sangnier; Olivier Stietel (GandALF, 2022)

Analyzing Robustness of Angluin's L* Algorithm in Presence of Noise. - Igor Khmelnitsky; Serge Haddad; Lina Ye; Benoît Barbot; Benedikt Bollig; Martin Leucker; Daniel Neider; Rajarshi Roy 002 (GandALF, 2022)

Bounded Reachability Problems are Decidable in FIFO Machines. - Benedikt Bollig; Alain Finkel; Amrita Suresh 001 (Log. Methods Comput. Sci., 2022)

Analyzing Robustness of Angluin's L* Algorithm in Presence of Noise. - Lina Ye; Igor Khmelnitsky; Serge Haddad; Benoît Barbot; Benedikt Bollig; Martin Leucker; Daniel Neider; Rajarshi Roy 002 (CoRR, 2023)

Analysis of recurrent neural networks via property-directed verification of surrogate models. - Igor Khmelnitsky; Daniel Neider; Rajarshi Roy 002; Xuan Xie; Benoît Barbot; Benedikt Bollig; Alain Finkel; Serge Haddad; Martin Leucker; Lina Ye (Int. J. Softw. Tools Technol. Transf., 2023)

Permutation Equivariant Deep Reinforcement Learning for Multi-Armed Bandit. - Zhuofan Xu 001; Benedikt Bollig; Matthias Függer; Thomas Nowak (ICTAI, 2024)

A Framework for Streaming Event-Log Prediction in Business Processes. - Benedikt Bollig; Matthias Függer; Thomas Nowak (CoRR, 2024)

Branch-Well-Structured Transition Systems and Extensions. - Benedikt Bollig; Alain Finkel; Amrita Suresh 001 (Log. Methods Comput. Sci., 2024)

On the Satisfiability of Local First-Order Logics with Data. - Benedikt Bollig; Arnaud Sangnier; Olivier Stietel (Log. Methods Comput. Sci., 2024)

Round- and context-bounded control of dynamic pushdown systems. - Benedikt Bollig; Mathieu Lehaut; Nathalie Sznajder (Formal Methods Syst. Des., 2024)

High-Level Message Sequence Charts: Satisfiability and Realizability Revisited. - Benedikt Bollig; Marie Fortin; Paul Gastin (Petri Nets, 2025)

Centralized Permutation Equivariant Policy for Cooperative Multi-Agent Reinforcement Learning. - Zhuofan Xu 001; Benedikt Bollig; Matthias Függer; Thomas Nowak; Vincent Le Dréau (CoRR, 2025)