Results 11 to 20 of about 6,312 (121)
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.
Rayna Dimitrova +3 more
openalex +3 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.
Tomǎš Brázdil +3 more
openalex +4 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.
Jan Křetínský, Alexej Rotar
+8 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 ...
Norihiro Kamide, Yuki Yano
openalex +3 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.
Norihiro Kamide, Juan Bernal
openalex +3 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 +19 more sources
Meditation effects within the hippocampal complex revealed by voxel-based morphometry and cytoarchitectonic probabilistic mapping. [PDF]
, 2013 Scientific studies addressing anatomical variations in meditators' brains have emerged rapidly over the last few years, where significant links are most frequently reported with respect to gray matter (GM).
Gaser, Christian +4 more
core +2 more sources
Discrete-time rewards model-checked [PDF]
, 2003 This paper presents a model-checking approach for analyzing discrete-time Markov reward models. For this purpose, the temporal logic probabilistic CTL is extended with reward constraints.
A. Aziz +14 more
core +2 more sources
Logic and model checking for hidden Markov models [PDF]
, 2005 The branching-time temporal logic PCTL* has been introduced to specify quantitative properties over probability systems, such as discrete-time Markov chains. Until now, however, no logics have been defined to specify properties over hidden Markov models (
Hermanns, Holger +2 more
core +5 more sources
A Markov Chain Model Checker [PDF]
, 2000 Markov chains are widely used in the context of performance and reliability evaluation of systems of various nature. Model checking of such chains with respect to a given (branching) temporal logic formula has been proposed for both the discrete [17,6 ...
Hermanns, Holger +3 more
core +5 more sources