Eliminating Recursion in the µ-Calculus
نویسنده
چکیده
Consider the following problem: given a formula of the modal-calculus, decide whether this formula is equivalently expressible in basic modal logic. It is shown that this problem is decidable, in fact in deterministic exponential time. The decidability result can be obtained through a model theoretic reduction to the monadic second-order theory of the complete binary tree, which by Rabin's classical result is decidable, albeit of non-elementary complexity. An improved analysis based on tree automata yields an exponential time decision procedure.
منابع مشابه
On the Formalization of the Modal µ-Calculus in the Calculus of Inductive Constructions
We present a Natural Deduction proof system for the propositional modal μ-calculus, and its formalization in the Calculus of Inductive Constructions. We address several problematic issues, such as the use of higher-order abstract syntax in inductive sets in presence of recursive constructors, the formalization of modal (sequent-style) rules and of context sensitive grammars. The formalization c...
متن کاملFormalizing a Lazy Substitution Proof System for µ-calculus in the Calculus of Inductive Constructions
We present a Natural Deduction proof system for the propositional modal μ-calculus, and its formalization in the Calculus of Inductive Constructions. We address several problematic issues, such as the use of higher-order abstract syntax in inductive sets in presence of recursive constructors, the encoding of modal (sequent-style) rules and of context sensitive grammars. The formalization can be...
متن کاملModal µ-Calculus, Model Checking and Gauß Elimination
In this paper we present a novel approach for solving Boolean equation systems with nested minimal and maximal xpoints. The method works by successively eliminating variables and reducing a Boolean equation system similar to Gauu elimination for linear equation systems. It does not require backtracking techniques. Within one framework we suggest a global and a local algorithm. In the context of...
متن کاملNormal Form in DI-Algebra with Recursion
DI-algebra is a process algebra for delay-insensitive processes. Like in most process algebras, a normal form for finite expressions can be defined. Unlike most process algebras, however, we show that we can also define a normal form for recursive expressions. This is done by first eliminating operators using the laws of the algebra and then minimizing cycles in a state graph.
متن کاملThe untyped stack calculus and Bohm's theorem
The stack calculus is a functional language in which is in a Curry-Howard correspondence with classical logic. It enjoys confluence but, as well as Parigot's λ µ, does not admit the Böhm Theorem, typical of the λ-calculus. We present a simple extension of stack calculus which is for the stack calculus what Saurin's Λµ is for λ µ.
متن کامل