| Abstract: |
Probabilistic programs introduce probabilistic assignments and branches on top of the traditional program control flow, and they are mainly used for modeling statistical systems and describing randomized algorithms. In the verification and analysis of probabilistic programs, determining the termination of a program is a fundamental and difficult theoretical problem, exhibiting more complex termination behavior compared to deterministic programs. This report will review important theoretical results and introduce the main techniques surrounding this problem. |