Real-time embedded software testing method based on extended finite state machine

The reliability of real-time embedded software directly determines the reliability of the whole real-time embedded sys- tem, and the effective software testing is an important way to ensure software quality and reliability. Based on the analysis of the characteristics of real-time embedded software, the formal method is introduced into the real-time embedded software testing field and the real-time extended finite state machine （RT-EFSM） model is studied firstly. Then, the time zone division method of real-time embedded system is presented and the definition and description methods of time-constrained transition equivalence class （timeCTEC） are presented. Furthermore, the approaches of the testing sequence and test case generation are put forward. Finally, the proposed method is applied to a typical avionics real- time embedded software testing practice and the examples of the timeCTEC, testing sequences and test cases are given. With the analysis of the testing result, the application verification shows that the proposed method can effectively describe the real-time embedded software state transition characteristics and real-time requirements and play the advantages of the formal methods in accuracy, effectiveness and the automation supporting. Combined with the testing platform, the real-time, closed loop and automated simulation testing for real-time embedded software can be realized effectively.

Artificial emotional model based on finite state machine

According to the basic emotional theory, the artificial emotional model based on the finite state machine(FSM) was presented. In finite state machine model of emotion, the emotional space included the basic emotional space and the multiple emotional spaces. The emotion-switching diagram was defined and transition function was developed using Markov chain and linear interpolation algorithm. The simulation model was built using Stateflow toolbox and Simulink toolbox based on the Matlab platform. And the model included three subsystems: the input one, the emotion one and the behavior one. In the emotional subsystem, the responses of different personalities to the external stimuli were described by defining personal space. This model takes states from an emotional space and updates its state depending on its current state and a state of its input (also a state-emotion). The simulation model realizes the process of switching the emotion from the neutral state to other basic emotions. The simulation result is proved to correspond to emotion-switching law of human beings.

POWER OPTIMIZATION OF FINITE STATE MACHINE BASED ON GENETIC ALGORITHM

Using state assignment to minimize power dissipation and area for finite state ma-chines is computationally hard. Most of published results show that the reduction of switchingactivity often trades with area penalty. In this paper, a new approach is proposed. Experimentalresults show a significant reduction of switching activity without area penalty compared withprevious publications.

Global Control Simulation of Electric Vehicle Based on Finite State Machine Theory

Finite state machine theory (FSM) is introduced and applied to global control of electric vehicle. Theoretical adaptation for application of FSM in control of electric vehicle is analyzed. Global control logic for parts of electric vehicle is analyzed and built based on FSM. Using Matlab/Simulink, BJD6100-HEV global control algorithm is modeled and prove validity by simulation.

Semantic Sentence Similarity Using Finite State Machine

In this paper, a finite state machine approach is followed in order to find the semantic similarity of two sentences. The approach exploits the concept of bi-directional logic along with a semantic ordering approach. The core part of this approach is bi-directional logic of artificial intelligence. The bi-directional logic is implemented using Finite State Machine algorithm with slight modification. For finding the semantic similarity, keyword has played climactic importance. With the help of the keyword approach, it can be found easily at the sentence level according to this algorithm. The algorithm is proposed especially for Nepali texts. With the polarity of the individual keywords, the finite state machine is made and its final state determines its polarity. If two sentences are negatively polarized, they are said to be coherent, otherwise not. Similarly, if two sentences are of a positive nature, they are said to be coherence. For measuring the coherence (similarity), contextual concept is taken into consideration. The semantic approach, in this research, is a totally contextual based method. Two sentences are said to be semantically similar if they bear the same context. The total accuracy obtained in this algorithm is 90.16%.

Test Selection on Extended Finite State Machines with Provable Guarantees

