Ł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...
| Main Authors: | , |
|---|---|
| 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 |
| _version_ | 1819138541619249152 |
|---|---|
| author | Matteo Mio Alex Simpson |
| author_facet | Matteo Mio Alex Simpson |
| author_sort | Matteo Mio |
| collection | DOAJ |
| 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. |
| first_indexed | 2024-12-22T11:08:25Z |
| format | Article |
| id | doaj.art-071e9b3543b748c79805213d8c507edb |
| institution | Directory Open Access Journal |
| issn | 2075-2180 |
| language | English |
| last_indexed | 2024-12-22T11:08:25Z |
| publishDate | 2013-08-01 |
| publisher | Open Publishing Association |
| record_format | Article |
| series | Electronic Proceedings in Theoretical Computer Science |
| spelling | doaj.art-071e9b3543b748c79805213d8c507edb2022-12-21T18:28:13ZengOpen 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 |
| spellingShingle | Matteo Mio Alex Simpson Łukasiewicz mu-Calculus Electronic Proceedings in Theoretical Computer Science |
| title | Łukasiewicz mu-Calculus |
| title_full | Łukasiewicz mu-Calculus |
| title_fullStr | Łukasiewicz mu-Calculus |
| title_full_unstemmed | Łukasiewicz mu-Calculus |
| title_short | Łukasiewicz mu-Calculus |
| title_sort | lukasiewicz mu calculus |
| url | http://arxiv.org/pdf/1309.0896v1 |
| work_keys_str_mv | AT matteomio łukasiewiczmucalculus AT alexsimpson łukasiewiczmucalculus |