Since 2014
Automata for the mu-calculus and Related Results
BRICS Report Series
View Archive Info| Field | Value | |
| Title |
Automata for the mu-calculus and Related Results
|
|
| Creator |
Janin, David
Walukiewicz, Igor |
|
| Description |
The propositional mu-calculus as introduced by Kozen in [4] isconsidered. The notion of disjunctive formula is defined and it is shownthat every formula is semantically equivalent to a disjunctive formula.For these formulas many difficulties encountered in the general case maybe avoided. For instance, satisfiability checking is linear for disjunctiveformulas. This kind of formula gives rise to a new notion of finite automatonwhich characterizes the expressive power of the mu-calculus overall transition systems.
|
|
| Publisher |
Aarhus University
|
|
| Contributor |
—
|
|
| Date |
1995-01-27
|
|
| Type |
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion — |
|
| Format |
application/pdf
|
|
| Identifier |
https://tidsskrift.dk/brics/article/view/19929
10.7146/brics.v2i27.19929 |
|
| Source |
BRICS Report Series; No 27 (1995): RS-27 Automata for the mu-calculus and Related Results
BRICS Report Series; No 27 (1995): RS-27 Automata for the mu-calculus and Related Results 1601-5355 0909-0878 |
|
| Language |
eng
|
|
| Relation |
https://tidsskrift.dk/brics/article/view/19929/17583
|
|
| Rights |
Copyright (c) 2015 BRICS Report Series
|
|