arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.05701cs.FL
收藏

通过因子系统和示例探讨极小性概念

Minimality Notions via Factorization Systems and Examples

Radboud University(拉德堡德大学)

Thorsten Wißmann

AI总结:

本文通过因子系统探讨极小性概念,提出通用范畴中的极小化准则,并在自动机最小化中展示其应用。

摘要:

对于基于状态的系统(即在保持系统语义的前提下减少状态数量)的最小化,有两个显而易见的方面:移除系统中的冗余状态和合并冗余状态。在本文中,我们通过定义一个抽象的极小性概念,将这两个最小化方面联系起来。抽象的极小性和最小化概念存在于具有因子系统的通用范畴中。我们将找到确保极小化方面唯一性、存在性和函子性的范畴的准则。这些结果的证明在标准余代数文献中实例化为可达性和可观测性最小化的结果。最后,我们将看到最小化两个方面的相互作用以及在何种条件下它们可以以任意顺序进行,如同在自动机最小化中。

英文摘要:

For the minimization of state-based systems (i.e. the reduction of the number of states while retaining the system's semantics), there are two obvious aspects: removing unnecessary states of the system and merging redundant states in the system. In the present article, we relate the two minimization aspects on coalgebras by defining an abstract notion of minimality. The abstract notions minimality and minimization live in a general category with a factorization system. We will find criteria on the category that ensure uniqueness, existence, and functoriality of the minimization aspects. The proofs of these results instantiate to those for reachability and observability minimization in the standard coalgebra literature. Finally, we will see how the two aspects of minimization interact and under which criteria they can be sequenced in any order, like in automata minimization.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