Results 11 to 20 of about 6,419 (111)
Probabilistic CTL $$^{*}$$ : The Deductive Way [PDF]
, 2016 Complex probabilistic temporal behaviours need to be guaranteed in robotics and various other control domains, as well as in the context of families of randomized protocols. At its core, this entails checking infinite-state probabilistic systems with respect to quantitative properties specified in probabilistic temporal logics.
Dimitrova, R. +3 more
openaire +5 more sources
The Satisfiability Problem for Probabilistic CTL [PDF]
2008 23rd Annual IEEE Symposium on Logic in Computer Science, 2008 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 > 0, X = 1, U > 0, and U = 1, respectively.
Brázdil, T +3 more
openaire +3 more sources
Towards Hierarchical Probabilistic CTL Model Checking: Theoretical Foundations
Proceedings of the 11th International Conference on Agents and Artificial Intelligence, 2019 This study proposes a hierarchical probabilistic computation tree logic, HpCTL, which is an extension of the standard probabilistic computation tree logic pCTL, as a theoretical basis for hierarchical probabilistic CTL model checking. Hierarchical probabilistic model checking is a new paradigm that can appropriately verify hierarchical randomized (or ...
Yuki Yano, Norihiro Kamide
openaire +2 more sources
Proceedings of the 11th International Conference on Agents and Artificial Intelligence, 2019 A locative inconsistency-tolerant hierarchical probabilistic computation tree logic (LIHpCTL) is introduced in this paper to establish the logical foundation of a new model checking paradigm. This logic is an extension of several previously proposed extensions of the standard temporal logic known as CTL, which is widely used for model checking.
Juan Bernal, Norihiro Kamide
openaire +2 more sources
The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL
, 2018 We investigate the satisfiability and finite satisfiability problem for probabilistic computation-tree logic (PCTL) where operators are not restricted by any step bounds. We establish decidability for several fragments containing quantitative operators and pinpoint the difficulties arising in more complex fragments where the decidability remains open.
Kretínský, Jan, Rotar, Alexej
openaire +5 more sources
A probabilistic extension of UML statecharts: specification and verification [PDF]
, 2002 This paper is the extended technical report that corresponds to a published paper [14]. This paper introduces means to specify system randomness within UML statecharts, and to verify probabilistic temporal properties over such enhanced statecharts which ...
Hermanns, Holger +2 more
core +24 more sources
A Probabilistic Temporal Logic with Frequency Operators and Its Model Checking [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Probabilistic Computation Tree Logic (PCTL) and Continuous Stochastic Logic (CSL) are often used to describe specifications of probabilistic properties for discrete time and continuous time, respectively.
Takashi Tomita +2 more
doaj +1 more source
A biased competition theory of cytotoxic T lymphocyte interaction with tumor nodules. [PDF]
PLoS ONE, 2015 The dynamics of the interaction between Cytotoxic T Lymphocytes (CTL) and tumor cells has been addressed in depth, in particular using numerical simulations.
Claire Christophe +7 more
doaj +1 more source
Debugging of Markov Decision Processes (MDPs) Models [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 In model checking, a counterexample is considered as a valuable tool for debugging. In Probabilistic Model Checking (PMC), counterexample generation has a quantitative aspect. The counterexample in PMC is a set of paths in which a path formula holds, and
Hichem Debbi
doaj +1 more source
Qualitative Logics and Equivalences for Probabilistic Systems [PDF]
Logical Methods in Computer Science, 2009 We investigate logics and equivalence relations that capture the qualitative behavior of Markov Decision Processes (MDPs). We present Qualitative Randomized CTL (QRCTL): formulas of this logic can express the fact that certain temporal properties hold ...
Krishnendu Chatterjee +3 more
doaj +1 more source