Journal of KIISE:Software and Applications (한국정보과학회논문지:소프트웨어및응용)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

An Abstraction Method for State Minimization based on Syntactic and Semantic Patterns in the Execution Space of Real-Time Systems

실시간 시스템의 실행 공간상에서 구문 및 의미패턴에 기반한 상태 최소화를 위한 추상화 방법

  • 박지연 (전북대학교 컴퓨터통계정보학과) ;
  • 조기환 (전북대학교 전자정보공학부) ;
  • 이문근 (전북대학교 전자정보공학부)
  • Published : 2003.02.01
Download PDF
⟨ Previous Next ⟩

Abstract

States explosion due to composition of spaces of data, temporal, and locational values is one of the well-known critical problems which cause difficulty in understanding and analysing real-time systems specified with state-based formal methods. In order to overcome this problem, this paper presents an abstraction method for state minimization based on an abstraction in system specification and an abstraction in system execution. The first is named the syntactic in system specification and an abstraction in system execution. The first is named the syntactic abstraction, through which the patterns of the unconditionally internalized computation and the repetition and selection structures are abstracted. The latter is named the semantic abstraction, through which the patterns of the execution space represented with data. Through the abstractions, the components of a system in specification and execution model is hierarchically organized. The system can be analyzed briefly in the upper level in an skeleton manner with low complexity. The system, however, can be abstraction method for the state minimization and the decrease in analysis complexity through the abstraction with examples.

정형기법을 사용하여 실시간 시스템을 명세할 때. 상태 기반 정형 기법이 가지는 큰 문제 중의 하나는 시간 값. 자료 값, 위치 값을 통한 상대 표현으로 발생하는 상태 폭발이다. 본 논문에서는 상태 폭발 문제를 접근하기 위해, 시스템의 명세에 적용하는 추상화와, 명세된 시스템의 실행에 적용하는 추상화 기법을 정의하였다. 명세 구문에 정의한 추상화를 추문 추상화라 정의하고 명세 구문이 가진 패턴(연산 정보, 구조)을 정의하여 추상화한다. 실행에 적용되는 추상화는 의미 추상화라 정의하고 실행 시 생성되는 시간, 자료, 위치 상태 값이 파진 실행 의미의 패턴을 추상화한다. 추상화를 통하여 명세 모델과 실행 모델에 계층을 생성하여 상위 계층에서는 복잡도가 낮은 단계에서 시스템의 개략적인 정보를 분석할 수 있다. 하위 계층에서는 정확도가 높은 분석을 수행할 수 있는 반면에 많은 상태를 살펴야되기 때문에 높은 복잡도를 가진다. 본 논문에서는 추상화의 정의와 더불어, 적용 사례를 통하여 상태 감소와 계층성 생성, 복잡도 감소를 보인다.

Keywords

References

  1. E. M. Clarke, E. A. Emerson and A. P. Sistla, Automatic Verification of Finite-State Concurrent Systems using Temporal Logic Specifications, ACM Transactions on Programming Languages and Systems, pp.244-263, April 1986.8 https://doi.org/10.1145/5397.5399
  2. W. J. Yeh and M. Young, Compositional Reachability Analysis using Process Algebra, Proc. of Conf. on Testing, Analysis and Verification, pp.49-59, August 1992 https://doi.org/10.1145/120807.120812
  3. I. Kang and I. Lee, State Minimization for Concurrent System Analysis Based on State Space Exploration, Proc. of Conf. on Computer Assurance, pp.123-134, 1994 https://doi.org/10.1109/CMPASS.1994.318461
  4. S. Raju, An Automatic Verification Technique for Communicating Real-Time State Machines, Technical Report 93-04-08, Dept. of Computer Science and Engineering, Univ. of Washington, April, 1993
  5. R. Alur, C. Courcoubetis, N. Halbwachs, D.Dill, H. Wong-Toi, Minimization of Timed Transition Systems, In W. R. Cleaveland, editor, CONCUR'92: 3rd Intl. Conf. on Concurrency Theory, Lecture Notes in Computer Science, vol.630, Springer, pp.340-354, 1992 https://doi.org/10.1007/BFb0084802
  6. I. Kang, I. Lee and Y. Kim, An Efficient State Space Generation for the Analysis of Real-Time Systems, IEEE Transaction on Sofware Engineering, Vol.26, No.5, pp.453-477, May 2000 https://doi.org/10.1109/32.846302
  7. Edmund M. Clarke, Orna Grumberg and David E. Long, Model Checking and Abstraction, Proc. of the 19th Annual ACM Symposium on Principles of Programming Laguages, pp.343-354, Jannuary, 1992
  8. David Lee, Mihalis Yannakakis, Online Minimization of Transition Systems(Extended Abstract), Proc. 24th ACM Symposium on Theory of Computing, pp.264-274, May 1992 https://doi.org/10.1145/129712.129738
  9. Adan Aziz, Vigyan Singhal, Gitanjali M. Swamy, Minimizing Interacting Finite State Machines: A Compositional Approach to Language Containment, Proc. of Intl. Conf. on Computer Design, pp.255-263, October, 1994 https://doi.org/10.1109/ICCD.1994.331900
  10. 박지연, 이문근, 추상 시간 기계를 이용한 실시간 시스템의 도달성에 대한 검증 방법, 정보과학회논문지, 제28권 제3호, pp.224-238, 2001년3월
  11. 노경주, 박지연, 이문근, 추상시간기계를 기반으로한 실시간 시스템의 시간명세와 분석, 한국정보과학회 소프트웨어공학회지, 제13권 제3호, pp.45-54, 2000.9
  12. Kathe Fisler and Moshe Y. Vardi, Bisimulation Minimization in an Automata-Theoretic Verification Framework, Proceedings of International Conference on Formal Methods in Computer Aided Design, Lecture Notes in Computer Science, vol.1552, Springer-Verlag, pp.115-132, 1998
  13. E. M. Clarke, D. E. Long, K. L. McMillan, Compositional Model Checking, Proceedings of 4th Annual Symposium on Logic in Computer Science, pp.353-362, 1989
  14. Douglas L. Long, Lori A. Clarke, Task Interaction Graphs for Concurrency Analysis, Proceedings of the International Conference on Software Engineering, pp.44-54
  15. Jeffrey Fischer, Richard Gerber, Compositional Model Checking of Ada Tasking Porgrams, Proceedings of COMPASS'94, pp.135-147, 1994 https://doi.org/10.1109/CMPASS.1994.318460
  16. Fabrice Derepas, Paul Gastin, David Plainfosse, Avoiding Sate Explosion for Distributed Systems with Timestamps, Lecture Notes in Computer Science, vol.2021, pp.119-134, 2001
  17. Matthew B. Dwyer, David A. Schmidt, Limiting State Explosion with Filter-Based Refinement, Proceedings of the International Workshop on Verification Checking and Abstract Interpretation, 1997