Some theories on data flow security are based on order-theoretical concepts, most commonly on lattice concepts. This paper presents a correspondence between security concepts and partial order concepts, by which the former become an application of the latter. The formalization involves concepts of data flow, equivalence classes of entities that can access the same data, and labels. Efficient, well-known algorithms to obtain one of these from one of the others are presented. Security concepts such as secrecy (also called confidentiality), integrity and conflict can be expressed in this theory. Further, it is shown that complex tuple labels used in the literature to express security levels can be translated into equivalent set labels. A consequence is that any network's data flow or access control relationships can be defined by assigning simple set labels to the entities. Finally, it is shown how several partial orders can be combined when different data flows must coexist.

翻译：数据流安全的部分理论基于序理论概念，最常用的是格概念。本文展示了安全概念与偏序概念之间的对应关系，由此前者成为后者的应用。形式化过程涉及数据流、可访问相同数据的实体等价类以及标签等概念。本文提出了从这些概念之一推导出另一概念的高效且广为人知的算法。可在此理论中表达机密性（亦称保密性）、完整性与冲突等安全概念。进一步证明，文献中用于表达安全级别的复杂元组标签可转化为等价的集合标签。这意味着任何网络的数据流或访问控制关系均可通过为实体分配简单集合标签来定义。最后，本文展示了当不同数据流需共存时，如何组合多种偏序关系。