License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2017.30
URN: urn:nbn:de:0030-drops-76991
Go to the corresponding LIPIcs Volume Portal

Klin, Bartek ; Lelyk, Mateusz

Modal mu-Calculus with Atoms

LIPIcs-CSL-2017-30.pdf (0.5 MB)


We introduce an extension of modal mu-calculus to sets with atoms and study its basic properties. Model checking is decidable on orbit-finite structures, and a correspondence to parity games holds. On the other hand, satisfiability becomes undecidable. We also show some limitations to the expressiveness of the calculus and argue that a naive way to remove these limitations results in a logic whose model checking is undecidable.

BibTeX - Entry

  author =	{Bartek Klin and Mateusz Lelyk},
  title =	{{Modal mu-Calculus with Atoms}},
  booktitle =	{26th EACSL Annual Conference on Computer Science Logic (CSL 2017)},
  pages =	{30:1--30:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-045-3},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{82},
  editor =	{Valentin Goranko and Mads Dam},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-76991},
  doi =		{10.4230/LIPIcs.CSL.2017.30},
  annote =	{Keywords: modal mu-calculus, sets with atoms}

Keywords: modal mu-calculus, sets with atoms
Collection: 26th EACSL Annual Conference on Computer Science Logic (CSL 2017)
Issue Date: 2017
Date of publication: 16.08.2017

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI