arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.25682cs.LOmath.AT
收藏

关于在HOL中网络拓扑矩阵形式化的研究

On the Formalization of Network Topology Matrices in HOL

School of Electrical Engineering and Computer Science(电气与计算机工程学院);Concordia University, Montreal, QC, Canada(康考迪亚大学);National University of Sciences and Technology, Islamabad, Pakistan(国立科学与技术大学)

Kubra Aksoy, Adnan Rashid, Osman Hasan, Sofiene Tahar

AI总结:

本文利用HOL交互式定理证明形式化网络拓扑矩阵,验证其性质并分析电路中的Kron缩减和总功率耗散。

摘要:

网络拓扑矩阵是图的代数表示,广泛应用于电气电路、通信网络和交通系统等模型分析中。本文提出使用基于高阶逻辑(HOL)的交互式定理证明来形式化网络拓扑矩阵。特别地,在Isabelle/HOL证明助手中形式化了邻接、度数、拉普拉斯和接触矩阵。我们的形式化基于将系统建模为网络,使用有向图(无权和有权)的概念,其中节点作为系统的组件,加权边捕捉它们之间的连接。然后,我们正式验证了这些矩阵的各种经典属性,如索引和度数。我们还证明了这些矩阵之间的关系,以提供全面的形式推理支持,用于分析使用网络拓扑矩阵建模的系统。为了说明所提出方法的有效性,我们正式分析了拉普拉斯矩阵的Kron缩减,并验证了通用电阻电路中的总功率耗散,这两种方法常用于功率流分析。

英文摘要:

Network topology matrices are algebraic representations of graphs that are widely used in modeling and analysis of various applications including electrical circuits, communication networks and transportation systems. In this paper, we propose to use Higher-Order-Logic (HOL) based interactive theorem proving to formalize network topology matrices. In particular, we formalize adjacency, degree, Laplacian and incidence matrices in the Isabelle/HOL proof assistant. Our formalization is based on modelling systems as networks using the notion of directed graphs (unweighted and weighted), where nodes act as components of the system and weighted edges capture the interconnection between them. Then, we formally verify various classical properties of these matrices, such as indexing and degree. We also prove the relationships between these matrices in order to provide a comprehensive formal reasoning support for analyzing systems modeled using network topology matrices. To illustrate the effectiveness of the proposed approach, we formally analyze the Kron reduction of the Laplacian matrix and verify the total power dissipation in a generic resistive electrical network, both commonly used in power flow analysis.

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

↑