Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
FAUST $^{\mathsf 2}$ is a software tool that generates formal abstractions of possibly non-deterministic discrete-time Markov… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The Markov Reward Model Checker (MRMC) is a software toolfor verifying properties over probabilistic models. It supports PCTL and… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2009
Highly Cited
2009
The Markov Reward Model Checker (MRMC) is a software toolfor verifying properties over probabilistic models. It supports PCTL and… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Counterexample-guided abstraction refinement (CEGAR) has been en voguefor the automatic verification of very large systems in the… Expand
  • figure 2
  • table 1
Is this relevant?
2008
2008
We study the problem of model checking Interval-valued Discrete-time Markov Chains (IDTMC). IDTMCs are discrete-time finite… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
In this paper we present efficient symbolic techniques for probabilistic model checking. These have been implemented in PRISM, a… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
In this paper we present an explicit verification algorithm for Probabilistic Systems defining discrete time/finite state Markov… Expand
  • figure 1
  • figure 3
  • figure 10
Is this relevant?
Highly Cited
2002
Highly Cited
2002
In this paper we describe PRISM, a tool being developed at the University of Birmingham for the analysis of probabilistic systems… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We study approximate reasoning about continuous-state labeled Markov processes. We show how to approximate a labeled Markov… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Abstract : Several models of probabilistic systems comprise both probabilistic and nondeterministic choice. In such models, the… Expand
Is this relevant?