Lukasiewicz mu-Calculus

Matteo Mio, Alexander Simpson

Research output: Contribution to journalArticlepeer-review


The paper explores properties of Lukasiewicz mu-calculus, a version of the quantitative/probabilistic modal mu-calculus containing both weak and strong conjunctions and disjunctions from Lukasiewicz (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 finite rational probabilistic nondeterministic transition system.
Original languageEnglish
Pages (from-to)87-104
Number of pages18
JournalElectronic Proceedings in Theoretical Computer Science
Publication statusPublished - 2013


Dive into the research topics of 'Lukasiewicz mu-Calculus'. Together they form a unique fingerprint.

Cite this