Abstract
The propositional mu-calculus as introduced by Kozen in [4] is<br />considered. The notion of disjunctive formula is defined and it is shown<br />that every formula is semantically equivalent to a disjunctive formula.<br />For these formulas many difficulties encountered in the general case may<br />be avoided. For instance, satisfiability checking is linear for disjunctive<br />formulas. This kind of formula gives rise to a new notion of finite automaton<br />which characterizes the expressive power of the mu-calculus over<br />all transition systems.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
