Łukasiewicz mu-Calculus
Abstract
The paper explores properties of Łukasiewicz mu-calculus, a version of the quantitative/probabilistic modal mu-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 finite rational probabilistic nondeterministic transition system.
- Publication:
-
arXiv e-prints
- Pub Date:
- September 2013
- DOI:
- 10.48550/arXiv.1309.0896
- arXiv:
- arXiv:1309.0896
- Bibcode:
- 2013arXiv1309.0896M
- Keywords:
-
- Computer Science - Logic in Computer Science;
- Computer Science - Data Structures and Algorithms
- E-Print:
- In Proceedings FICS 2013, arXiv:1308.5896