Building high confidence regression test suites to validate new system versions is a challenging problem. A modelbased approach to build a regression test suite from a given test suite is described. The generated test suite includes every test that will traverse a change performed to produce the new version, and consists of only such tests to reduce the testing costs. Finite state machines extended with typed variables (EFSMs) are used to model systems and system changes are mapped to EFSM transition changes adding/deleting/replacing EFSM transitions and states. Tests are a sequence of input and expected output messages with concrete parameter values over the supported data types. An invariant is formulated to characterize tests whose runtime behavior can be accurately predicted by analyzing their descriptions along with the model. Incremental procedures to efficiently evaluate the invariant and to select tests for regression are developed. Overlaps among the test descriptions are exploited to extend the approach to simultaneously select multiple tests to reduce the test selection costs. Effectiveness of the approach is demonstrated by applying it to several protocols, Web services, and model programs extracted from a popular testing benchmark. Our experimental results show that the proposed approach is economical for regression test selection in all these examples. For all these examples, the proposed approach is able to identify all tests exercising changes more efficiently than brute-force symbolic evaluation.

基于FSM的并联谐振中频电源整流逆变调功控制

并联谐振晶闸管中频双控感应加热电源调功系统由整流和逆变两部分构成。调节整流单元的移相角,改变逆变单元的功率因数角都可影响谐振槽路的中频电压的输出,进而控制输出功率。在分析槽路中频逆变电压同晶闸管整流装置的移相角、逆变单元的功率因数角关系的基础上,提出了基于有限状态机(FSM)的并联谐振晶闸管中频电源整流-逆变调功方案。该方案采用控制层与调度层结构。控制层将中频电压作为闭环控制对象,分别以整流环节和逆变环节作为执行单元,设计具有鲁棒稳定性的移相整流控制器和锁相逆变控制器;调度层采用FSM结构,可根据加热工艺需求实现整流-逆变轮换调功和联合调功。该方案已经应用于多台大功率并联谐振晶闸管中频电源中,其可行性和有效性得到验证。

基于EFSM的智能车间制造系统生产物流建模与仿真

制造业的生产物流方式处于不断变革中,对其建模仿真可为制造系统规划设计、分析及改造提供决策支持。依“人-机-物-环-法”分类给出了智能车间制造系统中实体元素的描述,结合EFSM(extended finite state machine)和组件化建模思想,建立了生产和物流组件化EFSM模型;阐述了智能车间多作业生产的建模过程以及组件模型实例化方法;通过EFSM-DEVS(discrete event system specification)模型自动转换及DEVS引擎完成了仿真运行。仿真结果表明:该方法所建立的模型更符合车间实际状况,适用性更广;组件化建模思想能构造更具扩展性的软件;建模及仿真运行的3D可视化使软件直观性更好,其仿真结果与AnyLogic保持一致。

基于结构覆盖和状态识别的FSM一致性测试实验评估

针对在测试资源紧张的情况下所面临的不同测试技术中测试方法选择问题,阐明了对基于结构覆盖和基于状态识别的测试生成技术进行实验评估的必要性,以10个有限状态机(finite state machine,FSM)应用实例为实验对象,从测试开销和错误覆盖能力两方面对这两种技术进行了实证研究,为FSM一致性测试中这两种技术的选择应用提供了经验性的参考建议。

Web Testing Generation: A Stream <i>X-Machine</i>Based Approach

To ensure the quality of Web applications, Web testing is one of the effective methods. The testing is a process of revealing errors that is used to give confidence that the implementation of a Web application meets its original specification. This work proposes a Web testing framework based on Stream X-Machines (SXMs), which provides a way to derive test cases for a Web application. It starts from constructing the SXM model, from which a test translator is employed to extract the test paths and then translates them into an XML-style test specification, which is the input of test engine. The test engine generates test cases and then executes them, and finally produces test report. This testing method is a significant contribution to informed research.

Design and Realization of Rotating Machinery Conditions Monitoring System Based on LabVIEW

Nonlinear dynamic analysis of rotating machinery system has always been the hot spot of the rotational dynamics re-search. This article sets up a rotating machinery condition monitoring system to realize the measurement of system dynamic charac-teristic parameters based on NI(National Instruments) virtual instruments technology. The measurement of vibration signal of rotating machinery system is achieved by using NI company general data acquisition module of NI Company. Meanwhile, by analyzing and processing the acquired data using LabVIEW 2012, the dynamic characteristics, such as .the speed of the rotating machinery system, the axis trajectory, spectrum parameters, are attained. The measurement results show that the rotating machinery condition monitor-ing system based on LabVIEW is easy to operate, easy to realize the function extension and maintenance, and that it can be used in the industrial engineering projects with rotation characteristics. LabVIEW as the development tools used by virtual instrument func-tion is very powerful data acquisition software products support is one of the features of it, so using LabVIEW programming and data acquisition is simple and convenient.

