FAQ

Probabilistic CTL

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

Topic mentions per year

Topic mentions per year

1979-2018
0102019792018

Related topics

Related topics

4 relations
Computation tree logicList of model checking toolsMarkov Reward Model CheckerTemporal logic

Related mentions per year

Related mentions per year

1938-2018
19401960198020002020
Probabilistic CTL
Temporal logic
Computation tree logic
Markov Reward Model Checker
List of model checking tools

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Probabilistic CTL*: The Deductive Way
Complex probabilistic temporal behaviours need to be guaranteed in robotics and various other control domains, as well as in the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Counterexample Generation in Probabilistic Model Checking
Providing evidence for the refutation of a property is an essential, if not the most important, feature of model checking. This… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The Ins and Outs of the Probabilistic Model Checker MRMC
The Markov Reward Model Checker (MRMC) is a software toolfor verifying properties over probabilistic models. It supports PCTL and… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
2008
2008
The Satisfiability Problem for Probabilistic CTL
We study the satisfiability problem for qualitative PCTL (probabilistic computation tree logic), which is obtained from "ordinary… (More)
  • figure 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Model-Checking Markov Chains in the Presence of Uncertainties
We investigate the problem of model checking Interval-valued Discrete-time Markov Chains (IDTMC). IDTMCs are discrete-time finite… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
PRISM: Probabilistic Symbolic Model Checker
In this paper we describe PRISM, a tool being developed at the University of Birmingham for the analysis of probabilistic systems… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Probabilistic symbolic model checking with PRISM: a hybrid approach
In this paper we present efficient symbolic techniques for probabilistic model checking. These have been implemented in PRISM, a… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Model checking for a probabilistic branching time logic with fairness
We consider concurrent probabilistic systems, based on probabilistic automata of Segala & Lynch [55], which allow non… (More)
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Symbolic Model Checking for Probabilistic Processes
We introduce a symbolic model checking procedure for Probabilistic Computation Tree Logic PCTL over labelled Markov chains as… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Model Checking of Probabilistic and Nondeterministic Systems
The temporal logics pCTL and pCTL* have been proposed as tools for the formal speci cation and veri cation of probabilistic… (More)
Is this relevant?