Mechanical Verification of a Constructive Proof for FLP. - Benjamin Bisping; Paul-David Brodmann; Tim Jungnickel; Christina Rickmann; Henning Seidler; Anke Stüber; Arno Wilhelm-Weidner; Kirstin Peters; Uwe Nestmann (ITP, 2016)

A Constructive Proof for FLP. - Benjamin Bisping; Paul-David Brodmann; Tim Jungnickel; Christina Rickmann; Henning Seidler; Anke Stüber; Arno Wilhelm-Weidner; Kirstin Peters; Uwe Nestmann (Arch. Formal Proofs, 2016)

Computing Coupled Similarity. - Benjamin Bisping; Uwe Nestmann (TACAS (1), 2019)

Coupled similarity: the first 32 years. - Benjamin Bisping; Uwe Nestmann; Kirstin Peters (Acta Informatica, 2020)

A Game for Linear-time-Branching-time Spectroscopy. - Benjamin Bisping; Uwe Nestmann (TACAS (1), 2021)

A Game Characterization for Contrasimilarity. - Benjamin Bisping; Luisa Montanari (EXPRESS/SOS, 2021)

Deciding All Behavioral Equivalences at Once: A Game for Linear-time-Branching-time Spectroscopy. - Benjamin Bisping; Uwe Nestmann (CoRR, 2021)

Deciding All Behavioral Equivalences at Once: A Game for Linear-Time-Branching-Time Spectroscopy. - Benjamin Bisping; David N. Jansen; Uwe Nestmann (Log. Methods Comput. Sci., 2022)

Process Equivalence Problems as Energy Games. - Benjamin Bisping (CAV (1), 2023)

Coupled Similarity and Contrasimilarity, and How to Compute Them. - Benjamin Bisping; Luisa Montanari (Arch. Formal Proofs, 2023)

Linear-Time-Branching-Time Spectroscopy Accounting for Silent Steps. - Benjamin Bisping; David N. Jansen (CoRR, 2023)

One Energy Game for the Spectrum between Branching Bisimilarity and Weak Trace Semantics. - Benjamin Bisping; David N. Jansen (EXPRESS/SOS, 2024)

Characterizing contrasimilarity through games, modal logic, and complexity. - Benjamin Bisping; Luisa Montanari (Inf. Comput., 2024)

Galois Energy Games: To Solve All Kinds of Quantitative Reachability Problems. - Caroline Lemke; Benjamin Bisping (CONCUR, 2025)