Research outputs
2026
Efficient Model Checking for the Alternating-Time -Calculus via Effectivity Frames
Hausmann, D., Humml, M., Prucker, S., & Schröder, L. (2026). Efficient Model Checking for the Alternating-Time -Calculus via Effectivity Frames. In Lecture Notes in Computer Science Vol. 15945 LNCS (pp. 106-124). doi:10.1007/978-3-032-06847-7_6
2025
Emerson-Lei and Manna-Pnueli Games for LTLf+ and PPLTL+ Synthesis
Alternating Nominal Automata with Name Allocation
Frank, F., Hausmann, D., Milius, S., Schroder, L., & Urbat, H. (2025). Alternating Nominal Automata with Name Allocation. In Proceedings Symposium on Logic in Computer Science (pp. 57-70). doi:10.1109/LICS65433.2025.00012
Distribution of Reconfiguration Languages Maintaining Tree-Like Communication Topology
Hausmann, D., Lehaut, M., & Piterman, N. (2025). Distribution of Reconfiguration Languages Maintaining Tree-Like Communication Topology. In Unknown Book (Vol. 15054, pp. 160-180). doi:10.1007/978-3-031-78709-6_8
Emerson-Lei and Manna-Pnueli Games for LTLf+ and PPLTL+ Synthesis
Hausmann, D., Zhu, S., Parretti, G., Weinhuber, C., De Giacomo, G., & Piterman, N. (2025). Emerson-Lei and Manna-Pnueli Games for LTLf+ and PPLTL+ Synthesis. In Proceedings of the International Conference on Knowledge Representation and Reasoning Vol. 2025-November (pp. 810-820). doi:10.24963/kr.2025/78
Faster Game Solving by Fixpoint Acceleration
Hausmann, D. (2025). Faster Game Solving by Fixpoint Acceleration. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, (435), 10 pages. doi:10.4204/EPTCS.435.6
Generalised Reachability Games Revisited
Bose, S., Hausmann, D., Paul, S., Schewe, S., & Zhanabekova, T. (2025). Generalised Reachability Games Revisited. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, (428), 76-90. doi:10.4204/EPTCS.428.7
2024
Faster and Smaller Solutions of Obliging Games
Hausmann, D., & Piterman, N. (2024). Faster and Smaller Solutions of Obliging Games. In 35TH INTERNATIONAL CONFERENCE ON CONCURRENCY THEORY, CONCUR 2024 Vol. 311 (pp. 19 pages). doi:10.4230/LIPIcs.CONCUR.2024.28
COALGEBRAIC SATISFIABILITY CHECKING FOR ARITHMETIC μ- CALCULI
Hausmann, D., & Schroeder, L. (2024). COALGEBRAIC SATISFIABILITY CHECKING FOR ARITHMETIC μ- CALCULI. LOGICAL METHODS IN COMPUTER SCIENCE, 20(3), 50 pages. doi:10.46298/LMCS-20(3:9)2024
Fair ω-Regular Games
Hausmann, D., Piterman, N., Saglam, I., & Schmuck, A. -K. (2024). Fair ω-Regular Games. In Unknown Book (Vol. 14574, pp. 13-33). doi:10.1007/978-3-031-57228-9_2
Generic Model Checking for Modal Fixpoint Logics in COOL-MC
Hausmann, D., Humml, M., Prucker, S., Schroeder, L., & Strahlberger, A. (2024). Generic Model Checking for Modal Fixpoint Logics in COOL-MC. In Unknown Book (Vol. 14499, pp. 171-185). doi:10.1007/978-3-031-50524-9_8
Symbolic Solution of Emerson -Lei Games for Reactive Synthesis
Hausmann, D., Lehaut, M., & Piterman, N. (2024). Symbolic Solution of Emerson -Lei Games for Reactive Synthesis. In Unknown Book (Vol. 14574, pp. 55-78). doi:10.1007/978-3-031-57228-9_4
2023
COOL 2-A Generic Reasoner for Modal Fixpoint Logics (System Description)
Goerlitz, O., Hausmann, D., Humml, M., Pattinson, D., Prucker, S., & Schroeder, L. (2023). COOL 2-A Generic Reasoner for Modal Fixpoint Logics (System Description). In Unknown Book (Vol. 14132, pp. 234-247). doi:10.1007/978-3-031-38499-8_14
Games for Efficient Supervisor Synthesis
Hausmann, D., Jha, P. K., & Piterman, N. (2023). Games for Efficient Supervisor Synthesis. IEEE CONTROL SYSTEMS LETTERS, 7, 2881-2885. doi:10.1109/LCSYS.2023.3290727
2022
A Survey on Satisfiability Checking for the μ-Calculus Through Tree Automata
Hausmann, D., & Piterman, N. (2022). A Survey on Satisfiability Checking for the μ-Calculus Through Tree Automata. In Principles of Systems Design (Vol. 13660, pp. 228-251). Springer Nature. doi:10.1007/978-3-031-22337-2_11
2021
Quasipolynomial Computation of Nested Fixpoints
Hausmann, D., & Schroeder, L. (2021). Quasipolynomial Computation of Nested Fixpoints. In Unknown Book (Vol. 12651, pp. 38-56). doi:10.1007/978-3-030-72016-2_3
2020
Cheap CTL Compassion in NuSMV
Hausmann, D., Litak, T., Rauch, C., & Zinner, M. (2020). Cheap CTL Compassion in NuSMV. In Unknown Book (Vol. 11990, pp. 248-269). doi:10.1007/978-3-030-39322-9_12
NP Reasoning in the Monotone μ-Calculus
Hausmann, D., & Schroder, L. (2020). NP Reasoning in the Monotone μ-Calculus. In Unknown Book (Vol. 12166, pp. 482-499). doi:10.1007/978-3-030-51074-9_28
2019
Optimal Satisfiability Checking for Arithmetic μ-Calculi
Hausmann, D., & Schroeder, L. (2019). Optimal Satisfiability Checking for Arithmetic μ-Calculi. In Unknown Book (Vol. 11425, pp. 277-294). doi:10.1007/978-3-030-17127-8_16
2018
Permutation Games for the Weakly Aconjunctive μ-Calculus
Hausmann, D., Schroeder, L., & Deifel, H. -P. (2018). Permutation Games for the Weakly Aconjunctive μ-Calculus. In Unknown Book (Vol. 10806, pp. 361-378). doi:10.1007/978-3-319-89963-3_21
2015
Global Caching for the Flat Coalgebraic μ-Calculus
Hausmann, D., & Schroeder, L. (2015). Global Caching for the Flat Coalgebraic μ-Calculus. In 2015 22ND INTERNATIONAL SYMPOSIUM ON TEMPORAL REPRESENTATION AND REASONING (TIME) (pp. 121-130). doi:10.1109/TIME.2015.15