Probabilistic verification

DOI10.1006/inco.1993.1012zbMath0797.68112OpenAlexW2337623929MaRDI QIDQ1803654

Lenore D. Zuck, Amir Pnueli

Publication date: 29 June 1993

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1993.1012

zbMATH Keywords

correctnessconcurrent programstemporal logic specificationprobabilistic finite state program

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (14)

Model checking and abstraction to the aid of parameterized systems (a survey) ⋮ On fairness and randomness ⋮ Liveness Reasoning with Isabelle/HOL ⋮ When are stochastic transition systems tameable? ⋮ Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL ⋮ VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC ⋮ Quantitative Kleene coalgebras ⋮ A hierarchy of probabilistic system types ⋮ Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness ⋮ Conditional Probabilities over Probabilistic and Nondeterministic Systems ⋮ Quantitative Analysis under Fairness Constraints ⋮ Probabilistic temporal logics via the modal mu-calculus ⋮ A theory of stochastic systems. I: Stochastic automata ⋮ On the verification of qualitative properties of probabilistic processes under fairness constraints.

This page was built for publication: Probabilistic verification