Published in: LIPIcs, Volume 59, 27th International Conference on Concurrency Theory (CONCUR 2016)
Daniel Hausmann, Lutz Schröder, and Christoph Egger. Global Caching for the Alternation-free µ-Calculus. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 34:1-34:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{hausmann_et_al:LIPIcs.CONCUR.2016.34, author = {Hausmann, Daniel and Schr\"{o}der, Lutz and Egger, Christoph}, title = {{Global Caching for the Alternation-free µ-Calculus}}, booktitle = {27th International Conference on Concurrency Theory (CONCUR 2016)}, pages = {34:1--34:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-017-0}, ISSN = {1868-8969}, year = {2016}, volume = {59}, editor = {Desharnais, Jos\'{e}e and Jagadeesan, Radha}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.34}, URN = {urn:nbn:de:0030-drops-61724}, doi = {10.4230/LIPIcs.CONCUR.2016.34}, annote = {Keywords: modal logic, fixpoint logic, satisfiability, global caching, coalgebraic logic} }
Feedback for Dagstuhl Publishing