ATWin: An Improved and Detailed Startup Model of TTP/C
TTP/C (Time-Triggered Protocol Class C) is a mainstream communication protocol commonly utilized in cyber–physical systems within the aerospace and automotive industry. Unfortunately, when it comes to the startup model, there are three issues in the standard of TTP/C (namely AS6003). Firstly, AS6003...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-05-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/13/9/5607 |
| _version_ | 1797602971605794816 |
|---|---|
| author | Tingting Yang Xudong Sun Baoyue Yan Chao Tong |
| author_facet | Tingting Yang Xudong Sun Baoyue Yan Chao Tong |
| author_sort | Tingting Yang |
| collection | DOAJ |
| description | TTP/C (Time-Triggered Protocol Class C) is a mainstream communication protocol commonly utilized in cyber–physical systems within the aerospace and automotive industry. Unfortunately, when it comes to the startup model, there are three issues in the standard of TTP/C (namely AS6003). Firstly, AS6003 only mentions a high-level specification, which leads to a gap between the standard and its implementation. Secondly, the standard startup model in AS6003 aggressively handles the multi-clique problem by dropping the first valid frame unconditionally without a contention-detecting mechanism, resulting in additional time consumption in some types of contention scenarios. At last, there is lack of the formal verification for the validity of the standard startup model with an arbitrary number of nodes and the formal derivation of its upper bound of startup time. To address these limitations, we propose a detailed and improved startup model named ATWin based on AS6003. It not only bridges the gap between the top-level standard and its implementation by supplementing the undefined details, but it also enhances the efficiency of the startup time by adding a contention-detecting strategy to the standard startup model. The ATWin model is developed as an open-source implementation for TTP/C’s startup. We also formally demonstrate the validity of ATWin and deduce its upper bound of startup time with an arbitrary number of nodes in this paper. |
| first_indexed | 2024-03-11T04:23:13Z |
| format | Article |
| id | doaj.art-6183b082b9bc4c3a8476ad7e24ffdd73 |
| institution | Directory Open Access Journal |
| issn | 2076-3417 |
| language | English |
| last_indexed | 2024-03-11T04:23:13Z |
| publishDate | 2023-05-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Applied Sciences |
| spelling | doaj.art-6183b082b9bc4c3a8476ad7e24ffdd732023-11-17T22:36:22ZengMDPI AGApplied Sciences2076-34172023-05-01139560710.3390/app13095607ATWin: An Improved and Detailed Startup Model of TTP/CTingting Yang0Xudong Sun1Baoyue Yan2Chao Tong3School of Computer Science and Engineering, Beihang University, Beijing 100191, ChinaSchool of Computer Science and Engineering, Beihang University, Beijing 100191, ChinaSchool of Computer Science and Engineering, Beihang University, Beijing 100191, ChinaSchool of Computer Science and Engineering, Beihang University, Beijing 100191, ChinaTTP/C (Time-Triggered Protocol Class C) is a mainstream communication protocol commonly utilized in cyber–physical systems within the aerospace and automotive industry. Unfortunately, when it comes to the startup model, there are three issues in the standard of TTP/C (namely AS6003). Firstly, AS6003 only mentions a high-level specification, which leads to a gap between the standard and its implementation. Secondly, the standard startup model in AS6003 aggressively handles the multi-clique problem by dropping the first valid frame unconditionally without a contention-detecting mechanism, resulting in additional time consumption in some types of contention scenarios. At last, there is lack of the formal verification for the validity of the standard startup model with an arbitrary number of nodes and the formal derivation of its upper bound of startup time. To address these limitations, we propose a detailed and improved startup model named ATWin based on AS6003. It not only bridges the gap between the top-level standard and its implementation by supplementing the undefined details, but it also enhances the efficiency of the startup time by adding a contention-detecting strategy to the standard startup model. The ATWin model is developed as an open-source implementation for TTP/C’s startup. We also formally demonstrate the validity of ATWin and deduce its upper bound of startup time with an arbitrary number of nodes in this paper.https://www.mdpi.com/2076-3417/13/9/5607TTP/Cstartupthe multi-clique problemupper bounds of startup timeimplementation |
| spellingShingle | Tingting Yang Xudong Sun Baoyue Yan Chao Tong ATWin: An Improved and Detailed Startup Model of TTP/C Applied Sciences TTP/C startup the multi-clique problem upper bounds of startup time implementation |
| title | ATWin: An Improved and Detailed Startup Model of TTP/C |
| title_full | ATWin: An Improved and Detailed Startup Model of TTP/C |
| title_fullStr | ATWin: An Improved and Detailed Startup Model of TTP/C |
| title_full_unstemmed | ATWin: An Improved and Detailed Startup Model of TTP/C |
| title_short | ATWin: An Improved and Detailed Startup Model of TTP/C |
| title_sort | atwin an improved and detailed startup model of ttp c |
| topic | TTP/C startup the multi-clique problem upper bounds of startup time implementation |
| url | https://www.mdpi.com/2076-3417/13/9/5607 |
| work_keys_str_mv | AT tingtingyang atwinanimprovedanddetailedstartupmodelofttpc AT xudongsun atwinanimprovedanddetailedstartupmodelofttpc AT baoyueyan atwinanimprovedanddetailedstartupmodelofttpc AT chaotong atwinanimprovedanddetailedstartupmodelofttpc |