Deductive proofs of almost sure persistence and recurrence properties
From MaRDI portal
Temporal logic (03B44) Martingales with discrete parameter (60G42) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Recommendations
- A probabilistic proof of the <scp>Perron–Frobenius</scp> theorem
- Coinductive Proof Principles for Stochastic Processes
- A probabilistic proof of the fundamental theorem of algebra
- Almost sure versions of the Darling-Erdős theorem
- Optimal Proofs of Determinacy
- Uniform persistence and chain recurrence
- Proof of a Recurrence Theorem for Strongly Transitive Systems
- scientific article; zbMATH DE number 3915307
- Publication:3473667
Cited in
(11)- Robust global recurrence for a class of stochastic hybrid systems
- Fair termination for parameterized probabilistic concurrent systems
- Predicatively unprovable termination of the Ackermannian Goodstein process
- Solving invariant generation for unsolvable loops
- Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs
- On Lexicographic Proof Rules for Probabilistic Termination
- A learner-verifier framework for neural network controllers and certificates of stochastic systems
- Probabilistic program verification via inductive synthesis of inductive invariants
- On lexicographic proof rules for probabilistic termination
- (Un)solvable loop analysis
- Learning probabilistic termination proofs
This page was built for publication: Deductive proofs of almost sure persistence and recurrence properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272919)
