Pages that link to "Item:Q2272919"
From MaRDI portal
The following pages link to Deductive proofs of almost sure persistence and recurrence properties (Q2272919):
Displaying 9 items.
- Learning probabilistic termination proofs (Q832245) (← links)
- Robust global recurrence for a class of stochastic hybrid systems (Q2406968) (← links)
- Fair Termination for Parameterized Probabilistic Concurrent Systems (Q3303911) (← links)
- Predicatively unprovable termination of the Ackermannian Goodstein process (Q5113418) (← links)
- Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs (Q6487312) (← links)
- On Lexicographic Proof Rules for Probabilistic Termination (Q6488476) (← links)
- A learner-verifier framework for neural network controllers and certificates of stochastic systems (Q6535337) (← links)
- Probabilistic program verification via inductive synthesis of inductive invariants (Q6536145) (← links)
- On lexicographic proof rules for probabilistic termination (Q6610383) (← links)