Global Caching for the Alternation-free Coalgebraic mu-calculus

Hausmann D, Schröder L, Egger C (2016)

Publication Language: English

Publication Type: Conference contribution

Publication year: 2016

Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Series: LIPIcs

City/Town: Dagstuhl

Book Volume: 59

Pages Range: 34:1-34:15

Conference Proceedings Title: Proceedings of the 27th International Conference on Concurrency Theory, CONCUR 2016

Event location: Québec City, Canada

URI: http://drops.dagstuhl.de/opus/volltexte/2016/6172/

DOI: 10.4230/LIPIcs.CONCUR.2016.34

Open Access Link: https://doi.org/10.4230/LIPIcs.CONCUR.2016.34

Authors with CRIS profile

Daniel Hausmann Lehrstuhl für Informatik 8 (Theoretische Informatik) Lutz Schröder Lehrstuhl für Informatik 8 (Theoretische Informatik) Christoph Egger Lehrstuhl für Informatik 13 (Angewandte Kryptographie)

Related research project(s)

Coalgebra-based generic decision procedures and complexity bounds for modal and hybrid logics (GenMod) May 1, 2008 - Sept. 30, 2016 Probabilistische Beschreibungslogik als Fragment der Probabilistischen Logik Erster Stufe (ProbDL) April 1, 2011 - April 1, 2014

How to cite

APA:

Hausmann, D., Schröder, L., & Egger, C. (2016). Global Caching for the Alternation-free Coalgebraic mu-calculus. In Proceedings of the 27th International Conference on Concurrency Theory, CONCUR 2016 (pp. 34:1-34:15). Québec City, Canada: Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

MLA:

Hausmann, Daniel, Lutz Schröder, and Christoph Egger. "Global Caching for the Alternation-free Coalgebraic mu-calculus." Proceedings of the 27th International Conference on Concurrency Theory, Québec City, Canada Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016. 34:1-34:15.

BibTeX: Download