Skip to search formSkip to main contentSkip to account menu

Probabilistic CTL

Known as: PCTL 
Probabilistic Computation Tree Logic (PCTL) is an extension of computation tree logic (CTL) which allows for probabilistic quantification of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
Computation tree logicList of model checking toolsMarkov 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
The ability to reason about and respond to their own emotional states can enhance the believability of Non-Player Characters… 
2015
2015
Counterexample-guided permissive supervisor synthesis for probabilistic systems through learning
Formal methods in robotic motion planning have emerged as a hot research topic recently due to its correct-by-design nature, and… 
2013
2013
Discrete time Markov chain families: modeling and verification of probabilistic software product lines
Software product line engineering (SPLE) enables systematic reuse in development of a family of related software systems by… 
2013
2013
Reasoning about social commitments in the presence of uncertainty
Interaction among autonomous agents in Multi-Agent Systems (MASs) is a key aspect for agents to coordinate with one another… 
2011
2011
Model Checking Epistemic and Probabilistic Properties of Multi-agent Systems
Model checking, a formal automatic verification method, has been widely used in multi-agent systems to verify specifications that… 
2010
2010
Paraconsistent Negation and Classical Negation in Computation Tree Logic
A paraconsistent computation tree logic, PCTL, is obtained by adding paraconsistent negation to the standard computation tree… 
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
2008
2008
Representing PCTL counterexamples
We discuss counterexamples for Probabilistic Computational Tree Logic, and an algorithm based on the k shortest path algorithm to… 
1999
1999
further consideration, apart from the relationships of pCTL frequencies reported here.
P = .001 within the two groups and suggests that comparisons of independent variables may be misleading. The father’s infection… 
1997
1997
Low harmonics, decoupled histeresis type current control of a multiconverter consisting of a parallel transformerless connection of VSC converters
The increasing number of applications of high power converters to power systems, energy systems and motor drives can be… 
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)