Rate of Process Execution for Single SCC
Consider a strongly connected process graph and let xi(k) represent sequence of time instances for invocation of process pi. There exists integer N such that
1. The sequence xi(k) - xi(k-1) is periodic for k >= N,
2. If the period of the sequence of inter-execution times is P, then for l >= N
where l is the unique eigenvalue of the process adjacency matrix.
l obtained by computing the maximum cycle mean in process graph.