公开(公告)号：KR100942987B1

公开(公告)日：2010-02-17

申请号：KR1020080090355

申请日：2008-09-12

Applicant: 성균관대학교산학협력단

Inventor： 국태용 ,  이창윤 ,  조동면

IPC: G06F11/22 ,  G06F11/30 ,  G06F9/00 ,  G06F17/00

Abstract: PURPOSE: A method for test procedure optimize of robot software component is provided to have an efficient test procedure even if the number of test case is increased and the optimizing scheme of the test procedure gets complicated. CONSTITUTION: By back stepping from the final state(Exit) to the beginning state(RI) to find previous state for each test case. A test procedure is especially drawn each test case. The test procedure is classified based on the test case of the just before metastasizing to the final state as each group. With metastasizing to the state transition final state all state(SL1) find. With metastasizing to the angular states found in the first step all state (SL2) of the just before find. The state (RI,RA,RS), which is not overlapped with the state found in the first step immediately, all state (SL3) of the just before find. The state (RR), which is not overlapped with states found in the first, and the second step immediately, all state (SL4) of the just before find.

Abstract translation: 目的：提供机器人软件组件的测试程序优化方法，即使测试用例数量增加，测试过程的优化方案变得复杂，也具有有效的测试过程。 构成：通过从最终状态（退出）返回到开始状态（RI），以查找每个测试用例的先前状态。 每个测试用例特别绘制一个测试程序。 测试程序根据每组之前转移到最终状态的测试案例进行分类。 随着转移到状态转移最终状态全部状态（SL1）发现。 随着转移到第一步中发现的角状态，所有状态（SL2）刚刚发现。 与第一步骤中发现的状态不重叠的状态（RI，RA，RS）立即发现所有状态（SL3）。 状态（RR）与第一个状态中发现的状态不重叠，而第二个步骤立即与之前发现的所有状态（SL4）重叠。