Automata for the mu-calculus and Related Results

Forfattere

  • David Janin
  • Igor Walukiewicz

DOI:

https://doi.org/10.7146/brics.v2i27.19929

Resumé

The propositional mu-calculus as introduced by Kozen in [4] is
considered. The notion of disjunctive formula is defined and it is shown
that every formula is semantically equivalent to a disjunctive formula.
For these formulas many difficulties encountered in the general case may
be avoided. For instance, satisfiability checking is linear for disjunctive
formulas. This kind of formula gives rise to a new notion of finite automaton
which characterizes the expressive power of the mu-calculus over
all transition systems.

Downloads

Publiceret

1995-01-27

Citation/Eksport

Janin, D., & Walukiewicz, I. (1995). Automata for the mu-calculus and Related Results. BRICS Report Series, 2(27). https://doi.org/10.7146/brics.v2i27.19929

Nummer

Nr. 27 (1995): RS-27 Automata for the mu-calculus and Related Results

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).