Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,294 papers from all fields of science
Search
Sign In
Create Free Account
Probabilistic CTL
Known as:
PCTL
Probabilistic Computation Tree Logic (PCTL) is an extension of computation tree logic (CTL) which allows for probabilistic quantification of…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Computation tree logic
List of model checking tools
Markov Reward Model Checker
Broader (1)
Temporal logic
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Creating Affective Autonomous Characters Using Planning in Partially Observable Stochastic Domains
Xiangyang Huang
,
Shudong Zhang
,
Yuanyuan Shang
,
Wei-gong Zhang
,
Jie Liu
IEEE Transactions on Computational Intelligence…
2017
Corpus ID: 17249527
The ability to reason about and respond to their own emotional states can enhance the believability of Non-Player Characters…
Expand
2013
2013
Discrete time Markov chain families: modeling and verification of probabilistic software product lines
M. Varshosaz
,
R. Khosravi
SPLC '13 Workshops
2013
Corpus ID: 15619577
Software product line engineering (SPLE) enables systematic reuse in development of a family of related software systems by…
Expand
2012
2012
Symbolic Counterexample Generation for Discrete-Time Markov Chains
N. Jansen
,
E. Ábrahám
,
+4 authors
B. Becker
International Workshop on Formal Aspects of…
2012
Corpus ID: 13789891
In this paper we investigate the generation of counterexamples for discrete-time Markov chains (DTMCs) and PCTL properties…
Expand
2011
2011
Model Checking Epistemic and Probabilistic Properties of Multi-agent Systems
W. Wan
,
J. Bentahar
,
A. Hamza
International Conference on Industrial…
2011
Corpus ID: 17871107
Model checking, a formal automatic verification method, has been widely used in multi-agent systems to verify specifications that…
Expand
2010
2010
Paraconsistent Negation and Classical Negation in Computation Tree Logic
N. Kamide
,
K. Kaneiwa
International Conference on Agents and Artificial…
2010
Corpus ID: 32132131
A paraconsistent computation tree logic, PCTL, is obtained by adding paraconsistent negation to the standard computation tree…
Expand
2009
2009
Formal Methods and Software Engineering, 11th International Conference on Formal Engineering Methods, ICFEM 2009, Rio de Janeiro, Brazil, December 9-12, 2009. Proceedings
K. Breitman
,
Ana Cavalcanti
IEEE International Conference on Formal…
2009
Corpus ID: 32534460
2004
2004
Further evidence on the relation between historical changes in financial condition , future stock returns and the value / glamour effect
Joseph D. Piotroski
2004
Corpus ID: 7907929
1997
1997
The Interval Domain: A Matchmaker for aCTL and aPCTL
M. Huth
US-Brazil Joint Workshops on the Formal…
1997
Corpus ID: 326904
1997
1997
Low harmonics, decoupled histeresis type current control of a multiconverter consisting of a parallel transformerless connection of VSC converters
L. Matakas
,
Walter Kaiser
IAS '97. Conference Record of the IEEE Industry…
1997
Corpus ID: 78008172
The increasing number of applications of high power converters to power systems, energy systems and motor drives can be…
Expand
1995
1995
Decision theory and safety-critical interfaces
Chris W. Johnson
IFIP TC13 International Conference on Human…
1995
Corpus ID: 8317114
Risk assessment techniques are being used to support the engineering of complex, safety-critical systems. They help to identify…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE