Skip to search formSkip to main contentSkip to account menu

Modal μ-calculus

Known as: Modal μ calculus, Mu calculus, Μ calculus 
In theoretical computer science, the modal μ-calculus (Lμ, Lμ, sometimes just μ-calculus, although this can have a more general meaning) is an… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We introduce an extension of modal μ-calculus to sets with atoms and study its basic properties. Model checking is decidable on… 
Highly Cited
2007
Highly Cited
2007
Web service substitution refers to the problem of identifying a service that can replace another service in the context of a… 
2006
2006
Modal μ-calculus is a modal logic with fixed-point operators and well-known in mathematics and computer scince. For example, many… 
Highly Cited
2004
Highly Cited
2004
Abstraction is often essential to verify a program with model checking. Typically, a concrete source program with an infinite (or… 
2004
2004
The μ-calculus model-checking problem has been of great interest in the context of concurrent programs. Beyond the need to use… 
Highly Cited
1998
Highly Cited
1998
The behavior of an agent is mainly governed by the specific way in which it handles the rational balance between information and… 
1996
1996
This paper presents a prefixed tableaux calculus for Propositional Dynamic Logic with Converse based on a combination of… 
1994
1994
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems… 
1994
1994
As many different modal parameter estimation algorithms have evolved over the past twenty years, the ability to view all…