Consistent reduction in discrete-event systems
Consistent reduction in discrete-event systems
复制标题
离散事件系统的持续减少
DOI：
10.1016/j.automatica.2022.110333
复制
发表时间：
2022
期刊：
影响因子：
6.4
通讯作者：
Seatzu Carla
中科院分区：
文献类型：
--
作者：
Cai Kai;Giua Alessandro;Seatzu Carla
在本文中，我们开发了一个通用的框架，称为“一致的减少”，形式化和解决一类状态最小化/减少问题的离散事件系统。给定一个任意的有限状态自动机和其状态集上的覆盖，我们提出了一个一致的约简过程，生成一个约简自动机，保留原始自动机的某些特殊性质。一致约化过程的关键概念是动态一致覆盖，在这个覆盖的每个单元中，任何两个状态，以及它们的未来状态通过相同的系统轨迹到达，满足由给定的覆盖导出的二元关系。我们提出了一个新的算法，计算一个动态一致的覆盖，细化一个给定的覆盖。我们展示了在不同的应用领域的状态约简问题的一般框架。
In this paper we develop a general framework, called “consistent reduction”, for formalizing and solving a class of state minimization/reduction problems in discrete-event systems. Given an arbitrary finite-state automaton and a cover on its state set, we propose a consistent reduction procedure that generates a reduced automaton, preserving certain special properties of the original automaton. The key concept of the consistent reduction procedure is thedynamically consistent cover; in each cell of this cover, any two states, as well as their future states reached by the same system trajectories, satisfy the binary relation induced from the given cover. We propose a new algorithm that computes a dynamically consistent cover that refines a given cover. We demonstrate the developed general framework on state reduction problems in different application areas.