Probabilistic verification
From MaRDI portal
Publication:1803654
Recommendations
Cited in
(25)- 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)
- A temporal logic for proving properties of topologically general executions
- Probabilistic verification and approximation
- 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.
- Constructive development of probabilistic programs
- 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
- Concurrent Probabilistic Programs, Or: How to Schedule If You Must
- scientific article; zbMATH DE number 3982496 (Why is no real title available?)
- scientific article; zbMATH DE number 1324653 (Why is no real title available?)
- The complexity of probabilistic verification
- scientific article; zbMATH DE number 2086517 (Why is no real title available?)
- Quantitative Kleene coalgebras
- Validation of Stochastic Systems
- Conditional Probabilities over Probabilistic and Nondeterministic Systems
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Probabilistic verification of Boolean functions
- A hierarchy of probabilistic system types
- On fairness and randomness
This page was built for publication: Probabilistic verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803654)