A proof is usually a finite tree constructed according to the rules of a deduction system. Contrary to this standard notion, cyclic proofs can be seen not as trees, but as finite graphs that satisfy some additional requirements on cycles. In this talk, we consider several examples of cyclic proof systems in modal logic and present some of their applications.