FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2168783150> ?p ?o ?g. }

• W2168783150 abstract "We study the satisfiability problem for qualitative PCTL (probabilistic computation tree logic), which is obtained from ordinary CTL by replacing the EX, AX, EU, and AU operators with their qualitative counterparts X <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>></sup> <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>0</sup> , X <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>=</sup> <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>1</sup> , U <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>></sup> <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>0</sup> , and U <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>=</sup> <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>1</sup> , respectively. As opposed to CTL, qualitative PCTL does not have a small model property, and there are even qualitative PCTL formulae which have only infinite- state models. Nevertheless, we show that the satisfiability problem for qualitative PCTL is EXPTIME-complete and we give an exponential-time algorithm which for a given formula phi computes a finite description of a model (if it exists), or answers not satisfiable (otherwise). We also consider the finite satisfiability problem and provide analogous results. That is, we show that the finite satisfiability problem for qualitative PCTL is EXPTIME-complete, and every finite satisfiable formula has a model of an exponential size which can effectively be constructed in exponential time. Finally, we give some results about the quantitative PCTL, where the numerical bounds in probability constraints can be arbitrary rationals between 0 and 1. We prove that the problem whether a given quantitative PCTL formula phi has a model of the branching degree at most k, where k > 2 is an arbitrary but fixed constant, is highly undecidable. We also show that every satisfiable formula phi has a model with branching degree at most phi + 2. However, this does not yet imply the undecidability of the satisfiability problem for quantitative PCTL, and we in fact conjecture the opposite." @default.
• W2168783150 created "2016-06-24" @default.
• W2168783150 creator A5019575165 @default.
• W2168783150 creator A5074485601 @default.
• W2168783150 creator A5082160514 @default.
• W2168783150 creator A5087974593 @default.
• W2168783150 date "2008-06-01" @default.
• W2168783150 modified "2023-10-17" @default.
• W2168783150 title "The Satisfiability Problem for Probabilistic CTL" @default.
• W2168783150 cites W1488279842 @default.
• W2168783150 cites W1491931107 @default.
• W2168783150 cites W1497670448 @default.
• W2168783150 cites W1502518842 @default.
• W2168783150 cites W1503627878 @default.
• W2168783150 cites W1590732223 @default.
• W2168783150 cites W1715173658 @default.
• W2168783150 cites W1864873123 @default.
• W2168783150 cites W1972203711 @default.
• W2168783150 cites W2005998857 @default.
• W2168783150 cites W2037416037 @default.
• W2168783150 cites W2050530663 @default.
• W2168783150 cites W2053068495 @default.
• W2168783150 cites W2069709605 @default.
• W2168783150 cites W2075664249 @default.
• W2168783150 cites W2112476716 @default.
• W2168783150 cites W2152720531 @default.
• W2168783150 doi "https://doi.org/10.1109/lics.2008.21" @default.
• W2168783150 hasPublicationYear "2008" @default.
• W2168783150 type Work @default.
• W2168783150 sameAs 2168783150 @default.
• W2168783150 citedByCount "30" @default.
• W2168783150 countsByYear W21687831502012 @default.
• W2168783150 countsByYear W21687831502013 @default.
• W2168783150 countsByYear W21687831502014 @default.
• W2168783150 countsByYear W21687831502015 @default.
• W2168783150 countsByYear W21687831502016 @default.
• W2168783150 countsByYear W21687831502017 @default.
• W2168783150 countsByYear W21687831502018 @default.
• W2168783150 countsByYear W21687831502019 @default.
• W2168783150 countsByYear W21687831502021 @default.
• W2168783150 countsByYear W21687831502022 @default.
• W2168783150 countsByYear W21687831502023 @default.
• W2168783150 crossrefType "proceedings-article" @default.
• W2168783150 hasAuthorship W2168783150A5019575165 @default.
• W2168783150 hasAuthorship W2168783150A5074485601 @default.
• W2168783150 hasAuthorship W2168783150A5082160514 @default.
• W2168783150 hasAuthorship W2168783150A5087974593 @default.
• W2168783150 hasBestOaLocation W21687831502 @default.
• W2168783150 hasConcept C11413529 @default.
• W2168783150 hasConcept C114614502 @default.
• W2168783150 hasConcept C118615104 @default.
• W2168783150 hasConcept C33923547 @default.
• W2168783150 hasConcept C41008148 @default.
• W2168783150 hasConceptScore W2168783150C11413529 @default.
• W2168783150 hasConceptScore W2168783150C114614502 @default.
• W2168783150 hasConceptScore W2168783150C118615104 @default.
• W2168783150 hasConceptScore W2168783150C33923547 @default.
• W2168783150 hasConceptScore W2168783150C41008148 @default.
• W2168783150 hasLocation W21687831501 @default.
• W2168783150 hasLocation W21687831502 @default.
• W2168783150 hasLocation W21687831503 @default.
• W2168783150 hasOpenAccess W2168783150 @default.
• W2168783150 hasPrimaryLocation W21687831501 @default.
• W2168783150 hasRelatedWork W1412164264 @default.
• W2168783150 hasRelatedWork W1421410134 @default.
• W2168783150 hasRelatedWork W1978225469 @default.
• W2168783150 hasRelatedWork W1978588354 @default.
• W2168783150 hasRelatedWork W2333698505 @default.
• W2168783150 hasRelatedWork W2351491280 @default.
• W2168783150 hasRelatedWork W2371447506 @default.
• W2168783150 hasRelatedWork W2386767533 @default.
• W2168783150 hasRelatedWork W303980170 @default.
• W2168783150 hasRelatedWork W3100313843 @default.
• W2168783150 isParatext "false" @default.
• W2168783150 isRetracted "false" @default.
• W2168783150 magId "2168783150" @default.
• W2168783150 workType "article" @default.