面向全迁移的小规模EFSM测试序列集生成方法

针对在扩展有限状态机(extended finite state machine,EFSM)模型上测试序列集生成效率低、规模大等问题,提出了一种面向全迁移的小规模测试序列集生成方法。该方法基于改进的自适应多种群遗传算法(improved adaptive multi-population genetic algorithm,IAMGA)。首先,利用迁移覆盖增益设计适应度函数,使每次生成的可行迁移路径均能产生迁移覆盖增益;然后,根据个体的可行迁移划分子种群,并在子种群内使用轮盘赌算法进行选择,克服了“早熟”问题,提高了全迁移覆盖的成功率;再利用种群的平均路径通过率自适应地调整交叉和变异概率,加快了收敛速度;最后,通过倒序遍历测试序列集去除冗余序列,进一步压缩了测试序列集规模。实验结果表明,与面向单迁移的测试序列生成方法相比,本文所提出的测试序列生成方法面向全迁移,仅一次就能以90%以上的成功率生成满足全迁移覆盖的测试序列集;与传统的遗传算法相比,IAMGA算法生成的测试序列集的平均规模减少了50%,平均迭代次数也减少了20%。本文提出的测试序列集生成方法可有效提高EFSM测试序列集生成的效率和质量。

基于EFSM模型的铁路信号安全软件单元测试技术研究

铁路信号安全软件内部逻辑复杂,通过充分的单元测试能够更好地发现和排除软件内部的缺陷。文章分析单元测试常用方法,并结合铁路信号安全软件单元测试技术要求,提出一种基于扩展有限状态机(EFSM,Enhanced Finite State Machine)模型的黑白盒融合单元测试方法。使用自动化测试工具Cantata,以无线超时降级场景为实例,验证该方法是否可以满足测试场景的完备性,并且关注软件结构是否被完全覆盖。根据覆盖结果,对未覆盖原因进行分析,判断是否存在异常场景,并针对未覆盖分支补充测试场景,丰富了测试案例,从而保障了铁路信号系统的可靠性。

无人驾驶车辆路径跟踪混合控制策略研究

针对单一控制算法无法同时满足无人驾驶车辆对路径跟踪精度和控制器求解速度需求的问题,提出一种基于线性二次型调节器(LQR)和模型预测控制(MPC)的混合控制策略。该策略在低速工况下使用线性二次型调节器、在高速工况下使用模型预测控制算法进行路径跟踪控制,在此基础上设计基于有限状态机(FSM)的控制算法切换机制,并通过遗传算法(GA)对控制参数进行优化,基于CarSim和MATLAB/Simulink仿真平台对混合控制策略进行仿真验证,并进一步完成了实车试验。试验结果表明,所设计的混合控制策略能够在提高跟踪精度的基础上缩短计算时间,与单一控制算法相比,平均横向误差和平均航向误差分别减小了26.3%和39.6%,平均计算时间缩短了10.9%。

基于FPGA的TANGRAM分组密码算法实现

TANGRAM系列分组密码算法是一种采用比特切片方法,适合多种软硬件平台的系列分组密码算法。针对TANGRAM-128/128算法,使用Verilog HDL对该算法进行FPGA实现并提出设计方案。首先,介绍了TANGRAM密码算法的特点和流程,提出了针对TANGRAM密码算法进行44轮加/解密迭代计算的方案,该方案采取有限状态机的方法有效降低了资源消耗;其次,基于国产高云云源平台,完成了基于高云FPGA的算法工程实现,以及功能仿真和数据的正确性验证,同时在QuartusⅡ13.1.0平台上也进行了相关测试,用以比较。测试结果表明,TANGRAM系列分组密码算法基于Altera公司的CycloneⅣE系列EP4CE40F29C6芯片进行工程实现,最大时钟频率为138.64 MHz,加/解密速率为403.30 Mbps;基于高云半导体GW2A-55系列芯片的最大时钟频率为96.537 MHz,加/解密速率为280.80 Mbps。

