{\L}ukasiewicz mu-Calculus
Logic in Computer Science
2013-09-05 v1 Data Structures and Algorithms
Abstract
The paper explores properties of {\L}ukasiewicz mu-calculus, a version of the quantitative/probabilistic modal mu-calculus containing both weak and strong conjunctions and disjunctions from {\L}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 finite rational probabilistic nondeterministic transition system.
Keywords
Cite
@article{arxiv.1309.0896,
title = {{\L}ukasiewicz mu-Calculus},
author = {Matteo Mio and Alex Simpson},
journal= {arXiv preprint arXiv:1309.0896},
year = {2013}
}
Comments
In Proceedings FICS 2013, arXiv:1308.5896