Muhammad Adnan, Jean-Luc Scharbarg, Jérôme Ermont, C. Fraboul
{"title":"Model for worst case delay analysis of an AFDX network using timed automata","authors":"Muhammad Adnan, Jean-Luc Scharbarg, Jérôme Ermont, C. Fraboul","doi":"10.1109/ETFA.2010.5641124","DOIUrl":null,"url":null,"abstract":"AFDX (Avionics Full Duplex Switched Ethernet) standardized as ARINC 664 is a major upgrade for avionics systems. But guarantees on upper bounds of end-to-end communication delays are required for certification purposes. The objective of this paper is to present an improved modeling approach using timed automata for calculation of exact worst case delays. This approach takes advantage of local scheduling of flows. Moreover, it can cope with larger network configurations than existing approaches based on timed automata, thanks to a port by port analysis which reduces the search space.","PeriodicalId":201440,"journal":{"name":"2010 IEEE 15th Conference on Emerging Technologies & Factory Automation (ETFA 2010)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"30","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 15th Conference on Emerging Technologies & Factory Automation (ETFA 2010)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ETFA.2010.5641124","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 30
Abstract
AFDX (Avionics Full Duplex Switched Ethernet) standardized as ARINC 664 is a major upgrade for avionics systems. But guarantees on upper bounds of end-to-end communication delays are required for certification purposes. The objective of this paper is to present an improved modeling approach using timed automata for calculation of exact worst case delays. This approach takes advantage of local scheduling of flows. Moreover, it can cope with larger network configurations than existing approaches based on timed automata, thanks to a port by port analysis which reduces the search space.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
