Graph transformation systems have become a general formal modeling language to describe many models in software development process.Behavioral modeling of dynamic systems and model-to-model transformations are only a ...Graph transformation systems have become a general formal modeling language to describe many models in software development process.Behavioral modeling of dynamic systems and model-to-model transformations are only a few examples in which graphs have been used to software development.But even the perfect graph transformation system must be equipped with automated analysis capabilities to let users understand whether such a formal specification fulfills their requirements.In this paper,we present a new solution to verify graph transformation systems using the Bogor model checker.The attributed graph grammars(AGG)-like graph transformation systems are translated to Bandera intermediate representation(BIR),the input language of Bogor,and Bogor verifies the model against some interesting properties defined by combining linear temporal logic(LTL) and special-purpose graph rules.Experimental results are encouraging,showing that in most cases our solution improves existing approaches in terms of both performance and expressiveness.展开更多
Model checking is an automated formal verification method to verify whether epistemic multi-agent systems adhere to property specifications.Although there is an extensive literature on qualitative properties such as s...Model checking is an automated formal verification method to verify whether epistemic multi-agent systems adhere to property specifications.Although there is an extensive literature on qualitative properties such as safety and liveness,there is still a lack of quantitative and uncertain property verifications for these systems.In uncertain environments,agents must make judicious decisions based on subjective epistemic.To verify epistemic and measurable properties in multi-agent systems,this paper extends fuzzy computation tree logic by introducing epistemic modalities and proposing a new Fuzzy Computation Tree Logic of Knowledge(FCTLK).We represent fuzzy multi-agent systems as distributed knowledge bases with fuzzy epistemic interpreted systems.In addition,we provide a transformation algorithm from fuzzy epistemic interpreted systems to fuzzy Kripke structures,as well as transformation rules from FCTLK formulas to Fuzzy Computation Tree Logic(FCTL)formulas.Accordingly,we transform the FCTLK model checking problem into the FCTL model checking.This enables the verification of FCTLK formulas by using the fuzzy model checking algorithm of FCTL without additional computational overheads.Finally,we present correctness proofs and complexity analyses of the proposed algorithms.Additionally,we further illustrate the practical application of our approach through an example of a train control system.展开更多
A multi-agent based transport system is modeled by timed automata model extended with clock variables. The correctness properties of safety and liveness of this model are verified by timed automata based UPPAAL. Agent...A multi-agent based transport system is modeled by timed automata model extended with clock variables. The correctness properties of safety and liveness of this model are verified by timed automata based UPPAAL. Agents have a degree of control on their own actions, have their own threads of control, and under some circumstances they are also able to take decisions. Therefore they are autonomous. The multi-agent system is modeled as a network of timed automata based agents supported by clock variables. The representation of agent requirements based on mathematics is helpful in precise and unambiguous specifications, thereby ensuring correctness. This formal representation of requirements provides a way for logical reasoning about the artifacts produced. We can be systematic and precise in assessing correctness by rigorously specifying the functional requirements.展开更多
In this paper, the interference checking of three-dimensional objects within a plant is discussed and accomplished, which offers an automated solution to the design problems inherent in multi-user, multi-model environ...In this paper, the interference checking of three-dimensional objects within a plant is discussed and accomplished, which offers an automated solution to the design problems inherent in multi-user, multi-model environments. Also, the collision detection among moving objects is presented and discussed, and some new ideas are proposed. These methods are successfully applied in our Plant Design System (PDS) and are proven to be very practical and efficient.展开更多
In order to find the completeness threshold which offers a practical method of making bounded model checking complete, the over-approximation for the complete threshold is presented. First, a linear logic of knowledge...In order to find the completeness threshold which offers a practical method of making bounded model checking complete, the over-approximation for the complete threshold is presented. First, a linear logic of knowledge is introduced into the past tense operator, and then a new temporal epistemic logic LTLKP is obtained, so that LTLKP can naturally and precisely describe the system＇s reliability. Secondly, a set of prior algorithms are designed to calculate the maximal reachable depth and the length of the longest of loop free paths in the structure based on the graph structure theory. Finally, some theorems are proposed to show how to approximate the complete threshold with the diameter and recurrence diameter. The proposed work resolves the completeness threshold problem so that the completeness of bounded model checking can be guaranteed.展开更多
In time series modeling, the residuals are often checked for white noise and normality. In practice, the useful tests are Ljung Box test. Mcleod Li test and Lin Mudholkar test. In this paper, we present a nonparame...In time series modeling, the residuals are often checked for white noise and normality. In practice, the useful tests are Ljung Box test. Mcleod Li test and Lin Mudholkar test. In this paper, we present a nonparametric approach for checking the residuals of time series models. This approach is based on the maximal correlation coefficient ρ 2 * between the residuals and time t . The basic idea is to use the bootstrap to form the null distribution of the statistic ρ 2 * under the null hypothesis H 0:ρ 2 * =0. For calculating ρ 2 * , we proposes a ρ algorithm, analogous to ACE procedure. Power study shows this approach is more powerful than Ljung Box test. Meanwhile, some numerical results and two examples are reported in this paper.展开更多
Federal Aviation Administration(FAA) and NASA technical reports indicate that the misunderstanding in radiotelephony communications is a primary causal factor associated with operation errors, and a sizable proportion...Federal Aviation Administration(FAA) and NASA technical reports indicate that the misunderstanding in radiotelephony communications is a primary causal factor associated with operation errors, and a sizable proportion of operation errors lead to read-back errors. We introduce deep learning method to solve this problem and propose a new semantic checking model based on Long Short-Time Memory network(LSTM) for intelligent read-back error checking. A meanpooling layer is added to the traditional LSTM, so as to utilize the information obtained by all the hidden activation vectors, and also to improve the robustness of the semantic vector extracted by LSTM. A MultiLayer Perceptron(MLP) layer, which can maintain the information of different regions in the concatenated vectors obtained by the mean-pooling layer, is applied instead of traditional similarity function in the new model to express the semantic similarity of the read-back pairs quantitatively. The K-Nearest Neighbor(KNN) classifier is used to verify whether the read-back pairs are consistent in semantics according to the output of MLP layer. Extensive experiments are conducted and the results show that the proposed model is more effective and more robust than the traditional checking model to verify the semantic consistency of read-backs automatically.展开更多
Ontology is defined as an explicit specification of a conceptualization. In this paper, an extended ontology model was constructed using description logics, which is a 5-tuples including term set, individual set, term...Ontology is defined as an explicit specification of a conceptualization. In this paper, an extended ontology model was constructed using description logics, which is a 5-tuples including term set, individual set, term definition set, instantiation assertion set and term restriction set. Based on the extended model, the issue on ontology checking was studied with the conclusion that the four kinds of term checking, including term satisfiability checking, term subsumption checking, term equivalence checking and term disjointness checking, can be reduced to the satisfiability checking, and satisfiability checking can be transformed into instantiation consistence checking.展开更多
Model checking based on linear temporal logic reduces the false negative rate of misuse detection.However,linear temporal logic formulae cannot be used to describe concurrent attacks and piecewise attacks.So there is ...Model checking based on linear temporal logic reduces the false negative rate of misuse detection.However,linear temporal logic formulae cannot be used to describe concurrent attacks and piecewise attacks.So there is still a high rate of false negatives in detecting these complex attack patterns.To solve this problem,we use interval temporal logic formulae to describe concurrent attacks and piecewise attacks.On this basis,we formalize a novel algorithm for intrusion detection based on model checking interval temporal logic.Compared with the method based on model checking linear temporal logic,the new algorithm can find unknown succinct attacks.The simulation results show that the new method can effectively reduce the false negative rate of concurrent attacks and piecewise attacks.展开更多
In this paper, we focus on the design of irregular QC-LDPC code based multi-level coded modulation(MLCM) scheme by jointly optimizing the component code rate and the degree distribution of the irregular QC-LDPC compon...In this paper, we focus on the design of irregular QC-LDPC code based multi-level coded modulation(MLCM) scheme by jointly optimizing the component code rate and the degree distribution of the irregular QC-LDPC component code. Firstly, the sub-channel capacities of MLCM systems is analyzed and discussed, based on which the optimal component code rate can be obtained. Secondly, an extrinsic information transfer chart based two-stage searching algorithm is proposed to find the good irregular QC-LDPC code ensembles with optimal component code rates for their corresponding sub-channels. Finally, by constructing the irregular QC-LDPC component codes from the designed ensembles with the aim of possibly enlarging the girth and reducing the number of the shortest cycles, the designed irregular QC-LDPC code based 16QAM and 64QAM MLCM systems can achieve 0.4 dB and 1.2 dB net coding gain, respectively, compared with the recently proposed regular QC-LDPC code based 16QAM and 64QAM MLCM systems.展开更多
Reliability enhancement testing(RET) is an accelerated testing which hastens the performance degradation process to surface its inherent defects of design and manufacture. It is an important hypothesis that the degrad...Reliability enhancement testing(RET) is an accelerated testing which hastens the performance degradation process to surface its inherent defects of design and manufacture. It is an important hypothesis that the degradation mechanism of the RET is the same as the one of the normal stress condition. In order to check the consistency of two mechanisms, we conduct two enhancement tests with a missile servo system as an object of the study, and preprocess two sets of test data to establish the accelerated degradation models regarding the temperature change rate that is assumed to be the main applied stress of the servo system during the natural storage. Based on the accelerated degradation models and natural storage profile of the servo system, we provide and demonstrate a procedure to check the consistency of two mechanisms by checking the correlation and difference of two sets of degradation data. The results indicate that the two degradation mechanisms are significantly consistent with each other.展开更多
The dynamics differential equations are constructed, and the initial conditions are also given. Simulation shows the following conclusions： The water pressure in cylinder has great instantaneous pulsation and phase s...The dynamics differential equations are constructed, and the initial conditions are also given. Simulation shows the following conclusions： The water pressure in cylinder has great instantaneous pulsation and phase step when outlet valve or inlet valve opens, but is more gently in other time; The volume efficiency is influenced by the output pressure slightly, and decreases as the working rotational speed increases; When the inherent frequency of the valves is integer multiple of the working frequency, the volume efficiency of system will decrease evidently.展开更多
Abstract Single event upset （SEU） effect, caused by highly energized particles in aerospace, threatens the reliability and security of small satellites composed of commercialofftheshelves （COTS）. SEU induced contr...Abstract Single event upset （SEU） effect, caused by highly energized particles in aerospace, threatens the reliability and security of small satellites composed of commercialofftheshelves （COTS）. SEU induced control flow errors （CFEs） may cause unpredictable behavior or crashes of COTSbased small satellites. This paper proposes a generic softwarebased control flow checking technique （CFC） and bipartite graphbased control flow checking （BGCFC）. To simplify the types of illegal branches, it transforms the conventional control flow graph into the equivalent bipartite graph. It checks the legal ity of control flow at runtime by comparing a global signature with the expected value and introduces consecutive IDs and bitmaps to reduce the time and memory overhead. Theoretical analysis shows that BGCFC can detect all types of internode CFEs with constant time and memory overhead. Practical tests verify the result of theoretical analysis. Compared with previous techniques, BGCFC achieves the highest error detection rate, lower time and memory overhead; the composite result in evaluation fac tor shows that BGCFC is the most effective one among all these techniques. The results in both theory and practice verify the applicability of BGCFC for COTSbased small satellites.展开更多
A novel design and implementation of an attendance checking node for coal mines based on the CAN bus is presented in this paper. Hardware circuits and programming methods for the attendance checking node are discussed...A novel design and implementation of an attendance checking node for coal mines based on the CAN bus is presented in this paper. Hardware circuits and programming methods for the attendance checking node are discussed,including the single-chip computer with CAN controller AT89C51CC03,the CAN bus transceiver TJA1050,the large capacity DataFlash memory,the real-time clock DS1302,the voice chip ISD2560 and the card-reading circuit in Wie-gand format. All the extended hardware satisfies the requirements for intrinsically safe circuits (GB3836.4-2000) and intrinsically safe authentication promoted by the national explosion-proof institute. Further,the software programming methods for the CAN controller (AT89C51CC03) and the implementation of the CAN communications protocol are presented as well.展开更多
The current collector fracture failure of lithium-ion batteries(LIBs)occurs during its winding production process frequently,and the consequent damages are usually large,but little research has been conducted on this ...The current collector fracture failure of lithium-ion batteries(LIBs)occurs during its winding production process frequently,and the consequent damages are usually large,but little research has been conducted on this phenomenon.This work stems from the difficulty and obstacles in the winding process of actual production of LIBs.The fracture failure of the current collectors is easily caused by the evolution and mutation of the mechanical behavior during the winding process,resulting in safety hazards and poor efficiency.The purpose of this work is to reveal the evolution and distribution mechanism of circumferential strain of the current collectors on the fracture failure under the constraint of winding process.Experimental tests,finite element calculations and theoretical model are used to study the evolution and distribution of circumferential strain.The dynamic evolution process of circumferential strain is tested accurately,and the mechanism of fracture failure of current collectors is revealed.The criterion for current collector strength is proposed based on the results of strain analysis and SEM observation.展开更多
A formal model representing the navigation behavior of a Web application as the Kripke structure is proposed and an approach that applies model checking to test case generation is presented. The Object Relation Diagra...A formal model representing the navigation behavior of a Web application as the Kripke structure is proposed and an approach that applies model checking to test case generation is presented. The Object Relation Diagram as the object model is employed to describe the object structure of a Web application design and can be translated into the behavior model. A key problem of model checking-based test generation for a Web application is how to construct a set of trap properties that intend to cause the violations of model checking against the behavior model and output of counterexamples used to construct the test sequences. We give an algorithm that derives trap properties from the object model with respect to node and edge coverage criteria.展开更多
The soundness is a very important criterion for the correctness of the workflow. Specifying the soundness with Computation Tree Logic （CTL） allows us to verify the soundness with symbolic model checkers. Therefore t...The soundness is a very important criterion for the correctness of the workflow. Specifying the soundness with Computation Tree Logic （CTL） allows us to verify the soundness with symbolic model checkers. Therefore the state explosion problem in verifying soundness can be overcome efficiently. When the property is not satisfied by the system, model checking can give a counter-example, which can guide us to correct the workflow. In addition, relaxed soundness is another important criterion for the workflow. We also prove that Computation Tree Logic ＊ （CTL ＊ ） can be used to character the relaxed soundness of the workflow.展开更多
Product detection based on state abstraction technologies in the software product line(SPL)is more complex when compared to a single system.This variability constitutes a new complexity,and the counterexample may be v...Product detection based on state abstraction technologies in the software product line(SPL)is more complex when compared to a single system.This variability constitutes a new complexity,and the counterexample may be valid for some products but spurious for others.In this paper,we found that spurious products are primarily due to the failure states,which correspond to the spurious counterexamples.The violated products correspond to the real counterexamples.Hence,identifying counterexamples is a critical problem in detecting violated products.In our approach,we obtain the violated products through the genuine counterexamples,which have no failure state,to avoid the tedious computation of identifying spurious products dealt with by the existing algorithm.This can be executed in parallel to improve the efficiency further.Experimental results showthat our approach performswell,varying with the growth of the system scale.By analyzing counterexamples in the abstract model,we observed that spurious products occur in the failure state.The approach helps in identifying whether a counterexample is spurious or genuine.The approach also helps to check whether a failure state exists in the counterexample.The performance evaluation shows that the proposed approach helps significantly in improving the efficiency of abstraction-based SPL model checking.展开更多
This paper proposes a generic high-performance and low-time-overhead software control flow checking solution, graph-tree-based control flow checking （GTCFC） for space-borne commercial-off-the-shelf （COTS） processo...This paper proposes a generic high-performance and low-time-overhead software control flow checking solution, graph-tree-based control flow checking （GTCFC） for space-borne commercial-off-the-shelf （COTS） processors. A graph tree data structure with a topology similar to common trees is introduced to transform the control flow graphs of target programs. This together with design of IDs and signatures of its vertices and edges allows for an easy check of legality of actual branching during target program execution. As a result, the algorithm not only is capable of detecting all single and multiple branching errors with low latency and time overheads along with a linear-complexity space overhead, but also remains generic among arbitrary instruction sets and independent of any specific hardware. Tests of the algorithm using a COTS-processor-based onboard computer （OBC） of in-service ZDPS-1A pico-satellite products show that GTCFC can detect over 90% of the randomly injected and all-pattern-covering branching errors for different types of target programs, with performance and overheads consistent with the theoretical analysis; and beats well-established preeminent control flow checking algorithms in these dimensions. Furthermore, it is validated that GTCGC not only can be accommodated in pico-satellites conveniently with still sufficient system margins left, but also has the ability to minimize the risk of control flow errors being undetected in their space missions. Therefore, due to its effectiveness, efficiency, and compatibility, the GTCFC solution is ready for applications on COTS processors on pico-satellites in their real space missions.展开更多
文摘Graph transformation systems have become a general formal modeling language to describe many models in software development process.Behavioral modeling of dynamic systems and model-to-model transformations are only a few examples in which graphs have been used to software development.But even the perfect graph transformation system must be equipped with automated analysis capabilities to let users understand whether such a formal specification fulfills their requirements.In this paper,we present a new solution to verify graph transformation systems using the Bogor model checker.The attributed graph grammars(AGG)-like graph transformation systems are translated to Bandera intermediate representation(BIR),the input language of Bogor,and Bogor verifies the model against some interesting properties defined by combining linear temporal logic(LTL) and special-purpose graph rules.Experimental results are encouraging,showing that in most cases our solution improves existing approaches in terms of both performance and expressiveness.
基金The work is partially supported by Natural Science Foundation of Ningxia(Grant No.AAC03300)National Natural Science Foundation of China(Grant No.61962001)Graduate Innovation Project of North Minzu University(Grant No.YCX23152).
文摘Model checking is an automated formal verification method to verify whether epistemic multi-agent systems adhere to property specifications.Although there is an extensive literature on qualitative properties such as safety and liveness,there is still a lack of quantitative and uncertain property verifications for these systems.In uncertain environments,agents must make judicious decisions based on subjective epistemic.To verify epistemic and measurable properties in multi-agent systems,this paper extends fuzzy computation tree logic by introducing epistemic modalities and proposing a new Fuzzy Computation Tree Logic of Knowledge(FCTLK).We represent fuzzy multi-agent systems as distributed knowledge bases with fuzzy epistemic interpreted systems.In addition,we provide a transformation algorithm from fuzzy epistemic interpreted systems to fuzzy Kripke structures,as well as transformation rules from FCTLK formulas to Fuzzy Computation Tree Logic(FCTL)formulas.Accordingly,we transform the FCTLK model checking problem into the FCTL model checking.This enables the verification of FCTLK formulas by using the fuzzy model checking algorithm of FCTL without additional computational overheads.Finally,we present correctness proofs and complexity analyses of the proposed algorithms.Additionally,we further illustrate the practical application of our approach through an example of a train control system.
文摘A multi-agent based transport system is modeled by timed automata model extended with clock variables. The correctness properties of safety and liveness of this model are verified by timed automata based UPPAAL. Agents have a degree of control on their own actions, have their own threads of control, and under some circumstances they are also able to take decisions. Therefore they are autonomous. The multi-agent system is modeled as a network of timed automata based agents supported by clock variables. The representation of agent requirements based on mathematics is helpful in precise and unambiguous specifications, thereby ensuring correctness. This formal representation of requirements provides a way for logical reasoning about the artifacts produced. We can be systematic and precise in assessing correctness by rigorously specifying the functional requirements.
文摘In this paper, the interference checking of three-dimensional objects within a plant is discussed and accomplished, which offers an automated solution to the design problems inherent in multi-user, multi-model environments. Also, the collision detection among moving objects is presented and discussed, and some new ideas are proposed. These methods are successfully applied in our Plant Design System (PDS) and are proven to be very practical and efficient.
基金The National Natural Science Foundation of China (No.10974093)the Scientific Research Foundation for Senior Personnel of Jiangsu University (No.07JDG014)the Natural Science Foundation of Higher Education Institutions of Jiangsu Province (No.08KJD520015)
文摘In order to find the completeness threshold which offers a practical method of making bounded model checking complete, the over-approximation for the complete threshold is presented. First, a linear logic of knowledge is introduced into the past tense operator, and then a new temporal epistemic logic LTLKP is obtained, so that LTLKP can naturally and precisely describe the system＇s reliability. Secondly, a set of prior algorithms are designed to calculate the maximal reachable depth and the length of the longest of loop free paths in the structure based on the graph structure theory. Finally, some theorems are proposed to show how to approximate the complete threshold with the diameter and recurrence diameter. The proposed work resolves the completeness threshold problem so that the completeness of bounded model checking can be guaranteed.
文摘In time series modeling, the residuals are often checked for white noise and normality. In practice, the useful tests are Ljung Box test. Mcleod Li test and Lin Mudholkar test. In this paper, we present a nonparametric approach for checking the residuals of time series models. This approach is based on the maximal correlation coefficient ρ 2 * between the residuals and time t . The basic idea is to use the bootstrap to form the null distribution of the statistic ρ 2 * under the null hypothesis H 0:ρ 2 * =0. For calculating ρ 2 * , we proposes a ρ algorithm, analogous to ACE procedure. Power study shows this approach is more powerful than Ljung Box test. Meanwhile, some numerical results and two examples are reported in this paper.
基金supported by the National Natural Science Foundation of China(Nos.61502498,U1433120 and 61806208)the Fundamental Research Funds for the Central Universities,China(No.3122017001)
文摘Federal Aviation Administration(FAA) and NASA technical reports indicate that the misunderstanding in radiotelephony communications is a primary causal factor associated with operation errors, and a sizable proportion of operation errors lead to read-back errors. We introduce deep learning method to solve this problem and propose a new semantic checking model based on Long Short-Time Memory network(LSTM) for intelligent read-back error checking. A meanpooling layer is added to the traditional LSTM, so as to utilize the information obtained by all the hidden activation vectors, and also to improve the robustness of the semantic vector extracted by LSTM. A MultiLayer Perceptron(MLP) layer, which can maintain the information of different regions in the concatenated vectors obtained by the mean-pooling layer, is applied instead of traditional similarity function in the new model to express the semantic similarity of the read-back pairs quantitatively. The K-Nearest Neighbor(KNN) classifier is used to verify whether the read-back pairs are consistent in semantics according to the output of MLP layer. Extensive experiments are conducted and the results show that the proposed model is more effective and more robust than the traditional checking model to verify the semantic consistency of read-backs automatically.
基金National Natural Science Foundation ofChina(No.70 2 710 3 8)
文摘Ontology is defined as an explicit specification of a conceptualization. In this paper, an extended ontology model was constructed using description logics, which is a 5-tuples including term set, individual set, term definition set, instantiation assertion set and term restriction set. Based on the extended model, the issue on ontology checking was studied with the conclusion that the four kinds of term checking, including term satisfiability checking, term subsumption checking, term equivalence checking and term disjointness checking, can be reduced to the satisfiability checking, and satisfiability checking can be transformed into instantiation consistence checking.
基金supported by National Natural Science Foundation of China under Grant No. 61003079
文摘Model checking based on linear temporal logic reduces the false negative rate of misuse detection.However,linear temporal logic formulae cannot be used to describe concurrent attacks and piecewise attacks.So there is still a high rate of false negatives in detecting these complex attack patterns.To solve this problem,we use interval temporal logic formulae to describe concurrent attacks and piecewise attacks.On this basis,we formalize a novel algorithm for intrusion detection based on model checking interval temporal logic.Compared with the method based on model checking linear temporal logic,the new algorithm can find unknown succinct attacks.The simulation results show that the new method can effectively reduce the false negative rate of concurrent attacks and piecewise attacks.
基金supported by National Natural Science Foundation of China(No.61571061)
文摘In this paper, we focus on the design of irregular QC-LDPC code based multi-level coded modulation(MLCM) scheme by jointly optimizing the component code rate and the degree distribution of the irregular QC-LDPC component code. Firstly, the sub-channel capacities of MLCM systems is analyzed and discussed, based on which the optimal component code rate can be obtained. Secondly, an extrinsic information transfer chart based two-stage searching algorithm is proposed to find the good irregular QC-LDPC code ensembles with optimal component code rates for their corresponding sub-channels. Finally, by constructing the irregular QC-LDPC component codes from the designed ensembles with the aim of possibly enlarging the girth and reducing the number of the shortest cycles, the designed irregular QC-LDPC code based 16QAM and 64QAM MLCM systems can achieve 0.4 dB and 1.2 dB net coding gain, respectively, compared with the recently proposed regular QC-LDPC code based 16QAM and 64QAM MLCM systems.
基金supported by the Natural Science Foundation of Hunan Province(2018JJ2282)
文摘Reliability enhancement testing(RET) is an accelerated testing which hastens the performance degradation process to surface its inherent defects of design and manufacture. It is an important hypothesis that the degradation mechanism of the RET is the same as the one of the normal stress condition. In order to check the consistency of two mechanisms, we conduct two enhancement tests with a missile servo system as an object of the study, and preprocess two sets of test data to establish the accelerated degradation models regarding the temperature change rate that is assumed to be the main applied stress of the servo system during the natural storage. Based on the accelerated degradation models and natural storage profile of the servo system, we provide and demonstrate a procedure to check the consistency of two mechanisms by checking the correlation and difference of two sets of degradation data. The results indicate that the two degradation mechanisms are significantly consistent with each other.
基金This project is supported by National Natural Science Foundation of China(No.10342003).
文摘The dynamics differential equations are constructed, and the initial conditions are also given. Simulation shows the following conclusions： The water pressure in cylinder has great instantaneous pulsation and phase step when outlet valve or inlet valve opens, but is more gently in other time; The volume efficiency is influenced by the output pressure slightly, and decreases as the working rotational speed increases; When the inherent frequency of the valves is integer multiple of the working frequency, the volume efficiency of system will decrease evidently.
基金support from the National Natural Science Foundation of Chinathe Fundamental Research Funds for the Central Universities of China
文摘Abstract Single event upset （SEU） effect, caused by highly energized particles in aerospace, threatens the reliability and security of small satellites composed of commercialofftheshelves （COTS）. SEU induced control flow errors （CFEs） may cause unpredictable behavior or crashes of COTSbased small satellites. This paper proposes a generic softwarebased control flow checking technique （CFC） and bipartite graphbased control flow checking （BGCFC）. To simplify the types of illegal branches, it transforms the conventional control flow graph into the equivalent bipartite graph. It checks the legal ity of control flow at runtime by comparing a global signature with the expected value and introduces consecutive IDs and bitmaps to reduce the time and memory overhead. Theoretical analysis shows that BGCFC can detect all types of internode CFEs with constant time and memory overhead. Practical tests verify the result of theoretical analysis. Compared with previous techniques, BGCFC achieves the highest error detection rate, lower time and memory overhead; the composite result in evaluation fac tor shows that BGCFC is the most effective one among all these techniques. The results in both theory and practice verify the applicability of BGCFC for COTSbased small satellites.
基金Projects 50674086 supported by the National Natural Science Foundation of ChinaBS2006002 by the Society Development Science and Technology Planof Jiangsu Province20060290508 by the Doctoral Foundation of Ministry of Education of China
文摘A novel design and implementation of an attendance checking node for coal mines based on the CAN bus is presented in this paper. Hardware circuits and programming methods for the attendance checking node are discussed,including the single-chip computer with CAN controller AT89C51CC03,the CAN bus transceiver TJA1050,the large capacity DataFlash memory,the real-time clock DS1302,the voice chip ISD2560 and the card-reading circuit in Wie-gand format. All the extended hardware satisfies the requirements for intrinsically safe circuits (GB3836.4-2000) and intrinsically safe authentication promoted by the national explosion-proof institute. Further,the software programming methods for the CAN controller (AT89C51CC03) and the implementation of the CAN communications protocol are presented as well.
基金National Natural Science Foundation of China(12002183)Postdoctoral Science Foundation(2019TQ0171,2020M670304)Beijing Natural Science Foundation(Grant Nos.16L00001 and 2182065)are Rratefullv acknowledged.
文摘The current collector fracture failure of lithium-ion batteries(LIBs)occurs during its winding production process frequently,and the consequent damages are usually large,but little research has been conducted on this phenomenon.This work stems from the difficulty and obstacles in the winding process of actual production of LIBs.The fracture failure of the current collectors is easily caused by the evolution and mutation of the mechanical behavior during the winding process,resulting in safety hazards and poor efficiency.The purpose of this work is to reveal the evolution and distribution mechanism of circumferential strain of the current collectors on the fracture failure under the constraint of winding process.Experimental tests,finite element calculations and theoretical model are used to study the evolution and distribution of circumferential strain.The dynamic evolution process of circumferential strain is tested accurately,and the mechanism of fracture failure of current collectors is revealed.The criterion for current collector strength is proposed based on the results of strain analysis and SEM observation.
基金Supported by the National Natural Science Foundation of China (60673115)the National Basic Research Program of China (973 Program) (2002CB312001)the Open Foundation of State Key Laboratory of Soft-ware Engineering (SKLSE05-13)
文摘A formal model representing the navigation behavior of a Web application as the Kripke structure is proposed and an approach that applies model checking to test case generation is presented. The Object Relation Diagram as the object model is employed to describe the object structure of a Web application design and can be translated into the behavior model. A key problem of model checking-based test generation for a Web application is how to construct a set of trap properties that intend to cause the violations of model checking against the behavior model and output of counterexamples used to construct the test sequences. We give an algorithm that derives trap properties from the object model with respect to node and edge coverage criteria.
基金Supported by the National Natural Science Foun-dation of China (60573046)
文摘The soundness is a very important criterion for the correctness of the workflow. Specifying the soundness with Computation Tree Logic （CTL） allows us to verify the soundness with symbolic model checkers. Therefore the state explosion problem in verifying soundness can be overcome efficiently. When the property is not satisfied by the system, model checking can give a counter-example, which can guide us to correct the workflow. In addition, relaxed soundness is another important criterion for the workflow. We also prove that Computation Tree Logic ＊ （CTL ＊ ） can be used to character the relaxed soundness of the workflow.
基金supported by the Fund of ExcellentYouth Scientific and Technological Innovation Team of Hubei’s Universities(Project No:T201818)Science and Technology Research Program of Hubei Provincial Education Department(Project No:Q20143005)Guiding project of scientific research plan of Hubei Provincial Department of Education(Project No:B2021261).
文摘Product detection based on state abstraction technologies in the software product line(SPL)is more complex when compared to a single system.This variability constitutes a new complexity,and the counterexample may be valid for some products but spurious for others.In this paper,we found that spurious products are primarily due to the failure states,which correspond to the spurious counterexamples.The violated products correspond to the real counterexamples.Hence,identifying counterexamples is a critical problem in detecting violated products.In our approach,we obtain the violated products through the genuine counterexamples,which have no failure state,to avoid the tedious computation of identifying spurious products dealt with by the existing algorithm.This can be executed in parallel to improve the efficiency further.Experimental results showthat our approach performswell,varying with the growth of the system scale.By analyzing counterexamples in the abstract model,we observed that spurious products occur in the failure state.The approach helps in identifying whether a counterexample is spurious or genuine.The approach also helps to check whether a failure state exists in the counterexample.The performance evaluation shows that the proposed approach helps significantly in improving the efficiency of abstraction-based SPL model checking.
基金supported by National Natural Science Foundation of China (No. 60904090)
文摘This paper proposes a generic high-performance and low-time-overhead software control flow checking solution, graph-tree-based control flow checking （GTCFC） for space-borne commercial-off-the-shelf （COTS） processors. A graph tree data structure with a topology similar to common trees is introduced to transform the control flow graphs of target programs. This together with design of IDs and signatures of its vertices and edges allows for an easy check of legality of actual branching during target program execution. As a result, the algorithm not only is capable of detecting all single and multiple branching errors with low latency and time overheads along with a linear-complexity space overhead, but also remains generic among arbitrary instruction sets and independent of any specific hardware. Tests of the algorithm using a COTS-processor-based onboard computer （OBC） of in-service ZDPS-1A pico-satellite products show that GTCFC can detect over 90% of the randomly injected and all-pattern-covering branching errors for different types of target programs, with performance and overheads consistent with the theoretical analysis; and beats well-established preeminent control flow checking algorithms in these dimensions. Furthermore, it is validated that GTCGC not only can be accommodated in pico-satellites conveniently with still sufficient system margins left, but also has the ability to minimize the risk of control flow errors being undetected in their space missions. Therefore, due to its effectiveness, efficiency, and compatibility, the GTCFC solution is ready for applications on COTS processors on pico-satellites in their real space missions.
