Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,398,468 papers from all fields of science
Search
Sign In
Create Free Account
Modal μ-calculus
Known as:
Modal μ calculus
, Mu calculus
, Μ calculus
Expand
In theoretical computer science, the modal μ-calculus (Lμ, Lμ, sometimes just μ-calculus, although this can have a more general meaning) is an…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
22 relations
CTL*
Deadlock
Dexter Kozen
Dynamic logic (modal logic)
Expand
Broader (1)
Model checking
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Modal μ-Calculus with Atoms ∗
Bartek Klin
,
Mateusz Łełyk
2017
Corpus ID: 42398397
We introduce an extension of modal μ-calculus to sets with atoms and study its basic properties. Model checking is decidable on…
Expand
Highly Cited
2007
Highly Cited
2007
On Context-Specific Substitutability of Web Services
Jyotishman Pathak
,
Samik Basu
,
Vasant G Honavar
IEEE International Conference on Web Services…
2007
Corpus ID: 12323199
Web service substitution refers to the problem of identifying a service that can replace another service in the context of a…
Expand
2006
2006
A First-Order Extension of Modal μ- calculus
Keishi Okamoto
2006
Corpus ID: 15219220
Modal μ-calculus is a modal logic with fixed-point operators and well-known in mathematics and computer scince. For example, many…
Expand
2005
2005
A decidable class of problems for control under partial observation
S. Pinchinat
,
Stéphane Riedweg
Information Processing Letters
2005
Corpus ID: 14602240
Highly Cited
2004
Highly Cited
2004
The existence of finite abstractions for branching time model checking
D. Dams
,
Kedar S. Namjoshi
Proceedings of the 19th Annual IEEE Symposium on…
2004
Corpus ID: 10225032
Abstraction is often essential to verify a program with model checking. Typically, a concrete source program with an infinite (or…
Expand
2004
2004
A Measured Collapse of the Modal µ-Calculus Alternation Hierarchy
Doron Bustan
,
O. Kupferman
,
Moshe Y. Vardi
Symposium on Theoretical Aspects of Computer…
2004
Corpus ID: 1694239
The μ-calculus model-checking problem has been of great interest in the context of concurrent programs. Beyond the need to use…
Expand
Highly Cited
1998
Highly Cited
1998
On the Relationship Between BDI Logics and Standard Logics of Concurrency
K. Schild
Autonomous Agents and Multi-Agent Systems
1998
Corpus ID: 19803951
The behavior of an agent is mainly governed by the specific way in which it handles the rational balance between information and…
Expand
1996
1996
Tableaux and Algorithms for Propositional Dynamic Logic with Converse
Giuseppe De Giacomo
,
F. Massacci
CADE
1996
Corpus ID: 11315551
This paper presents a prefixed tableaux calculus for Propositional Dynamic Logic with Converse based on a combination of…
Expand
1994
1994
On the parallel complexity of model checking in the modal mu-calculus
Shipei Zhang
,
O. Sokolsky
,
S. Smolka
Proceedings Ninth Annual IEEE Symposium on Logic…
1994
Corpus ID: 9569268
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems…
Expand
1994
1994
Modal Parameter Estimation: A Unified Matrix Polynomial Approach
R. Allemang
,
David. L. Brown
,
W. Fladung
1994
Corpus ID: 18966181
As many different modal parameter estimation algorithms have evolved over the past twenty years, the ability to view all…
Expand
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)
ACCEPT & CONTINUE