机耕道自动驾驶农机局部路径规划

针对机耕道场景下自动驾驶农机行驶的安全性、平稳性与规划实时性的实际需求,该研究提出了一种基于二次规划的局部路径规划方法。首先基于有限状态机构建农机机耕道行驶模式,其次采用横纵向解耦的方法,通过改进状态栅格法分别对农机速度行为和轨迹行为进行决策,随后利用二次规划方法生成满足多目标、多约束条件的农机轨迹和速度,得到最优路径,最后在多种行驶环境中进行仿真和实车试验,行驶参考速度为2 m/s。实车试验结果表明,在绕行静态障碍物场景中,规划轨迹的平均绝对曲率为0.021 m^(-1),最大绝对曲率为0.056 m^(-1),平均绝对横向误差为3.23 cm,最大绝对横向误差为8.69 cm,农机与障碍物外轮廓的距离大于0.76 m;在规避相向行驶、同向行驶和横穿机耕道的动态障碍物场景中,规划速度的平均绝对速度误差为0.08~0.12 m/s,绝对速度误差小于0.38 m/s,加速度变化范围为-0.38~0.44 m/s^(2)。在规划周期为200 ms的仿真试验中,该文算法平均耗时48 ms,最大耗时75 ms,相比采用静态状态栅格法平均耗时减少38 ms,算法效率提升44%。研究结果可为机耕道场景下的农机局部路径规划提供技术支持。

Application of Finite State Machine Theory to the Simulation of Reversed Non-Linear Hysteretic Relationships

This paper presents the application of finite state machine (FSM) theory to the programming of nonlinear hysteretic model simulation for both known and newly created rules. The complicated reversed internal paths involved in the nonlinear relationship which not only depend on material properties, but also on load history, often confuse rule creators and scholars. In this paper, we first describe the development of past hysteretic models. Then we introduce the FSM theory conceptually, and explain how it is applied to reversed and diverse routes. Next, state definitions and procedures are explained with a specific data example using the bilinear model. Finally, the successful application to UC-win/FRAME (3D) is described and several characteristics are summarized. By using FSM’s states and the linkages to represent a hysteresis model, we can quickly realize the programming of the defined complex model rules, and the nonlinear modeling becomes more efficient and feasible.

Aspect-Oriented Modeling and Verification with Finite State Machines

Aspect-oriented programming modularizes crosscutting concerns into aspects with the advice invoked at the specified points of program execution. Aspects can be used in a harmful way that invalidates desired properties and even destroys the conceptual integrity of programs. To assure the quality of an aspect-oriented system, rigorous analysis and design of aspects are highly desirable. In this paper, we present an approach to aspect-oriented modeling and verification with finite state machines. Our approach provides explicit notations （e.g., pointcut, advice and aspect） for capturing crosscutting concerns and incremental modification requirements with respect to class state models. For verification purposes, we compose the aspect models and class models in an aspect-oriented model through a weaving mechanism. Then we transform the woven models and the class models not affected by the aspects into FSP （Finite State Processes）, which are to be checked by the LTSA （Labeled Transition System Analyzer） model checker against the desired system properties. We have applied our approach to the modeling and verification of three aspect-oriented systems. To further evaluate the effectiveness of verification, we created a large number of flawed aspect models and verified them against the system requirements. The results show that the verification has revealed all flawed models. This indicates that our approach is effective in quality assurance of aspect-oriented state models. As such, our approach can be used for model-checking state-based specification of aspect-oriented design and can uncover some system design problems before the system is implemented.

A matrix-based static approach to analysis of finite state machines

Traditional matrix-based approaches in the field of finite state machines construct state transition matrices,and then use the powers of the state transition matrices to represent corresponding dynamic transition processes,which are cornerstones of system analysis.In this study,we propose a static matrix-based approach that revisits a finite state machine from its structure rather than its dynamic transition process,thus avoiding the“explosion of complexity”problem inherent in the existing approaches.Based on the static approach,we reexamine the issues of closed-loop detection and controllability for deterministic finite state machines.In addition,we propose controllable equivalent form and minimal controllable equivalent form concepts and give corresponding algorithms.