This article deals with improved formal verification of reconfigurable discrete-event systems (DESs) modeled by reconfigurable timed net condition event systems (R-TNCESs). An R-TNCES consists of a set of timed net condition event systems, each of which represents a particular behavior of a DES, and a reconfiguration scenario is a switching mode from a timed net condition event system to another. However, the verification with the classical computation tree logic (CTL) as well as the related extensions increases the number of properties for complete verification of a complex R-TNCES. We propose reconfigurable CTL as a new extension of CTL to reduce such a number. New connectors of reconfigurable CTL are proposed, with their formal syntax and semantics, and a set of new algorithms is proposed to control the complexity of model checking. We use a benchmark production system for the performance evaluation of the proposed approach. Reduction in the number of properties to be checked is shown, and consequently, the related validation time is reduced. Note to Practitioners—This research represents a new orientation for guiding efficiently the model checking of reconfigurable discrete-event systems. A classification of properties described in computation tree logic (CTL), according to their dominance and equivalence relations, allows one to conduct an efficient verification by avoiding inefficient calculation due to redundant properties. In this case, giving a verification order for these properties allows one to shorten their verification time. An extension named reconfigurable CTL describes the new syntax of the proposed classification. This approach can be applied in modeling and verification of advanced reconfigurable systems arising from smart grids, adaptive sensor networks, intelligent transportation, reconfigurable manufacturing, and embedded systems.

中文翻译：

---

RCTL：用于改进可重构离散事件系统形式验证的新时态逻辑


本文讨论由可重构定时网络条件事件系统 (R-TNCES) 建模的可重构离散事件系统 (DES) 的改进形式验证。 R-TNCES由一组定时网络状况事件系统组成，每个定时网络状况事件系统代表DES的特定行为，并且重新配置场景是从定时网络状况事件系统到另一个定时网络状况事件系统的切换模式。然而，使用经典计算树逻辑（CTL）以及相关扩展的验证增加了复杂 R-TNCES 完整验证的属性数量。我们提出可重构 CTL 作为 CTL 的新扩展，以减少这样的数量。提出了可重构CTL的新连接器及其形式语法和语义，并提出了一组新算法来控制模型检查的复杂性。我们使用基准生产系统来评估所提出方法的性能。显示出要检查的属性数量的减少，因此，相关的验证时间也减少了。从业者须知——这项研究代表了有效指导可重构离散事件系统模型检查的新方向。计算树逻辑（CTL）中描述的属性根据其支配关系和等价关系进行分类，允许通过避免由于冗余属性而导致的低效计算来进行有效的验证。在这种情况下，对这些属性发出验证命令可以缩短其验证时间。名为可重新配置 CTL 的扩展描述了所提出的分类的新语法。 该方法可应用于智能电网、自适应传感器网络、智能交通、可重构制造和嵌入式系统等先进可重构系统的建模和验证。