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.

Intrusion Detection for Wireless Mesh Networks using Finite State Machine

Wireless Mesh Networks is vulnerable to attacks due to the open medium, dynamically changing network topology, cooperative algorithms, Lack of centralized monitoring and management point. The traditional way of protecting networks with firewalls and encryption software is no longer suffi- cient and effective for those features. In this paper, we propose a distributed intrusion detection ap- proach based on timed automata. A cluster-based detection scheme is presented, where periodically a node is elected as the monitor node for a cluster. These monitor nodes can not only make local intrusion detection decisions, but also cooperatively take part in global intrusion detection. And then we con- struct the Finite State Machine （FSM） by the way of manually abstracting the correct behaviors of the node according to the routing protocol of Dynamic Source Routing （DSR）. The monitor nodes can verify every node＇s behavior by the Finite State Ma- chine （FSM）, and validly detect real-time attacks without signatures of intrusion or trained data.Compared with the architecture where each node is its own IDS agent, our approach is much more efficient while maintaining the same level of effectiveness. Finally, we evaluate the intrusion detection method through simulation experiments.

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 fimction 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.

Intelligent decision-making method for vehicles in emergency conditions based on artificial potential fields and finite state machines

This study aims to propose a decision-making method based on artificial potential fields(APFs)and finite state machines(FSMs)in emergency conditions.This study presents a decision-making method based on APFs and FSMs for emergency conditions.By modeling the longitudinal and lateral potential energy fields of the vehicle,the driving state is identified,and the trigger conditions are provided for path planning during lane changing.In addition,this study also designed the state transition rules based on the longitudinal and lateral virtual forces.It established the vehicle decision-making model based on the finite state machine to ensure driving safety in emergency situations.To illustrate the performance of the decision-making model by considering APFs and finite state machines.The version of the model in the co-simulation platform of MATLAB and CarSim shows that the developed decision model in this study accurately generates driving behaviors of the vehicle at different time intervals.The contributions of this study are two-fold.A hierarchical vehicle state machine decision model is proposed to enhance driving safety in emergency scenarios.Mathematical models for determining the transition thresholds of lateral and longitudinal vehicle states are established based on the vehicle potential field model,leading to the formulation of transition rules between different states of autonomous vehicles(AVs).

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

并联谐振晶闸管中频双控感应加热电源调功系统由整流和逆变两部分构成。调节整流单元的移相角,改变逆变单元的功率因数角都可影响谐振槽路的中频电压的输出,进而控制输出功率。在分析槽路中频逆变电压同晶闸管整流装置的移相角、逆变单元的功率因数角关系的基础上,提出了基于有限状态机(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.

基于Stateflow的焊接机器人协同规划策略

为了减少多焊接机器人协同规划过程的时间以及算力需求,提出了基于有限状态机理论的多焊接机器人协同规划方法。以汽车侧围总成为焊接对象,使用混合遗传-引力搜索算法(Genetic Algorithm-Gravitational Search Algorithm,GA-GSA)求解工作单元中各焊接机器人焊点分配问题,完成焊接路径规划。确认焊接过程中各焊接机器人间碰撞区域,以精确建立互斥区域,使用Stateflow工具对多焊接机器人系统进行建模与仿真。根据实际工况设置系统中各焊接机器人优先级输入以及每个焊点完成焊接任务所需时间,可得该工况下系统中焊接机器人动作最优调整方案。通过2个仿真案例验证了该方法的可行性与有效性,结果表明该方法可以快速有效地完成多焊接机器人协同规划。

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.

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.

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.

State space optimization of finite state machines from the viewpoint of control theory

Motivated by the inconvenience or even inability to explain the mathematics of the state space optimization of finite state machines(FSMs)in most existing results,we consider the problem by viewing FSMs as logical dynamic systems.Borrowing ideas from the concept of equilibrium points of dynamic systems in control theory,the concepts of t-equivalent states and t-source equivalent states are introduced.Based on the state transition dynamic equations of FSMs proposed in recent years,several mathematical formulations of t-equivalent states and t-source equivalent states are proposed.These can be analogized to the necessary and sufficient conditions of equilibrium points of dynamic systems in control theory and thus give a mathematical explanation of the optimization problem.Using these mathematical formulations,two methods are designed to find all the t-equivalent states and t-source equivalent states of FSMs.Further,two ways of reducing the state space of FSMs are found.These can be implemented without computers but with only pen and paper in a mathematical manner.In addition,an open question is raised which can further improve these methods into unattended ones.Finally,the correctness and effectiveness of the proposed methods are verified by a practical language model.

基于FSM的协议一致性测试序列生成算法研究

在通信协议的一致性测试领域里,如何生成满足要求的测试序列一直是研究热点之一。针对生成的测试序列不够简捷高效的问题,在介绍了通信协议的主要形式化模型FSM后,先研究了基于UIO的测试序列生成算法,然后对原算法进行了改进。改进后的算法所生成的测试序列具有较高的错误覆盖率,并且能够缩短测试序列的长度。

Stateflow在巡航导弹仿真中的应用

介绍了Stateflow的基础知识和基本用法以及基于Stateflow的巡航导弹仿真建模方法。Stateflow是一种基于MATLAB/Simulink和有限状态机理论的图形化离散事件仿真环境,巡航导弹分段弹道模型和制导引信系统都可以很方便的用Stateflow进行建模,使系统仿真更加直观,便捷。

EFSM可执行状态验证序列的生成

在以扩展有限状态机(EFSM)为模型描述的协议一致性测试系统中,为了解决状态验证序列的可执行性问题,提出了一种新的可执行状态验证序列(ESIS)生成算法.新算法基于宽度优先搜索可执行分析树(EAT)的思想,从状态验证需求的角度,在EFSM的状态格局投影子空间中,采用分步计算的方式生成具体验证场景下的最短可执行状态验证序列,从而减少了在完全状态格局空间中单步计算所有状态验证序列的复杂性.实验结果表明了新算法对生成EFSM可执行状态验证序列是有效的.

基于FSM模型的车载MOST网络管理系统

设计并实现一种基于有限状态机(FSM)模型的车载MOST网络管理系统。采用中心注册机制管理MOST网络地址资源,通过动态分配各节点的逻辑地址实现多媒体设备即插即用的工作方式,构造FSM模型描述MOST网络系统的状态。测试结果表明,该系统可增强车载MOST网络的灵活性、健壮性和容错性,满足车载信息娱乐系统对即插即用工作方式的需求。