We consider the verification of current-state and K-step opacity for systems modeled as interacting nondeterministic finite-state automata. We describe a new methodology for compositional opacity verification that employs abstraction, in the form of a notion called opaque observation equivalence, and that leverages existing compositional nonblocking verification algorithms. The compositional approach is based on a transformation of the system, where the transformed system is nonblocking if and only if the original one is current-state opaque. Furthermore, we prove that K-step opacity can also be inferred if the transformed system is nonblocking. We provide experimental results where current-state opacity is verified efficiently for a large scaled-up system.

中文翻译：

---

将模块化系统中的不透明验证转变为非阻塞验证


我们考虑验证建模为交互非确定性有限状态自动机的系统的当前状态和 K 步不透明度。我们描述了一种用于组合不透明验证的新方法，该方法采用抽象，以称为不透明观察等效性的概念的形式，并利用现有的组合非阻塞验证算法。组合方法基于系统的转换，其中当且仅当原始系统当前状态不透明时，转换后的系统才是无阻塞的。此外，我们证明如果转换后的系统是非阻塞的，也可以推断出 K 步不透明度。我们提供了实验结果，其中针对大型放大系统有效验证了当前状态的不透明度。