Dr. Florian Bruse
Universität Kassel
Fachbereich Elektrotechnik und Informatik
FG Theoretische Informatik/Formale Methoden
Wilhelmshöher Allee 71-73
34121 Kassel

Phone: +49-561-804-6623
Room: WA73-1309
E-mail: florian.bruse@uni-kassel.de


Research Interests:
Temporal Logics & Automata, Descriptive Complexity, Fixpoint Theory


Publications:
dblp page

Volumes edited
30th International Symposium on Temporal Representation and Reasoning, TIME 2023 Athens, Greece, September 25-26, 2023. LIPIcs 278 (contents)
(co-edited with Alexander Artikis and Luke Hunsberger)

Journal Papers
Weights of formal languages based on geometric series with an application to automatic grading. Theoretical Computer Science 983, 2024 (pdf)
(joint work with Martin Lange and Maurice Herwig)

The tail-recursive fragment of timed recursive CTL. Information and Computation 294:105084, 2023 (pdf)
(joint work with Martin Lange)

Local higher-order fixpoint iteration. Information and Computation 289(Part):104963, 2022 (pdf)
(joint work with Jörg Kreiker, Martin Lange and Marco Sälzer)

Temporal Logic with Recursion. Information and Computation 281:104804, 2021 (pdf)
(joint work with Martin Lange)

The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic. Fundamenta Informaticae 178(1-2), pp 1-30, 2021 (pdf)
(joint work with Martin Lange and Étienne Lozes)

On Guarded Transformation in the Modal Mu-Calculus. Logic Journal of the IGPL 23(2) pp 194-216, 2015 (pdf)
(joint work with Oliver Friedmann and Martin Lange)

Papers at Refereed Conferences
The Calculus of Temporal Influence. TIME 2023, Athens, Greece (pdf, open access)
(joint work with Marit Kastaun, Martin Lange, and Sören Möller)

Formal Reasoning About Influence in Natural Science Experiments. CADE 2023, Rome, Italy (pdf, open access)
(joint work with Martin Lange and Sören Möller)

The Tail-Recursive Fragment of Timed Recursive CTL. TIME 2022, virtual (pdf, open access)
(joint work with Martin Lange and Étienne Lozes)

Capturing Bisimulation-Invariant Exponential-Time Complexity Classes. GandALF 2022, Madrid, Spain (pdf, open access)
(joint work with David Kronenberger and Martin Lange)

A Similarity Measure for Formal Languages Based on Convergent Geometric Series. CIAA 2022, Rouen, France (pdf)
(joint work with Maurice Herwig and Martin Lange)

A Decidable Non-Regular Modal Fixpoint Logic. CONCUR 2021, Paris, France/virtual (pdf, open access)
(joint work with Martin Lange)

Finite Convergence of μ-Calculus Fixpoints on Genuinely Infinite Structures. MFCS 2021, Tallinn, Estonia (pdf, open access)
(joint work with Martin Lange and Marco Sälzer)

Model Checking Timed Recursive CTL. TIME 2021, Klagenfurt, Austria (pdf, open access)
(joint work with Martin Lange

Local Higher-Order Fixpoint Iteration. GandALF 2020, Brussels, Belgium (pdf, open access)
(joint work with Jörg Kreiker, Martin Lange, and Marco Sälzer)

Temporal Logic with Recursion. TIME 2020, Bolzano, Italy (pdf, open access)
(joint work with Martin Lange)

Space-Efficient Fragments of Higher-Order Fixpoint Logic. RP 2017, London, UK (pdf)
(joint work with Martin Lange and Étienne Lozes)

On the Relationship Between Higher-Order Recursion Schemes and Higher-Order Fixpoint Logic. POPL 2017, Paris, France (pdf,(long version) at coauthor's page)
(joint work with Naoki Kobayasi and Étienne Lozes)

A Canonical Model Construction for Iteration-Free PDL with Intersection. GandALF 2016, Catania, Italy (pdf, open access)
(joint work with Daniel Kernberger and Martin Lange)

Alternation Is Strict For Higher-Order Modal Fixpoint Logic. GandALF 2016, Catania, Italy (pdf, open acess); NB: Result only holds up to order 1)

The Fixpoint-Iteration Algorithm for Parity Games. GandALF 2014, Verona, Italy (pdf, open access)
(joint work with Michael Falk and Martin Lange)

Alternating Parity Krivine Automata. MFCS 2014, Budapast, Hungary (pdf)

Workshop Papers
Separating the Expressive Power of Propositional Dynamic and Modal Fixpoint Logics. EXPRESS/SOS 2021, Paris, France/virtual (pdf, open access)
(joint work with Eric Alsmann and Martin Lange)

Collapses of Fixpoint Alternation Hierarchies in Low Type-Levels of Higher-Order Fixpoint Logic. PARIS 2018, London, UK
(joint work with Martin Lange and Étienne Lozes)

Unrefereed
Polynomial guarded transformation for the modal mu-calculus is still open. Highlights 2013, Paris, France (arXiv-Version; NB: refer to journal paper for an updated and improved version)
(joint work with Oliver Friedmann and Martin Lange)

Ph.D. Thesis
Extremal Fixpoints for Higher-Order Modal Logic Kassel, Germany 2018 (pdf, open access)