Probabilistic Computation Tree Logic (PCTL) is an extension of computation tree logic (CTL) that allows for probabilistic quantification of described properties. It has been defined in the paper by Hansson and Jonsson.

2024年9月21日 · Next, we propose the syntax and se-mantics of an action-based Probabilistic Computation Tree Logic (APCTL) and an action-based PCTL* (APCTL*) interpreted over action-labeled discrete-time Markov chains (ADTMCs). We show that both these logics are strictly more expressive than the probabilistic variant of Hennessy-Milner logic (prHML).

PCTL syntax • PCTL syntax: − φ ::= true | a | φ ∧ φ | ¬φ | P ~p [ ψ ] (state formulae) − ψ ::= X φ | φ U≤k φ | φ U φ (path formulae) − where a is an atomic proposition, p ∈ [0,1] is a probability bound, ~ ∈ {<,>,≤,≥}, k ∈ ℕ • A PCTL formula is always a state formula

2024年9月21日 · PCTL* extends PCTL by relaxing the requirement of the rule that any temporal operator must be preceded by a state formula. It also allows nesting and Boolean combination of path formulae. The syntax of PCTL* is defined by the following grammar where \(\Phi ,\Phi ^{\prime },\ldots\) range over PCTL* state formulae and \(\Psi ,\Psi ^{\prime ...

In this paper, we present statistical model checking algorithms for verifying finite horizon PCTL properties on discrete time Markov chains (DTMC) using semantically negatively correlated samples generated by stratified sampling and antithetic sampling.

• Parties are finite-state machines w/ local variables • State transitions are associated with probabilities – Can also have nondeterminism (Markov decision processes) • All parameters must be finite Correctness condition specified as PCTL formula Computes probabilities for each reachable state – Enumerates reachable states

2020年10月12日 · In this paper, we introduce the context-aware probabilistic temporal logic (CAPTL) that provides an intuitive way to formalize system requirements by a set of PCTL objectives with a context-based priority structure. We formally present the syntax and semantics of CAPTL and propose a synthesis algorithm for CAPTL requirements.

In this survey we motivate, define and explain model checking of probabilistic deterministic and nondeterministic systems using the probabilistic computation tree logics PCTL and PCTL *. Juxtapositions to non-deterministic computation tree logic are …

We apply our Pctl model checking algorithms to a class of symbolic prob-abilistic systems. Such systems can be infinite-state, feature both nondeter-ministic and probabilistic choice, and are subject to two assumptions to make our model checking algorithm feasible. The …

La 3e session du Comité d’Orientation Stratégique (COS) du Programme de Coopération Transfrontalière Locale phase 2 (PCTL 2) et du Programme Régional d’Appui à la Décentralisation Financière en Afrique de l’Ouest (PRADEF) s’est tenue ce 19 janvier 2024 à Cotonou, sous la présidence du Commissaire Jonas GBIAN.