This paper describes algorithms to compute a counterexample when compositional nonblocking verification determines that a discrete event system is blocking. Counterexamples are an important feature of model checking that explains the cause of a detected problem, greatly helping users to understand and fix faults. In compositional verification, counterexamples are difficult to compute due to the large state space and the loss of information after abstraction. The paper explains the difficulties and proposes solutions, and experimental results show that counterexamples can be computed successfully for several industrial-scale systems.

中文翻译：

---

组合非阻塞验证中反例的计算

本文描述了在组合非阻塞验证确定离散事件系统正在阻塞时计算反例的算法。反例是模型检查的一个重要功能，可以解释检测到的问题的原因，极大地帮助用户理解和修复故障。在组合验证中，由于状态空间大，抽象后信息丢失，反例很难计算。论文解释了困难并提出了解决方案，实验结果表明可以成功计算多个工业规模系统的反例。