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… 
2017
2017
Parity games, separations, and the modal μ-calculus
Published in print by Universitatsverlag der TU Berlin, ISBN 978-3-7983-2887-7 (ISSN 2199-5249) 
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… 
2006
2006
A First-Order Extension of Modal μ- calculus
Modal μ-calculus is a modal logic with fixed-point operators and well-known in mathematics and computer scince. For example, many… 
2006
2006
A Model Checking Tool Embedded into Services Composition Environment
This paper proposes a tool for formal verification of Web services composition based on an extended pi-calculus with type system… 
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… 
2002
2002
Verification of distributed systems modelled by high-level Petri nets
A tool PNV (Petri net verifier) designed for analysis, modelling and verification of coloured Petri nets (CPN) is presented in… 
2001
2001
Efficient Verification of a Multicast Protocol for Mobile Computing
We present the formal verification of a multicast protocol for mobile computing. The protocol supports reliable and totally… 
1996
1996
Eecient Local Model-checking for Fragments of the Modal -calculus
This paper develops eecient local model-checking algorithms for expressive fragments of the modal-calculus. The time complexity… 
1996
1996
Tableaux and Algorithms for Propositional Dynamic Logic with Converse
This paper presents a prefixed tableaux calculus for Propositional Dynamic Logic with Converse based on a combination of… 
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)