Deductive proofs of almost sure persistence and recurrence properties

DOI10.1007/978-3-662-49674-9_15zbMath1420.68153OpenAlexW2471883032MaRDI QIDQ2272919

Sriram Sankaranarayanan, Aleksandar Chakarov, Yuen-Lam Voronin

Publication date: 17 September 2019

Full work available at URL: https://doi.org/10.1007/978-3-662-49674-9_15

zbMATH Keywords

stochastic controlMarkov processestemporal logicstochastic systemssum-of-squares programming

Mathematics Subject Classification ID

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) Temporal logic (03B44) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (3)

Learning probabilistic termination proofs ⋮ Solving invariant generation for unsolvable loops ⋮ Fair Termination for Parameterized Probabilistic Concurrent Systems

This page was built for publication: Deductive proofs of almost sure persistence and recurrence properties