Add to ORKGThe 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
The fully enriched μ-calculus is the extension of the propositionalμ-calculus with inverse pro...
Modal µ-calculus is one of the central languages of logic and verification , whose study involves no...
Abstract µ-Calculus and automata on infinite trees are complementary ways of de-scribing infinite tr...
The propositional mu-calculus as introduced by Kozen in [12] is considered.In that paper a finitary ...
The modal mu-calculus is a very expressive formalism extending basic modal logic with least and grea...
A key result in the theory of the modal mu-calculus is the disjunctive normal form theorem by Janin ...
This work examines propositional fixed point temporal and modal logics called mu-calculi and their r...
Many algorithmic results on the modal mu-calculus use representations of formulas such as alternatin...
We explore the proof theory of the modal μ-calculus with converse, aka the ‘full μ-calculus’. Buildi...
An important characteristic of Kozen’s µ-calculus is its strong connection with parity alternating t...
We present a direct translation from a sub-logic of µ-calculus to non-deterministic binary automata ...
We study the proof-theoretic relationship between two deductive systems for the modal mu-calculus. F...
peer reviewedWe present a new technique for obtaining decision procedures for modal logics of progra...
We introduce an axiomatization for the coalgebraic fixed point logic which was introduced by Venema ...
In the first chapter, we review some standard notations and concepts that are used all through this ...
The fully enriched μ-calculus is the extension of the propositionalμ-calculus with inverse pro...
Modal µ-calculus is one of the central languages of logic and verification , whose study involves no...
Abstract µ-Calculus and automata on infinite trees are complementary ways of de-scribing infinite tr...
The propositional mu-calculus as introduced by Kozen in [12] is considered.In that paper a finitary ...
The modal mu-calculus is a very expressive formalism extending basic modal logic with least and grea...
A key result in the theory of the modal mu-calculus is the disjunctive normal form theorem by Janin ...
This work examines propositional fixed point temporal and modal logics called mu-calculi and their r...
Many algorithmic results on the modal mu-calculus use representations of formulas such as alternatin...
We explore the proof theory of the modal μ-calculus with converse, aka the ‘full μ-calculus’. Buildi...
An important characteristic of Kozen’s µ-calculus is its strong connection with parity alternating t...
We present a direct translation from a sub-logic of µ-calculus to non-deterministic binary automata ...
We study the proof-theoretic relationship between two deductive systems for the modal mu-calculus. F...
peer reviewedWe present a new technique for obtaining decision procedures for modal logics of progra...
We introduce an axiomatization for the coalgebraic fixed point logic which was introduced by Venema ...
In the first chapter, we review some standard notations and concepts that are used all through this ...
The fully enriched μ-calculus is the extension of the propositionalμ-calculus with inverse pro...
Modal µ-calculus is one of the central languages of logic and verification , whose study involves no...
Abstract µ-Calculus and automata on infinite trees are complementary ways of de-scribing infinite tr...