enpa (PEtri Nets for Program Analysis) was a simple idea of using Petri nets to model programs and study their termination. However, it soon turned out to be too weak for practical use. By developing it further, I came out with the notion of Resource Control Graphs.

Resource Control Graphs (RCG) represent a generic program analysis technique based on annotations on the control flow graph of a program and detecting cycles in it. I'll present several ways of building these RCG, hence showing that they can encompass several known program analysis such as the Size Change Termination or the study of Non Size Increasing functions.

Moreover, further refinements of RCG lead to ideas on how to combine existing analyses and to insight on how to faithfully represent algorithms.