{"title":"Model Checking for SpaceWire Link Interface Design Using Uppaal","authors":"Ping Luo, Rui Wang, Xiaojuan Li, Yong Guan, Hongxing Wei, Jie Zhang","doi":"10.1109/COMPSACW.2013.56","DOIUrl":null,"url":null,"abstract":"SpaceWire provides a full-duplex, point-to-point, serial data communication network for on-board applications. This paper presents a Timed Automata approach to modeling, analyzing, and verifying the SpaceWire link interface design. A network of Timed Automata is established to formalize the link interface, including Controller, Transmitter, Receiver, and Channel. Uppaal, a Timed Automata based model checker for real-time system, is adopted for symbolic verification of SpaceWire. The SpaceWire specification requirements are formulated in computational tree logic (CTL). In this way, we have the high-level models of both link ends interacted and verified resorting to Uppaal. It is demonstrated that link initialization can be made successfully within the time scheduled by the requirements of SpaceWire. Furthermore, the paper presents the time properties of the model and makes an analysis of time limitation in the situation that disconnection error occurs.","PeriodicalId":152957,"journal":{"name":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMPSACW.2013.56","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
SpaceWire provides a full-duplex, point-to-point, serial data communication network for on-board applications. This paper presents a Timed Automata approach to modeling, analyzing, and verifying the SpaceWire link interface design. A network of Timed Automata is established to formalize the link interface, including Controller, Transmitter, Receiver, and Channel. Uppaal, a Timed Automata based model checker for real-time system, is adopted for symbolic verification of SpaceWire. The SpaceWire specification requirements are formulated in computational tree logic (CTL). In this way, we have the high-level models of both link ends interacted and verified resorting to Uppaal. It is demonstrated that link initialization can be made successfully within the time scheduled by the requirements of SpaceWire. Furthermore, the paper presents the time properties of the model and makes an analysis of time limitation in the situation that disconnection error occurs.