| No. |
Title |
Author |
Year |
| 1 |
A Unifying Framework for Deciding Synchronizability |
Bollig, Benedikt et al. |
2021 |
| 2 |
Local First-Order Logic with Two Data Values |
Bollig, Benedikt et al. |
2021 |
| 3 |
Reachability in Distributed Memory Automata |
Bollig, Benedikt et al. |
2021 |
| 4 |
Bounded Reachability Problems Are Decidable in FIFO Machines |
Bollig, Benedikt et al. |
2020 |
| 5 |
Communicating Finite-State Machines and Two-Variable Logic |
Bollig, Benedikt et al. |
2018 |
| 6 |
It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before" |
Bollig, Benedikt et al. |
2018 |
| 7 |
The Complexity of Flat Freeze LTL |
Bollig, Benedikt et al. |
2017 |
| 8 |
One-Counter Automata with Counter Observability |
Bollig, Benedikt |
2016 |
| 9 |
An Automata-Theoretic Approach to the Verification of Distributed Algorithms |
Aiswarya, Cyriac et al. |
2015 |
| 10 |
Parameterized Communicating Automata: Complementation and Model Checking |
Bollig, Benedikt et al. |
2014 |
