Publications
2024
Faster and Smaller Solutions of Obliging Games
Hausmann, D., & Piterman, N. (2024). Faster and Smaller Solutions of Obliging Games. In Leibniz International Proceedings in Informatics, LIPIcs Vol. 311. doi:10.4230/LIPIcs.CONCUR.2024.28
Coalgebraic Satisfiability Checking for Arithmetic $\mu$-Calculi
Hausmann, D., & Schröder, L. (n.d.). Coalgebraic Satisfiability Checking for Arithmetic $\mu$-Calculi. Logical Methods in Computer Science, Volume 20, Issue 3. doi:10.46298/lmcs-20(3:9)2024
Fair ω-Regular Games
Hausmann, D., Piterman, N., Sağlam, I., & Schmuck, A. K. (2024). Fair ω-Regular Games. In Unknown Book (Vol. 14574 LNCS, 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., Schröder, L., & Strahlberger, A. (2024). Generic Model Checking for Modal Fixpoint Logics in COOL-MC. In Lecture Notes in Computer Science (pp. 171-185). Springer Nature Switzerland. 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 Lecture Notes in Computer Science (pp. 55-78). Springer Nature Switzerland. doi:10.1007/978-3-031-57228-9_4
2023
COOL 2 – A Generic Reasoner for Modal Fixpoint Logics (System Description)
Görlitz, O., Hausmann, D., Humml, M., Pattinson, D., Prucker, S., & Schröder, L. (2023). COOL 2 – A Generic Reasoner for Modal Fixpoint Logics (System Description). In Lecture Notes in Computer Science (pp. 234-247). Springer Nature Switzerland. 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 $$\mu $$-Calculus Through Tree Automata
Hausmann, D., & Piterman, N. (2022). A Survey on Satisfiability Checking for the $$\mu $$-Calculus Through Tree Automata. In Lecture Notes in Computer Science (pp. 228-251). Springer Nature Switzerland. doi:10.1007/978-3-031-22337-2_11
2021
Quasipolynomial Computation of Nested Fixpoints
Hausmann, D., & Schröder, L. (2021). Quasipolynomial Computation of Nested Fixpoints. In Lecture Notes in Computer Science (pp. 38-56). Springer International Publishing. 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 Lecture Notes in Computer Science (pp. 248-269). Springer International Publishing. doi:10.1007/978-3-030-39322-9_12
NP Reasoning in the Monotone $$\mu $$-Calculus
Hausmann, D., & Schröder, L. (2020). NP Reasoning in the Monotone $$\mu $$-Calculus. In Lecture Notes in Computer Science (pp. 482-499). Springer International Publishing. doi:10.1007/978-3-030-51074-9_28
2019
Optimal Satisfiability Checking for Arithmetic $$\mu $$-Calculi
Hausmann, D., & Schröder, L. (2019). Optimal Satisfiability Checking for Arithmetic $$\mu $$-Calculi. In Lecture Notes in Computer Science (pp. 277-294). Springer International Publishing. doi:10.1007/978-3-030-17127-8_16
2018
Permutation Games for the Weakly Aconjunctive $$\mu $$ μ -Calculus
Hausmann, D., Schröder, L., & Deifel, H. -P. (2018). Permutation Games for the Weakly Aconjunctive $$\mu $$ μ -Calculus. In Lecture Notes in Computer Science (pp. 361-378). Springer International Publishing. doi:10.1007/978-3-319-89963-3_21
2015
Global Caching for the Flat Coalgebraic µ-Calculus
Hausmann, D., & Schroder, L. (2015). Global Caching for the Flat Coalgebraic µ-Calculus. In 2015 22nd International Symposium on Temporal Representation and Reasoning (TIME) (pp. 121-130). IEEE. doi:10.1109/time.2015.15