کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
439362 690535 2006 14 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On the universal and existential fragments of the μ-calculus
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
On the universal and existential fragments of the μ-calculus
چکیده انگلیسی

One source of complexity in the μ-calculus is its ability to specify an unbounded number of switches between universal and existential branching modes. We therefore study the problems of satisfiability, validity, model checking, and implication for the universal and existential fragments of the μ-calculus, in which only one branching mode is allowed. The universal fragment is rich enough to express most specifications of interest, and therefore improved algorithms are of practical importance. We show that while the satisfiability and validity problems become indeed simpler for the existential and universal fragments, this is, unfortunately, not the case for model checking and implication. We also show the corresponding results for the alternation-free fragment of the μ-calculus, where no alternations between least and greatest fixed points are allowed. Our results imply that efforts to find a polynomial-time model-checking algorithm for the μ-calculus can be replaced by efforts to find such an algorithm for the universal or existential fragment.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 354, Issue 2, 28 March 2006, Pages 173-186