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)

Related topics

Related topics

22 relations
CTL*DeadlockDexter KozenDynamic logic (modal logic)

Broader (1)

Model checking

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Modal μ-Calculus with Atoms ∗
We introduce an extension of modal μ-calculus to sets with atoms and study its basic properties. Model checking is decidable on… 
2012
2012
Computing Game Metrics on Markov Decision Processes
In this paper we study the complexity of computing the game bisimulation metric defined by de Alfaro et al. on Markov Decision… 
2012
2012
Recursive Checkonly QVT-R Transformations with General when and where Clauses via the Modal Mu Calculus
In earlier work we gave a game-based semantics for checkonly QVT-R transformations. We restricted when and where clauses to be… 
2009
2009
Development of verification and conformance testing tools for a railway signaling communication protocol
Highly Cited
2007
Highly Cited
2007
On Context-Specific Substitutability of Web Services
Web service substitution refers to the problem of identifying a service that can replace another service in the context of a… 
2004
2004
A Measured Collapse of the Modal µ-Calculus Alternation Hierarchy
The μ-calculus model-checking problem has been of great interest in the context of concurrent programs. Beyond the need to use… 
Highly Cited
2004
Highly Cited
2004
The existence of finite abstractions for branching time model checking
Abstraction is often essential to verify a program with model checking. Typically, a concrete source program with an infinite (or… 
Highly Cited
1998
Highly Cited
1998
On the Relationship Between BDI Logics and Standard Logics of Concurrency
The behavior of an agent is mainly governed by the specific way in which it handles the rational balance between information and… 
1994
1994
On the parallel complexity of model checking in the modal mu-calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems… 
1994
1994
Modal Parameter Estimation: A Unified Matrix Polynomial Approach
As many different modal parameter estimation algorithms have evolved over the past twenty years, the ability to view all… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)