Łukasiewicz mu-Calculus

Publication

Publication

The paper explores properties of Łukasiewicz mu-calculus, a version of the quantitative/probabilistic
modal m-calculus containing both weak and strong conjunctions and disjunctions from Łukasiewicz
(fuzzy) logic. We show that this logic encodes the well-known probabilistic temporal logic PCTL.
And we give a model-checking algorithm for computing the rational denotational value of a formula
at any state in a ﬁnite rational probabilistic nondeterministic transition system.