Many bureaucratic and industrial processes involve decision points where an object can be sent to a variety of different stations based on certain preconditions. Consider for example a visa application that has needs to be checked at various stages, and move to different stations based on the outcomes of said checks. While the individual decision points in these processes are well defined, in a complicated system, it is hard to understand the redundancies that can be introduced globally by composing a number of these decisions locally. In this paper, we model these processes as Eulerian paths and give an algorithm for calculating a measure of these redundancies, called isolated loops, as a type of loop count on Eulerian paths, and give a bound on this quantity.

翻译：许多官僚和工业程序涉及决定点,其中对象可以在某些先决条件的基础上被发送到不同站点。例如,考虑签证申请,申请必须在不同阶段进行检查,并根据上述检查的结果转移到不同站点。虽然这些过程的个别决定点在复杂的系统中有明确的定义,但很难理解通过在当地形成若干这些决定而在全球引入的冗余。在本文件中,我们将这些过程模拟为Eularian路径,并给出算法,用以计算这些冗余的量,称为孤立环,作为Eularian路径的环数,并对数量加以约束。