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.

中文翻译：

---

隔离回路

许多官僚和工业流程都涉及决策点，在这些决策点中，可以根据某些先决条件将对象发送到各种不同的站点。例如，考虑一个签证申请，它需要在各个阶段进行检查，并根据所述检查的结果移动到不同的站点。虽然这些过程中的各个决策点定义明确，但在一个复杂的系统中，很难理解通过在本地组合多个这些决策可以全局引入的冗余。在本文中，我们将这些过程建模为欧拉路径，并给出一种算法来计算这些冗余的度量，称为隔离循环，作为欧拉路径上的一种循环计数，并给出了这个数量的界限。