摘要
从数学优化角度对软件测试问题进行探索性研究，将软件测试中的结构测试问题转化为一个组合最优化问题，然后利用Ｆｏｋｋｅｒ－Ｐｌａｎｃｋ方程的离散形式而得到的Ｍａｒｋｏｖ链为基础的一个算法求解．最后给出了几个测试实例的部分数值结果。
The authors make an attempt to study software testing from the view of mathematical optimization. The problem of structural testing of software testing is converted into a combinatorial optimization problem. Then an optimization algorithm based on the Markovian chain of thediscrete form of the Fokker-Planck equation is presented to solve the combinatorial optimization problem. Finally some numerical results of several testing cases are given.
关键词
软件测试
优化
F-P方程
马尔柯夫链
s: software testing
optimization
Warniers flow-charts
Markov chain
FokkerPlanck equation
