[{"status":"public","date_created":"2018-12-11T12:08:55Z","type":"journal_article","quality_controlled":0,"title":"On the universal and existential fragments of the mu-calculus","day":"28","date_updated":"2021-01-12T07:57:04Z","citation":{"ama":"Henzinger TA, Kupferman O, Majumdar R. On the universal and existential fragments of the mu-calculus. *Theoretical Computer Science*. 2006;354(2):173-186. doi:10.1016/j.tcs.2005.11.015","ieee":"T. A. Henzinger, O. Kupferman, and R. Majumdar, “On the universal and existential fragments of the mu-calculus,” *Theoretical Computer Science*, vol. 354, no. 2. Elsevier, pp. 173–186, 2006.","short":"T.A. Henzinger, O. Kupferman, R. Majumdar, Theoretical Computer Science 354 (2006) 173–186.","chicago":"Henzinger, Thomas A, Orna Kupferman, and Ritankar Majumdar. “On the Universal and Existential Fragments of the Mu-Calculus.” *Theoretical Computer Science*. Elsevier, 2006. https://doi.org/10.1016/j.tcs.2005.11.015.","mla":"Henzinger, Thomas A., et al. “On the Universal and Existential Fragments of the Mu-Calculus.” *Theoretical Computer Science*, vol. 354, no. 2, Elsevier, 2006, pp. 173–86, doi:10.1016/j.tcs.2005.11.015.","apa":"Henzinger, T. A., Kupferman, O., & Majumdar, R. (2006). On the universal and existential fragments of the mu-calculus. *Theoretical Computer Science*. Elsevier. https://doi.org/10.1016/j.tcs.2005.11.015","ista":"Henzinger TA, Kupferman O, Majumdar R. 2006. On the universal and existential fragments of the mu-calculus. Theoretical Computer Science. 354(2), 173–186."},"doi":"10.1016/j.tcs.2005.11.015","abstract":[{"text":"One source of complexity in the μ-calculus is its ability to specify an unbounded number of switches between universal (AX) and existential (EX) 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.","lang":"eng"}],"intvolume":" 354","page":"173 - 186","author":[{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Thomas Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"},{"last_name":"Majumdar","first_name":"Ritankar","full_name":"Majumdar, Ritankar S"}],"volume":354,"issue":"2","month":"03","publisher":"Elsevier","publication":"Theoretical Computer Science","publication_status":"published","publist_id":"276","extern":1,"year":"2006","_id":"4451","date_published":"2006-03-28T00:00:00Z"}]