Probabilistic verification

DOI10.1006/inco.1993.1012zbMath0797.68112MaRDI 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

correctness; concurrent programs; temporal logic specification; probabilistic finite state program

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68Q60: Specification and verification (program logics, model checking, etc.)

Related Items

Conditional Probabilities over Probabilistic and Nondeterministic Systems, Quantitative Kleene coalgebras, A hierarchy of probabilistic system types, On fairness and randomness, Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL, When are stochastic transition systems tameable?, Model checking and abstraction to the aid of parameterized systems (a survey), 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., VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC, Liveness Reasoning with Isabelle/HOL, Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness, Quantitative Analysis under Fairness Constraints