Abstract In this paper we consider the alternation hierarchy of the modal mu-calculus over finite symmetric graphs and show that in this class the hierarchy is infinite. The mu-calculus over the symmetric class does not enjoy the finite model property, hence this result is not a trivial consequence of the strictness of the hierarchy over symmetric graphs. We also find a lower bound and an upper bound for the satisfiability problem of the mu-calculus over finite symmetric graphs.

On the Modal mu-calculus over finite symmetric graphs

LENZI, Giacomo
2015

Abstract

Abstract In this paper we consider the alternation hierarchy of the modal mu-calculus over finite symmetric graphs and show that in this class the hierarchy is infinite. The mu-calculus over the symmetric class does not enjoy the finite model property, hence this result is not a trivial consequence of the strictness of the hierarchy over symmetric graphs. We also find a lower bound and an upper bound for the satisfiability problem of the mu-calculus over finite symmetric graphs.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11386/4037453
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 1
social impact