Pub Date : 2022-12-01DOI: 10.1109/QRS-C57518.2022.00101
Shuhao Wang, Zhuoru Lin, Zhimo Weng, Anna Li
This paper proposes a mapping method of 2D image and 3D spatial data based on the adversarial relative depth constraint network. The steps are as follows: 1) Input pixel coordinates of key nodes of 2D landscape image, and conduct normalization preprocessing; 2) Input two-dimensional pixel coordinates into the depth prediction network and output the depth values of key nodes; 3) Using depth values and two-dimensional pixel coordinates to reconstruct three-dimensional coordinates of key nodes; 4) Input DEM data to the discriminator of the generated adversarial network to calculate the authenticity error value, and use the relative depth information between the attitude characteristics of mountain and hydrology and the corresponding key nodes of the image to calculate the relative depth error; 5) Add the authenticity error and relative depth error calculated above to get the total error, and feed back to the depth prediction network to get a more accurate mapping evaluation, so as to realize mapping discovery. The problems solved in this paper include: lack of characteristic pose data in the traditional geo-evidence-based process of 2D landscape images; The results of the generative adversarial network method do not conform to the relative depth relationship of feature points in 3D spatial data.
{"title":"Mapping Method between 2D Landscape Image and 3D Spatial Data based on Adversarial Relative Depth Constraint Network","authors":"Shuhao Wang, Zhuoru Lin, Zhimo Weng, Anna Li","doi":"10.1109/QRS-C57518.2022.00101","DOIUrl":"https://doi.org/10.1109/QRS-C57518.2022.00101","url":null,"abstract":"This paper proposes a mapping method of 2D image and 3D spatial data based on the adversarial relative depth constraint network. The steps are as follows: 1) Input pixel coordinates of key nodes of 2D landscape image, and conduct normalization preprocessing; 2) Input two-dimensional pixel coordinates into the depth prediction network and output the depth values of key nodes; 3) Using depth values and two-dimensional pixel coordinates to reconstruct three-dimensional coordinates of key nodes; 4) Input DEM data to the discriminator of the generated adversarial network to calculate the authenticity error value, and use the relative depth information between the attitude characteristics of mountain and hydrology and the corresponding key nodes of the image to calculate the relative depth error; 5) Add the authenticity error and relative depth error calculated above to get the total error, and feed back to the depth prediction network to get a more accurate mapping evaluation, so as to realize mapping discovery. The problems solved in this paper include: lack of characteristic pose data in the traditional geo-evidence-based process of 2D landscape images; The results of the generative adversarial network method do not conform to the relative depth relationship of feature points in 3D spatial data.","PeriodicalId":183728,"journal":{"name":"2022 IEEE 22nd International Conference on Software Quality, Reliability, and Security Companion (QRS-C)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133255619","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-12-01DOI: 10.1109/QRS-C57518.2022.00118
K. Cai
In response to the advent of software defined world, this Fast Abstract introduces a new notion, information gravitation, with an attempt to unify and expand two related ones, information mass (related to the supposed fifth force) and data gravitation. This is motivated by the following question: is there a new kind of (gravitational) force between any two distinct pieces of information conveying messages. A possibly affirmative answer to this question of information gravitation, which is supposed to explore the theoretically and/or experimentally justified interplay between information and gravitation, might make significant sense for the software defined world being augmented with artificial intelligence and virtual reality in the age of information. Information induces gravitation. Information gravitation should be related to Newton's law of universal gravitation and Einstein's general theory of relativity, and even to gravitational waves and the unified theory of everything.
{"title":"Towards Research on Information Gravitation","authors":"K. Cai","doi":"10.1109/QRS-C57518.2022.00118","DOIUrl":"https://doi.org/10.1109/QRS-C57518.2022.00118","url":null,"abstract":"In response to the advent of software defined world, this Fast Abstract introduces a new notion, information gravitation, with an attempt to unify and expand two related ones, information mass (related to the supposed fifth force) and data gravitation. This is motivated by the following question: is there a new kind of (gravitational) force between any two distinct pieces of information conveying messages. A possibly affirmative answer to this question of information gravitation, which is supposed to explore the theoretically and/or experimentally justified interplay between information and gravitation, might make significant sense for the software defined world being augmented with artificial intelligence and virtual reality in the age of information. Information induces gravitation. Information gravitation should be related to Newton's law of universal gravitation and Einstein's general theory of relativity, and even to gravitational waves and the unified theory of everything.","PeriodicalId":183728,"journal":{"name":"2022 IEEE 22nd International Conference on Software Quality, Reliability, and Security Companion (QRS-C)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133371265","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-12-01DOI: 10.1109/QRS-C57518.2022.00074
Yuegui Feng, Guangwei Qing, Qianfei Zhou
Elevator failure is a common problem scenario in real life, and arranging reasonable maintenance site locations is crucial to reduce the time to repair elevators. However, reasonable site selection for large-scale datasets remains a challenge in the present time. Considering the nature of clustering models that may naturally fit the requirements of the siting problem, we propose a siting method called Fine-tune K-means which called FTK-means. This approach is based on the K-means clustering method and fine-tunes the initial clustering results. It is worth mentioning that we take into account the fault properties of elevators and use the concept of fault center of mass when finding the mean value. Experiments prove that our method achieves better site selection on real elevator datasets, and in addition achieves site load fairness.
{"title":"Elevator Maintenance Site Selection Optimization via Fine-Tuned K-Means","authors":"Yuegui Feng, Guangwei Qing, Qianfei Zhou","doi":"10.1109/QRS-C57518.2022.00074","DOIUrl":"https://doi.org/10.1109/QRS-C57518.2022.00074","url":null,"abstract":"Elevator failure is a common problem scenario in real life, and arranging reasonable maintenance site locations is crucial to reduce the time to repair elevators. However, reasonable site selection for large-scale datasets remains a challenge in the present time. Considering the nature of clustering models that may naturally fit the requirements of the siting problem, we propose a siting method called Fine-tune K-means which called FTK-means. This approach is based on the K-means clustering method and fine-tunes the initial clustering results. It is worth mentioning that we take into account the fault properties of elevators and use the concept of fault center of mass when finding the mean value. Experiments prove that our method achieves better site selection on real elevator datasets, and in addition achieves site load fairness.","PeriodicalId":183728,"journal":{"name":"2022 IEEE 22nd International Conference on Software Quality, Reliability, and Security Companion (QRS-C)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126063104","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-12-01DOI: 10.1109/QRS-C57518.2022.00113
Tse-Chuan Hsu, William C. Chu, Shyh-Wei Chen
The combination of learning analysis technology and terminal equipment can provide a rapidly imitating learning method between devices, and cognitive intelligence affects the learning effect. To enhance automated learning services, we can use federated learning methods to enable the training of different devices and enhance each other through devices. Using the training database to improve the quality of automated learning services. In this study, a novel agent-assisted active detection and data collection framework is designed. Monitoring agents can learn from each other to establish intelligent models, and through mutual communication between devices. Can check if established data can be applied to machine data model to get data. It can be used for intelligent manufacturing in the future. The agent may learn methods of learning and managing between devices having different properties. Obtaining experimental simulation and control data, and using machine learning to analyze growth progress and results allow for a deeper analysis of associated adjustments and anticipated changes.
{"title":"The IoT Service Agent Model based on Federated Learning to Improve Service Quality","authors":"Tse-Chuan Hsu, William C. Chu, Shyh-Wei Chen","doi":"10.1109/QRS-C57518.2022.00113","DOIUrl":"https://doi.org/10.1109/QRS-C57518.2022.00113","url":null,"abstract":"The combination of learning analysis technology and terminal equipment can provide a rapidly imitating learning method between devices, and cognitive intelligence affects the learning effect. To enhance automated learning services, we can use federated learning methods to enable the training of different devices and enhance each other through devices. Using the training database to improve the quality of automated learning services. In this study, a novel agent-assisted active detection and data collection framework is designed. Monitoring agents can learn from each other to establish intelligent models, and through mutual communication between devices. Can check if established data can be applied to machine data model to get data. It can be used for intelligent manufacturing in the future. The agent may learn methods of learning and managing between devices having different properties. Obtaining experimental simulation and control data, and using machine learning to analyze growth progress and results allow for a deeper analysis of associated adjustments and anticipated changes.","PeriodicalId":183728,"journal":{"name":"2022 IEEE 22nd International Conference on Software Quality, Reliability, and Security Companion (QRS-C)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122018082","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-12-01DOI: 10.1109/QRS-C57518.2022.00020
M. Méré, F. Jouault, Loïc Pallardy, R. Perdriau
Nowadays, System-on-Chip (SoC) components are found everywhere in all kinds of smart devices. Each System-on-Chip contains many different blocks that provide specific functionalities, such as WiFi or Bluetooth connectivity. Whereas integrating each such block in a SoC typically requires paying some royalties, not all blocks are necessary for all applications, or throughout a device's lifecycle. Moreover, it is not possible to manufacture a specific SoC for each application. Significant advantages are therefore expected to be gained by enabling trustworthy remote SoC reconfiguration throughout their life cycles. A few approaches attempting to address this challenge have been proposed in the literature. They are typically based on Blockchain technology in order to support decentralization without relinquishing trust. Reviewing these approaches lead us to identify a potential flaw in the proposed protocols. Indeed, a SoC should be able to trust Blockchain information that it is given, without requiring any centralization. In order to validate our suspicions, we propose in this paper to use Verifpal: a cryptographic protocol verification tool that works from textual protocol models. We use it in a slightly unorthodox way in order to model the trust relationships in one of the approaches from the literature, and to verify it. The results show that, under some assumptions, a flaw is indeed present. We propose and model several possible fixes, and present their respective limitations.
{"title":"Modeling Trust Relationships in Blockchain Applications: The Case of Reconfigurable Systems-on-Chip","authors":"M. Méré, F. Jouault, Loïc Pallardy, R. Perdriau","doi":"10.1109/QRS-C57518.2022.00020","DOIUrl":"https://doi.org/10.1109/QRS-C57518.2022.00020","url":null,"abstract":"Nowadays, System-on-Chip (SoC) components are found everywhere in all kinds of smart devices. Each System-on-Chip contains many different blocks that provide specific functionalities, such as WiFi or Bluetooth connectivity. Whereas integrating each such block in a SoC typically requires paying some royalties, not all blocks are necessary for all applications, or throughout a device's lifecycle. Moreover, it is not possible to manufacture a specific SoC for each application. Significant advantages are therefore expected to be gained by enabling trustworthy remote SoC reconfiguration throughout their life cycles. A few approaches attempting to address this challenge have been proposed in the literature. They are typically based on Blockchain technology in order to support decentralization without relinquishing trust. Reviewing these approaches lead us to identify a potential flaw in the proposed protocols. Indeed, a SoC should be able to trust Blockchain information that it is given, without requiring any centralization. In order to validate our suspicions, we propose in this paper to use Verifpal: a cryptographic protocol verification tool that works from textual protocol models. We use it in a slightly unorthodox way in order to model the trust relationships in one of the approaches from the literature, and to verify it. The results show that, under some assumptions, a flaw is indeed present. We propose and model several possible fixes, and present their respective limitations.","PeriodicalId":183728,"journal":{"name":"2022 IEEE 22nd International Conference on Software Quality, Reliability, and Security Companion (QRS-C)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126176280","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-12-01DOI: 10.1109/QRS-C57518.2022.00125
Jiahao He, Dongyu Cao, Ying Zhou
Auctions are particularly favored as a means of financial transaction for high-value commodities. The Turing-complete script provided by the Ethereum platform facilitates different types of auctions. However, the transparency of Ethereum may lead to threats to the privacy of financial transactions, which is also the biggest obstacle to the practical application of blockchain. This paper proposes an auction contract privacy protection method named TrustAuction, which protects the transaction data privacy and user identity privacy in the auction process through the Trusted Execution Environment(TEE). Specifically, TEE is used to generate new identities for users in the auction process, and the bids submitted by users using the new identities exist are encrypted outside the TEE.
{"title":"TrustAuction: A TEE based Privacy Protection Framework for Auction Contracts","authors":"Jiahao He, Dongyu Cao, Ying Zhou","doi":"10.1109/QRS-C57518.2022.00125","DOIUrl":"https://doi.org/10.1109/QRS-C57518.2022.00125","url":null,"abstract":"Auctions are particularly favored as a means of financial transaction for high-value commodities. The Turing-complete script provided by the Ethereum platform facilitates different types of auctions. However, the transparency of Ethereum may lead to threats to the privacy of financial transactions, which is also the biggest obstacle to the practical application of blockchain. This paper proposes an auction contract privacy protection method named TrustAuction, which protects the transaction data privacy and user identity privacy in the auction process through the Trusted Execution Environment(TEE). Specifically, TEE is used to generate new identities for users in the auction process, and the bids submitted by users using the new identities exist are encrypted outside the TEE.","PeriodicalId":183728,"journal":{"name":"2022 IEEE 22nd International Conference on Software Quality, Reliability, and Security Companion (QRS-C)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129684655","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-12-01DOI: 10.1109/QRS-C57518.2022.00132
Shengran Wang, Jinfu Chen, Saihua Cai, Chi Zhang, Haibo Chen
Coverage-guided Greybox Fuzzing (CGF) as a popular testing approach has been widely used in software testing. However, the existing CGF has some problems, for example, the testing efficiency is often poor in the face of structured input. To solve this problem, Grammar-Aware Greybox Fuzzing (GAGF) has gained attention for its use of abstract syntax trees (AST) to help processing the structured inputs and it has achieved higher fuzzing efficiency than CGF. However, the improvement of efficiency may not be enough. Therefore, we proposed a particle swarm optimization algorithm to help GAGF to further improving the efficiency. The proposed algorithm can selectively optimize the mutation operator in GAGF mutation stage, as well as accelerate the mutation efficiency of fuzzing to achieve more higher code coverage.
{"title":"A Novel Coverage-Guided Greybox Fuzzing Method based on Grammar-Aware with Particle Swarm Optimization","authors":"Shengran Wang, Jinfu Chen, Saihua Cai, Chi Zhang, Haibo Chen","doi":"10.1109/QRS-C57518.2022.00132","DOIUrl":"https://doi.org/10.1109/QRS-C57518.2022.00132","url":null,"abstract":"Coverage-guided Greybox Fuzzing (CGF) as a popular testing approach has been widely used in software testing. However, the existing CGF has some problems, for example, the testing efficiency is often poor in the face of structured input. To solve this problem, Grammar-Aware Greybox Fuzzing (GAGF) has gained attention for its use of abstract syntax trees (AST) to help processing the structured inputs and it has achieved higher fuzzing efficiency than CGF. However, the improvement of efficiency may not be enough. Therefore, we proposed a particle swarm optimization algorithm to help GAGF to further improving the efficiency. The proposed algorithm can selectively optimize the mutation operator in GAGF mutation stage, as well as accelerate the mutation efficiency of fuzzing to achieve more higher code coverage.","PeriodicalId":183728,"journal":{"name":"2022 IEEE 22nd International Conference on Software Quality, Reliability, and Security Companion (QRS-C)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122851493","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-12-01DOI: 10.1109/QRS-C57518.2022.00040
Qiliang Yang, Lizhi Cai, Jiayu Gong, Minlu Tang, Yi Lin
The central management platforms in traditional crowd-sourced software testing networks are easy to become the target of attack by the enemies, and when the central management platform is attacked, it is easy to cause a single point of failure and bring the whole system down. In addition, when selecting software testing engineers for crowd-sourcing software testing tasks, most mechanisms select engineers based on their credits. This approach is too one-sided and fails to achieve fine-grained engineer selection. In order to solve above problems, we have proposed a non-interactive and fine-grained crowd-sourcing software testing engineer selection mechanism. In our mechanism, the task publisher can select engineers according to their attributes. Next, we have given an implementation of our non-interactive software testing engineer selection mechanism by applying QAP. The privacy of task publisher and engineers is protected. The security proof is also given. Simulation results show that our mechanism is feasible.
{"title":"Attribute-Based Non-Interactive Privacy-Protected Crowd-Sourcing Software Testing Engineer Selection Mechanism","authors":"Qiliang Yang, Lizhi Cai, Jiayu Gong, Minlu Tang, Yi Lin","doi":"10.1109/QRS-C57518.2022.00040","DOIUrl":"https://doi.org/10.1109/QRS-C57518.2022.00040","url":null,"abstract":"The central management platforms in traditional crowd-sourced software testing networks are easy to become the target of attack by the enemies, and when the central management platform is attacked, it is easy to cause a single point of failure and bring the whole system down. In addition, when selecting software testing engineers for crowd-sourcing software testing tasks, most mechanisms select engineers based on their credits. This approach is too one-sided and fails to achieve fine-grained engineer selection. In order to solve above problems, we have proposed a non-interactive and fine-grained crowd-sourcing software testing engineer selection mechanism. In our mechanism, the task publisher can select engineers according to their attributes. Next, we have given an implementation of our non-interactive software testing engineer selection mechanism by applying QAP. The privacy of task publisher and engineers is protected. The security proof is also given. Simulation results show that our mechanism is feasible.","PeriodicalId":183728,"journal":{"name":"2022 IEEE 22nd International Conference on Software Quality, Reliability, and Security Companion (QRS-C)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124002164","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-12-01DOI: 10.1109/QRS-C57518.2022.00124
Hao Yin, Dongyu Cao, Ying Zhou
With the wide application of blockchain technology, the user privacy information involved in Ethereum is increasingly rich. But with the introduction of de-anonymization technologies, more and more attacks may lead to the disclosure of user privacy information. In this paper, as a user privacy protection approach, RandomMix is proposed based on account mixing and transaction value encryption. We conduct experiments on the real transactions on Ethereum and find out that RandomMix can resist account clustering attack, transaction fingerprint analysis attack and Sybil attack. Meanwhile, RandomMix consume less gas compared with other approaches.
{"title":"RandomMix: An Effective Framework to Protect User Privacy Information on Ethereum","authors":"Hao Yin, Dongyu Cao, Ying Zhou","doi":"10.1109/QRS-C57518.2022.00124","DOIUrl":"https://doi.org/10.1109/QRS-C57518.2022.00124","url":null,"abstract":"With the wide application of blockchain technology, the user privacy information involved in Ethereum is increasingly rich. But with the introduction of de-anonymization technologies, more and more attacks may lead to the disclosure of user privacy information. In this paper, as a user privacy protection approach, RandomMix is proposed based on account mixing and transaction value encryption. We conduct experiments on the real transactions on Ethereum and find out that RandomMix can resist account clustering attack, transaction fingerprint analysis attack and Sybil attack. Meanwhile, RandomMix consume less gas compared with other approaches.","PeriodicalId":183728,"journal":{"name":"2022 IEEE 22nd International Conference on Software Quality, Reliability, and Security Companion (QRS-C)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115357224","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-12-01DOI: 10.1109/QRS-C57518.2022.00073
Wenjia Long, Kaizhi Wang, Xuan Wang
The computer-based interlocking (CBI) system of urban rail is a safe-critical system. To keep the high reliability of the CBI system of urban rail, reliability analysis is very necessary and important work. The double 2-out-of-2 redun-dancy structure has been widely used in the CBI system which is a core part of control signal equipment in urban rail. The dynamic fault tree (DFT) is an extension of the static fault tree (SFT), which is widely used for the reliability modeling of dynamic systems. An algebraic binary decision diagram (ABDD) is an extension of a binary decision diagram (BDD) which introduces a kind of node denoting a sequence-dependency between events. The DFT can be evaluated by the ABDD. This paper firstly presents a reliability analysis of the CBI system in urban rail by using the ABDD-based method. The CBI system is modeled by the DFT, then the DFT is converted into a function based on a temporal algebraic framework. According to the temporal function, the ABDD can be built for reliability analysis. Compared to the Markov-based method, the ABDD-based method can avoid space-state explosion and have no limitation on the exponential distribution of component failure. A case study related to the CBI system is presented to show the advantage of using our method.
{"title":"Reliability Analysis of a Computer-Based Interlocking System with a Double 2-out-of-2 Redundancy Structure using Algebraic Binary Decision Diagrams","authors":"Wenjia Long, Kaizhi Wang, Xuan Wang","doi":"10.1109/QRS-C57518.2022.00073","DOIUrl":"https://doi.org/10.1109/QRS-C57518.2022.00073","url":null,"abstract":"The computer-based interlocking (CBI) system of urban rail is a safe-critical system. To keep the high reliability of the CBI system of urban rail, reliability analysis is very necessary and important work. The double 2-out-of-2 redun-dancy structure has been widely used in the CBI system which is a core part of control signal equipment in urban rail. The dynamic fault tree (DFT) is an extension of the static fault tree (SFT), which is widely used for the reliability modeling of dynamic systems. An algebraic binary decision diagram (ABDD) is an extension of a binary decision diagram (BDD) which introduces a kind of node denoting a sequence-dependency between events. The DFT can be evaluated by the ABDD. This paper firstly presents a reliability analysis of the CBI system in urban rail by using the ABDD-based method. The CBI system is modeled by the DFT, then the DFT is converted into a function based on a temporal algebraic framework. According to the temporal function, the ABDD can be built for reliability analysis. Compared to the Markov-based method, the ABDD-based method can avoid space-state explosion and have no limitation on the exponential distribution of component failure. A case study related to the CBI system is presented to show the advantage of using our method.","PeriodicalId":183728,"journal":{"name":"2022 IEEE 22nd International Conference on Software Quality, Reliability, and Security Companion (QRS-C)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115833951","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：