정보처리학회논문지:소프트웨어 및 데이터공학 (KIPS Transactions on Software and Data Engineering)

  • 제2권7호
  • /
  • Pages.471-478
  • /
  • 2013
  • /
  • 2287-5905(pISSN)
  • /
  • 2734-0503(eISSN)
한국정보처리학회 (Korea Information Processing Society)
권호 표지
DOI QR코드

DOI QR Code

분할된 RRT 공간을 이용한 Simulink/Stateflow모델 테스트케이스 생성

Test-case Generation for Simulink/Stateflow Model using a Separated RRT Space

  • 박현상 (아주대학교 정보통신전문대학원 정보통신공학과) ;
  • 최경희 (아주대학교 정보통신전문대학원) ;
  • 정기현 (아주대학교 전자공학부)
  • 투고 : 2013.02.26
  • 심사 : 2013.04.08
  • 발행 : 2013.07.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 논문은 Rapidly-exploring Random Tree(RRT) 알고리즘을 이용한 Simulink/Stateflow 모델 기반의 블랙박스 테스트 케이스 자동 생성 기법을 제안한다. RRT는 복잡한 시스템의 경로 계획을 효율적으로 해결하는 좋은 방법으로 널리 사용되고 있다. 본 논문에서 제안하는 기법은 블랙박스 테스트 케이스 생성 시 해결해야 되는 도달 가능 문제를 RRT를 통해 해결하고자 한다. RRT를 이용하여 테스트 케이스를 생성 할 때의 가장 큰 단점은 Stateflow 모델의 내부 상태가 복잡한 시스템을 위한 RRT 확장 시 시간과 메모리 측면에서 많은 비용이 발생하게 된다는 점이다. 일반적인 RRT 기법이 대상 시스템을 단일한 RRT 공간으로 구성 하는 반면 제안된 기법에서는 대상 시스템을 Stateflow의 상태를 기준으로 동적 분할하여 RRT 공간을 모델링 구성 함으로써 RRT 확장 시 필요한 비용을 감소시켰다. 본 논문에서는 분할 RRT 공간을 위한 RRT 공간의 정의와, 거리 측정 기법, 테스트 케이스 생성 알고리즘을 제시한다. 또한, 예제 Stateflow 모델을 기반으로 한 테스트 케이스 생성실험을 통해 제안된 알고리즘의 성능을 보인다.

This paper proposes a black-box based test case generation method for Simulink/Stateflow model utilizing the RRT algorithm which is a method to efficiently solve the path planning for complicated systems. The proposed method in the paper tries to solve the reachability problem with the RRT algorithm, which has to be solved for black-box based test case generations. A major problem of the RRT based test case generation algorithms is that the cost such as running time and required memory size is too much for complicated Stateflow model. The typical RRT algorithm expands rapidly-exploring random tree (RRT) in a single state space. But the proposed method expands it in dynamic state space based on the state of Simulink model, consequently reducing the cost. In the paper, a new definition of RRT state space, a distance measure and a test case generation algorithm are proposed. The performance of proposed method is verified through the experiment against Stateflow model.

키워드

