Benedikt Bollig

114 papers A* 3A 4B 24C 11Misc 3Journal 47Unranked 19

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Centralized Permutation Equivariant Policy for Cooperative Multi-Agent Reinforcement Learning. CoRR Zhuofan Xu, Benedikt Bollig, Matthias Függer, Thomas Nowak, Vincent Le Dréau
2025	B	`conf`	High-Level Message Sequence Charts: Satisfiability and Realizability Revisited. Petri Nets Benedikt Bollig, Marie Fortin, Paul Gastin
2025	J	`jnl`	High-Level Message Sequence Charts: Satisfiability and Realizability Revisited. CoRR Benedikt Bollig, Marie Fortin, Paul Gastin
2024	J	`jnl`	A Framework for Streaming Event-Log Prediction in Business Processes. CoRR Benedikt Bollig, Matthias Függer, Thomas Nowak
2024	J	`jnl`	Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise. Log. Methods Comput. Sci. Lina Ye, Igor Khmelnitsky, Serge Haddad, Benoît Barbot, Benedikt Bollig, Martin Leucker, Daniel Neider, Rajarshi Roy
2024	J	`jnl`	Branch-Well-Structured Transition Systems and Extensions. Log. Methods Comput. Sci. Benedikt Bollig, Alain Finkel, Amrita Suresh
2024	J	`jnl`	On the Satisfiability of Local First-Order Logics with Data. Log. Methods Comput. Sci. Benedikt Bollig, Arnaud Sangnier, Olivier Stietel
2024	B	`conf`	Permutation Equivariant Deep Reinforcement Learning for Multi-Armed Bandit. ICTAI Zhuofan Xu, Benedikt Bollig, Matthias Függer, Thomas Nowak
2024	J	`jnl`	Round- and context-bounded control of dynamic pushdown systems. Formal Methods Syst. Des. Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder
2023	J	`jnl`	Analysis of recurrent neural networks via property-directed verification of surrogate models. Int. J. Softw. Tools Technol. Transf. Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Xuan Xie, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye
2023	J	`jnl`	Analyzing Robustness of Angluin's L CoRR Lina Ye, Igor Khmelnitsky, Serge Haddad, Benoît Barbot, Benedikt Bollig, Martin Leucker, Daniel Neider, Rajarshi Roy
2023	J	`jnl`	On the Satisfiability of Local First-Order Logics with Data. CoRR Benedikt Bollig, Arnaud Sangnier, Olivier Stietel
2022	—	`conf`	A Survey of Model Learning Techniques for Recurrent Neural Networks. A Journey from Process Algebra via Timed Automata to Model Learning Benedikt Bollig, Martin Leucker, Daniel Neider
2022	—	`conf`	Analyzing Robustness of Angluin's L* Algorithm in Presence of Noise. GandALF Igor Khmelnitsky, Serge Haddad, Lina Ye, Benoît Barbot, Benedikt Bollig, Martin Leucker, Daniel Neider, Rajarshi Roy
2022	J	`jnl`	Bounded Reachability Problems are Decidable in FIFO Machines. Log. Methods Comput. Sci. Benedikt Bollig, Alain Finkel, Amrita Suresh
2022	C	`conf`	Branch-Well-Structured Transition Systems and Extensions. FORTE Benedikt Bollig, Alain Finkel, Amrita Suresh
2022	J	`jnl`	Branch-Well-Structured Transition Systems and Extensions. CoRR Benedikt Bollig, Alain Finkel, Amrita Suresh
2022	—	`conf`	On the Existential Fragments of Local First-Order Logics with Data. GandALF Benedikt Bollig, Arnaud Sangnier, Olivier Stietel
2022	J	`jnl`	Synthesis in presence of dynamic links. Inf. Comput. Béatrice Bérard, Benedikt Bollig, Patricia Bouyer, Matthias Függer, Nathalie Sznajder
2021	B	`conf`	A Unifying Framework for Deciding Synchronizability. CONCUR Benedikt Bollig, Cinzia Di Giusto, Alain Finkel, Laetitia Laversa, Étienne Lozes, Amrita Suresh
2021	J	`jnl`	Bounded Reachability Problems are Decidable in FIFO Machines. CoRR Benedikt Bollig, Alain Finkel, Amrita Suresh
2021	J	`jnl`	Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic. J. Comput. Syst. Sci. Benedikt Bollig, Marie Fortin, Paul Gastin
2021	—	`conf`	Extracting Context-Free Grammars from Recurrent Neural Networks using Tree-Automata Learning and A* Search. ICGI Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Igor Khmelnitsky, Martin Leucker, Daniel Neider, Rajarshi Roy, Lina Ye
2021	—	`conf`	Local First-Order Logic with Two Data Values. FSTTCS Benedikt Bollig, Arnaud Sangnier, Olivier Stietel
2021	B	`conf`	Property-Directed Verification and Robustness Certification of Recurrent Neural Networks. ATVA Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Xuan Xie, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye
2021	B	`conf`	Reachability in Distributed Memory Automata. CSL Benedikt Bollig, Fedor Ryabinin, Arnaud Sangnier
2020	B	`conf`	Bounded Reachability Problems Are Decidable in FIFO Machines. CONCUR Benedikt Bollig, Alain Finkel, Amrita Suresh
2020	J	`jnl`	Erratum to "Frequency Linear-time Temporal Logic". CoRR Benedikt Bollig, Normann Decker, Martin Leucker
2020	B	`conf`	Parameterized Synthesis for Fragments of First-Order Logic Over Data Words. FoSSaCS Béatrice Bérard, Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder
2020	J	`jnl`	Property-Directed Verification of Recurrent Neural Networks. CoRR Igor Khmelnitsky, Daniel Neider, Rajarshi Roy, Benoît Barbot, Benedikt Bollig, Alain Finkel, Serge Haddad, Martin Leucker, Lina Ye
2020	—	`conf`	Synthesis in Presence of Dynamic Links. GandALF Béatrice Bérard, Benedikt Bollig, Patricia Bouyer, Matthias Függer, Nathalie Sznajder
2019	B	`conf`	Identifiers in Registers - Describing Network Algorithms with Logic. FoSSaCS Benedikt Bollig, Patricia Bouyer, Fabian Reiter
2019	J	`jnl`	Non-Sequential Theory of Distributed Systems. CoRR Benedikt Bollig, Paul Gastin
2019	J	`jnl`	Parameterized Synthesis for Fragments of First-Order Logic over Data Words. CoRR Béatrice Bérard, Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder
2019	J	`jnl`	The Complexity of Flat Freeze LTL. Log. Methods Comput. Sci. Benedikt Bollig, Karin Quaas, Arnaud Sangnier
2018	J	`jnl`	An automata-theoretic approach to the verification of distributed algorithms. Inf. Comput. C. Aiswarya, Benedikt Bollig, Paul Gastin
2018	A	`conf`	Communicating Finite-State Machines and Two-Variable Logic. STACS Benedikt Bollig, Marie Fortin, Paul Gastin
2018	J	`jnl`	Gossiping in Message-Passing Systems. CoRR Benedikt Bollig, Marie Fortin, Paul Gastin
2018	J	`jnl`	Identifiers in Registers - Describing Network Algorithms with Logic. CoRR Benedikt Bollig, Patricia Bouyer, Fabian Reiter
2018	B	`conf`	It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before". CONCUR Benedikt Bollig, Marie Fortin, Paul Gastin
2018	J	`jnl`	It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before". CoRR Benedikt Bollig, Marie Fortin, Paul Gastin
2018	J	`jnl`	Realizability of concurrent recursive programs. Formal Methods Syst. Des. Benedikt Bollig, Manuela-Lidia Grindei, Peter Habermehl
2018	B	`conf`	Round-Bounded Control of Parameterized Systems. ATVA Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder
2017	J	`jnl`	Communicating Finite-State Machines and Two-Variable Logic. CoRR Benedikt Bollig, Marie Fortin, Paul Gastin
2017	J	`jnl`	Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete. Int. J. Found. Comput. Sci. Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl
2017	B	`conf`	The Complexity of Flat Freeze LTL. CONCUR Benedikt Bollig, Karin Quaas, Arnaud Sangnier
2017	J	`jnl`	The Complexity of Model Checking Multi-Stack Systems. Theory Comput. Syst. Benedikt Bollig, Dietrich Kuske, Roy Mennicke
2016	J	`jnl`	On Parameterized One-Counter Automata. CoRR Benedikt Bollig, Karin Quaas, Arnaud Sangnier
2016	—	`conf`	One-Counter Automata with Counter Observability. FSTTCS Benedikt Bollig
2016	J	`jnl`	One-Counter Automata with Counter Visibility. CoRR Benedikt Bollig
2015	B	`conf`	An Automata-Theoretic Approach to the Verification of Distributed Algorithms. CONCUR C. Aiswarya, Benedikt Bollig, Paul Gastin
2015	J	`jnl`	An Automata-Theoretic Approach to the Verification of Distributed Algorithms. CoRR C. Aiswarya, Benedikt Bollig, Paul Gastin
2015	C	`conf`	Automata and Logics for Concurrent Systems: Five Models in Five Pages. CIAA Benedikt Bollig
2015	—	`book`	Automata and Logics for Concurrent Systems: Realizability and Verification. Benedikt Bollig
2015	C	`conf`	Towards Formal Verification of Distributed Algorithms. TIME Benedikt Bollig
2014	J	`jnl`	A Robust Class of Data Languages and an Application to Learning. Log. Methods Comput. Sci. Benedikt Bollig, Peter Habermehl, Martin Leucker, Benjamin Monmege
2014	J	`jnl`	Distributed Timed Automata with Independently Evolving Clocks. Fundam. Informaticae S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar
2014	—	`conf`	Logic for communicating automata with parameterized topology. CSL-LICS Benedikt Bollig
2014	—	`conf`	Logical characterization of weighted pebble walking automata. CSL-LICS Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
2014	—	`conf`	Parameterized Communicating Automata: Complementation and Model Checking. FSTTCS Benedikt Bollig, Paul Gastin, Akshay Kumar
2014	—	`conf`	Parameterized Verification of Communicating Automata under Context Bounds. RP Benedikt Bollig, Paul Gastin, Jana Schubert
2014	J	`jnl`	Pebble Weighted Automata and Weighted Logics. ACM Trans. Comput. Log. Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
2014	J	`jnl`	Temporal logics for concurrent recursive programs: Satisfiability and model checking. J. Appl. Log. Benedikt Bollig, C. Aiswarya, Paul Gastin, Marc Zeitoun
2013	C	`conf`	A Fresh Approach to Learning Register Automata. Developments in Language Theory Benedikt Bollig, Peter Habermehl, Martin Leucker, Benjamin Monmege
2013	C	`conf`	Dynamic Communicating Automata and Branching High-Level MSCs. LATA Benedikt Bollig, Aiswarya Cyriac, Loïc Hélouët, Ahmet Kara, Thomas Schwentick
2013	J	`jnl`	Event clock message passing automata: a logical characterization and an emptiness checking algorithm. Formal Methods Syst. Des. S. Akshay, Benedikt Bollig, Paul Gastin
2013	A*	`conf`	The Complexity of Model Checking Multi-stack Systems. LICS Benedikt Bollig, Dietrich Kuske, Roy Mennicke
2013	B	`conf`	Weighted Specifications over Nested Words. FoSSaCS Benedikt Bollig, Paul Gastin, Benjamin Monmege
2012	B	`conf`	A Probabilistic Kleene Theorem. ATVA Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
2012	J	`jnl`	An optimal construction of Hanf sentences. J. Appl. Log. Benedikt Bollig, Dietrich Kuske
2012	Misc	`conf`	Frequency Linear-time Temporal Logic. TASE Benedikt Bollig, Normann Decker, Martin Leucker
2012	B	`conf`	Model Checking Languages of Data Words. FoSSaCS Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar
2011	B	`conf`	An Automaton over Data Words That Captures EMSO Logic. CONCUR Benedikt Bollig
2011	J	`jnl`	An automaton over data words that captures EMSO logic CoRR Benedikt Bollig
2011	J	`jnl`	An optimal construction of Hanf sentences CoRR Benedikt Bollig, Dietrich Kuske
2011	B	`conf`	Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking. MFCS Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, Marc Zeitoun
2010	J	`jnl`	Learning Communicating Automata from MSCs. IEEE Trans. Software Eng. Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker
2010	—	`conf`	Pebble Weighted Automata and Transitive Closure Logics. ICALP (2) Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun
2010	J	`jnl`	Propositional Dynamic Logic for Message-Passing Systems Log. Methods Comput. Sci. Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke
2010	Misc	`conf`	Realizability of Dynamic MSC Languages. CSR Benedikt Bollig, Loïc Hélouët
2010	J	`jnl`	SMA - The Smyle Modeling Approach. Comput. Informatics Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker
2010	A*	`conf`	libalf: The Automata Learning Framework. CAV Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker, Daniel Neider, David R. Piegdon
2009	A*	`conf`	Angluin-Style Learning of NFA. IJCAI Benedikt Bollig, Peter Habermehl, Carsten Kern, Martin Leucker
2009	B	`conf`	Realizability of Concurrent Recursive Programs. FoSSaCS Benedikt Bollig, Manuela-Lidia Grindei, Peter Habermehl
2009	C	`conf`	Weighted versus Probabilistic Logics. Developments in Language Theory Benedikt Bollig, Paul Gastin
2008	B	`conf`	Distributed Timed Automata with Independently Evolving Clocks. CONCUR S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan Mukund, K. Narayan Kumar
2008	C	`conf`	Emptiness of Multi-pushdown Automata Is 2ETIME-Complete. Developments in Language Theory Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl
2008	J	`jnl`	Muller message-passing automata and logics. Inf. Comput. Benedikt Bollig, Dietrich Kuske
2008	J	`jnl`	On the Expressive Power of 2-Stack Visibly Pushdown Automata CoRR Benedikt Bollig
2008	J	`jnl`	On the Expressive Power of 2-Stack Visibly Pushdown Automata. Log. Methods Comput. Sci. Benedikt Bollig
2008	—	`conf`	SMA - The Smyle Modeling Approach. CEE-SET Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker
2008	B	`conf`	Smyle: A Tool for Synthesizing Distributed Models from Scenarios by Learning. CONCUR Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker
2007	—	`conf`	Automata and Logics for Timed Message Sequence Charts. FSTTCS S. Akshay, Benedikt Bollig, Paul Gastin
2007	C	`conf`	Muller Message-Passing Automata and Logics. LATA Benedikt Bollig, Dietrich Kuske
2007	—	`conf`	Propositional Dynamic Logic for Message-Passing Systems. FSTTCS Benedikt Bollig, Dietrich Kuske, Ingmar Meinecke
2007	A	`conf`	Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning. TACAS Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern, Martin Leucker
2007	Misc	`conf`	Weighted Distributed Systems and Their Logics. LFCS Benedikt Bollig, Ingmar Meinecke
2006	—	`book`	Formal Models of Communicating Systems - Languages, Automata, and Monadic Second-Order Logic Benedikt Bollig
2006	A	`conf`	MSCan - A Tool for Analyzing MSC Specifications. TACAS Benedikt Bollig, Carsten Kern, Markus Schlütter, Volker Stolz
2006	J	`jnl`	Message-passing automata are expressively equivalent to EMSO logic. Theor. Comput. Sci. Benedikt Bollig, Martin Leucker
2005	C	`conf`	A Hierarchy of Implementable MSC Languages. FORTE Benedikt Bollig, Martin Leucker
2005	—	`—`	Automata and logics for message sequence charts. Benedikt Bollig
2005	B	`conf`	On the Expressiveness of Asynchronous Cellular Automata. FCT Benedikt Bollig
2004	—	`conf`	Controller Synthesis for Probabilistic Systems. IFIP TCS Christel Baier, Marcus Größer, Martin Leucker, Benedikt Bollig, Frank Ciesinski
2004	B	`conf`	Message-Passing Automata Are Expressively Equivalent to EMSO Logic. CONCUR Benedikt Bollig, Martin Leucker
2004	—	`conf`	Verifying Qualitative Properties of Probabilistic Programs. Validation of Stochastic Systems Benedikt Bollig, Martin Leucker
2003	J	`jnl`	Deciding LTL over Mazurkiewicz traces. Data Knowl. Eng. Benedikt Bollig, Martin Leucker
2003	—	`conf`	Model Checking Probabilistic Distributed Systems. ASIAN Benedikt Bollig, Martin Leucker
2002	B	`conf`	Extending Compositional Message Sequence Graphs. LPAR Benedikt Bollig, Martin Leucker, Philipp Lucas
2002	B	`conf`	Generalised Regular MSC Languages. FoSSaCS Benedikt Bollig, Martin Leucker, Thomas Noll
2002	—	`conf`	Local Parallel Model Checking for the Alternation-Free µ-Calculus. SPIN Benedikt Bollig, Martin Leucker, Michael Weber
2001	C	`conf`	Deciding LTL over Mazurkiewicz Traces. TIME Benedikt Bollig, Martin Leucker
2001	C	`conf`	Modelling, Specifying, and Verifying Message Passing Systems. TIME Benedikt Bollig, Martin Leucker
2001	A	`conf`	Parallel Model Checking for the Alternation Free µ-Calculus. TACAS Benedikt Bollig, Martin Leucker, Michael Weber