Permutation games for the weakly aconjunctive μ -calculus

Hausmann D, Schröder L, Deifel HP (2018)

Publication Status: Published

Publication Type: Conference contribution, Original article

Publication year: 2018

Publisher: Springer

Pages Range: 361-378

Conference Proceedings Title: 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2018

ISBN: 9783319899626

DOI: 10.1007/978-3-319-89963-3_21

Open Access Link: https://doi.org/10.1007/978-3-319-89963-3_21

Authors with CRIS profile

Daniel Hausmann Lehrstuhl für Informatik 8 (Theoretische Informatik) Lutz Schröder Lehrstuhl für Informatik 8 (Theoretische Informatik) Hans-Peter Deifel Lehrstuhl für Informatik 8 (Theoretische Informatik)

Related research project(s)

Coalgebra-based generic decision procedures and complexity bounds for modal and hybrid logics (GenMod) May 1, 2008 - Sept. 30, 2016

How to cite

APA:

Hausmann, D., Schröder, L., & Deifel, H.-P. (2018). Permutation games for the weakly aconjunctive μ -calculus. In 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2018 (pp. 361-378). Springer.

MLA:

Hausmann, Daniel, Lutz Schröder, and Hans-Peter Deifel. "Permutation games for the weakly aconjunctive μ -calculus." Proceedings of the 24th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2018 Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018 Springer, 2018. 361-378.

BibTeX: Download