참고문헌

  1. MATLAB Simulink Stateflow http://www.mathworks.com/products/stateflow/1994-2012 The MathWorks, Inc.
  2. Reactis http://www.reactive-systems.com/products.msp Reactive Systems,Inc
  3. T-VEC tester http://www.t-vec.com/solutions/products.php T-VEC Technologies, Inc.
  4. Design Verifier http://www.mathworks.com/products/sldesignverifier/ Mathworks, Inc.
  5. H. S. Hong, I. S. Lee, O. Sokolsky, S. D. Cha, "Automatic Test Generation From Statecharts Using Model Checking" in Technical Report, Department of Computer & Information Science University of Pennsylvania MS-CIS-01-07, 2001.
  6. M. Satpathy, A. Yeolekar, S. Ramesh, "Randomized Directed Testing(REDIRECT) for Simulink/Stateflow Models" in Proceedings of the 8th ACM international conference on Embedded software pp.217-226, 2008.
  7. C.S. Pasareanu, "Model Based Analysis and Test Generation for Flight Software" in SMC-IT 2009, Third IEEE International Conference pp.83-90, 2009.
  8. J. S. Oh, M. Harman, S. Yoo, "Transition coverage Testing for Simulink/Stateflow Models Using Messy Genetic Algorithms" in Proceedings of the 13th annual conference on Genetic and evolutionary computation pp.1851-1858, 2011.
  9. P. Peranandam, S. Raviram, M. Satpathy, "An Integrated Test Generation Tool for Enhanced Coverage of Simulink/ Stateflow Models", Design, Automation & Test in Europe Conference & Exhibition, pp.308-311, 2012.
  10. R. Alur, "Model checking of hierarchical state machines" in Proceedings of the 6th ACM SIGSOFT FSE, Vol.23, Issue 6, pp.175-188, 1998.
  11. A. Agrawal, G. Simun, G. Karsai, "Semantic Translation of Simulink/Stateflow models to Hybrid Automata using Graph Transformations" in Proceedings of the Workshop on Graph Transformation and Visual Modelling Techniques Vol.109, pp.43-56, 2004.
  12. T. A. Henzinger, P. W. Kopke, A. Puri, P. Varaiya, "What's Decidable About Hybrid Automata?", Journal of Computer and System Sciences Vol.57, Issue.1, pp.94-124, 1998. https://doi.org/10.1006/jcss.1998.1581
  13. T. Brihaye, "A note on the undecidability of the reachability problem for o-minimal dynamical systems" in Mathematical Logic Quarterly, Vol.52, Issue.2, pp.165-170, 2006. https://doi.org/10.1002/malq.200510024
  14. J.M. Esposito, J. Kim, V. Kumar "A Probabilistic Approach to Automated Test Case Generation for Hybrid Systems" in Hybrid Systems: Computation and Control, 2004.
  15. S. M. LaValle, "Rapidly-Exploring Random Trees: A New Tool for Path Planning" TR 98-11 Computer Science Dept., Iowa State Univ. , 1998.
  16. T. Dang, T. Nahhal, "Coverage-guided test generation for continuous and hybrid systems" in Formal Methods in System Design Vol.34, No.2, pp.183-213, 2009. https://doi.org/10.1007/s10703-009-0066-0
  17. J. M. Esposito, "Randomized Test Case Generation for Hybrid Systems: metric selection" in System Theory, Proceedings of the Thirty-Sixth Southeastern Symposium pp.236-240, 2004.
  18. J. Kim, "Adaptive Sample Bias for Rapidly-exploring Random Trees with Applications to Test Generation" in American Control Conference, Proceedings Vol.2, pp.1166-1172, 2005.
  19. T. Nahhal, T. Dang, "Test Generation For Analog And Mixed-Signal Circuits using Hybrid system models" in International Journal of VLSI Design & Communication Systems Vol.2, Issue.3, pp.21-38, 2011. https://doi.org/10.5121/vlsic.2011.2302
  20. S. M. LaValle, J. J. Kuffner. In B. R. Donald, K. M. Lynch, D. Rus, "Rapidly-exploring random trees: Progress and prospects.", Algorithmic and Computational Robotics: New Directions, pp.293-308. A K Peters, Wellesley, MA, 2001.
  21. MATLAB Simulink, Modeling an Automatic Transmission Controller, http://www.mathworks.co.kr/products/simulink/examples.html?file=/products/demos/shipping/simulink/sldemo_autotrans.html
  22. SAV Solving In General, http://www.satisfiability.org/
  23. K. L. McMillan, "Symbolic Model Checking-an Approach to the State Explosion Problem" Kluwer Academic Publishers, 1993.
  24. E.M. Clarke, E.A. Emerson, A.P. Sistla, "Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications", ACM Transitions on Programming Languages and Systems, Vol.8, No.2, pp.244-263, 1986 https://doi.org/10.1145/5397.5399
  25. C. S. Pasareanu, P. C. Mehlitz, D. H. Bushnell, K. G. Burlet, M. Lowry, S. Person, M. Pape, "Combining unit level symbolic execution and system level concrete execution for testing" NASA softwrae. In Proc. ISSTA'08 (to appear), 2008.
  26. T.A. Henzinger, "The Theory of Hybrid Automata" in Proceedings of Logic in Computer Science, Eleventh Annual IEEE Symposium pp.278-292, 1996.
  27. "Star Discrepancy." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/StarDiscrepancy.html
  28. J. C. Gower "A general coefficient of similarity and some of its properties" in Biometrics, Vol.27, pp.857-871, 1971. https://doi.org/10.2307/2528823
  29. K. J. Hayhurst, D. S. Veerhusen, J. J. Chilenski, L. K. Rierson, "A Practical Tutorial on Modified Condition/ Decision Coverage", NASA, 2001.