Łukasiewicz mu-Calculus

Łukasiewicz mu-Calculus

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...

Full description

Bibliographic Details
Main Authors: Matteo Mio, Alex Simpson
Format: Article
Language:English
Published: Open Publishing Association 2013-08-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1309.0896v1
id doaj-071e9b3543b748c79805213d8c507edb
record_format Article
spelling doaj-071e9b3543b748c79805213d8c507edb2020-11-24T21:47:29ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802013-08-01126Proc. FICS 20138710410.4204/EPTCS.126.7Łukasiewicz mu-CalculusMatteo MioAlex SimpsonThe 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.http://arxiv.org/pdf/1309.0896v1
collection DOAJ
language English
format Article
sources DOAJ
author Matteo Mio
Alex Simpson
spellingShingle Matteo Mio
Alex Simpson
Łukasiewicz mu-Calculus
Electronic Proceedings in Theoretical Computer Science
author_facet Matteo Mio
Alex Simpson
author_sort Matteo Mio
title Łukasiewicz mu-Calculus
title_short Łukasiewicz mu-Calculus
title_full Łukasiewicz mu-Calculus
title_fullStr Łukasiewicz mu-Calculus
title_full_unstemmed Łukasiewicz mu-Calculus
title_sort łukasiewicz mu-calculus
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2013-08-01
description 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.
url http://arxiv.org/pdf/1309.0896v1
work_keys_str_mv AT matteomio łukasiewiczmucalculus
AT alexsimpson łukasiewiczmucalculus
_version_ 1725896566892396544

Similar Items