The Modal Mu-Calculus

Stéphane Demri, Valentin Goranko, Martin LangeCambridge 2016 · DOI · OpenAlex

Abstract

We have noted that the basic modal logic BML suffers from the deficiency of not being able to make assertions about connectivity, i.e. every BML formula can only ‘look’ up to a certain depth into a transition system. This is of course not enough for many purposes, and this is why richer formalisms like reachability logic TLR and the computation tree logic CTL have been introduced. As we demonstrated in Chapter 7, these logics possess temporal operatorswhich directly translate such assertions into the syntax of a logic. As we showed in Section 7.1.5, all temporal operators in CTL added on top of BML have simple and elegant characterisations in terms of least or greatest fixpoint solutions to certain equations.
BibTeX
@inproceedings{demri2016modal,
  author = {Stéphane Demri and Valentin Goranko and Martin Lange},
  title = {{The Modal Mu-Calculus}},
  booktitle = {Cambridge},
  year = {2016},
  doi = {10.1017/cbo9781139236119.008},
}

Loading related content...

Figure