通过对偶学习余代数
Coalgebra Learning via Duality
摘要:
自动机学习是一种通过成员关系和等价查询来推断最小自动机的流行技术。在本文中,我们将学习推广到余代数理论。该方法依赖于使用逻辑公式作为测试,基于状态和逻辑理论之间的双重附加。这使我们能够学习,例如,标记的过渡系统,使用Hennessy-Milner逻辑。我们的主要贡献是一个抽象的学习算法,连同证明的正确性和终止。
英文摘要:
Automata learning is a popular technique for inferring minimal automata through membership and equivalence queries. In this paper, we generalise learning to the theory of coalgebras. The approach relies on the use of logical formulas as tests, based on a dual adjunction between states and logical theories. This allows us to learn, e.g., labelled transition systems, using Hennessy-Milner logic. Our main contribution is an abstract learning algorithm, together with a proof of correctness and termination.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。