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
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.
Munkres' General Topology Autoformalized in Isabelle/HOL
Independent(独立研究者);Aalborg University(奥尔堡大学);University of Melbourne(墨尔本大学);AI4REASON and University of Gothenburg / Chalmers University(AI4REASON 和哥德堡大学 / 查尔姆斯理工大学)
Formalization of Fragments of the Theory of Hereditarily Finite Sets
Institute of Computer Science of the Czech Academy of Sciences(捷克科学院计算机科学研究所);Faculty of Mathematics and Physics, Charles University, Prague(布拉格查理大学数学与物理学院)