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

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

Compositional Analysis of Petri Net Models using Petri net Slices

페트리네트 Slice를 이용한 페트리네트 모델의 합성적 분석

  • 이우진 (한국전자통신연구원 실시간컴퓨팅연구부) ;
  • 차성덕 (한국과학기술원 전산학과) ;
  • 권용래 (한국과학기술원 전산학과) ;
  • 김흥남 (한국전자통신연구원 실시간컴퓨팅연구부)
  • Published : 2000.03.15
Download PDF
⟨ Previous Next ⟩

Abstract

Place/Transition(P/T) nets has been used in protocol verification and concurrent system verification since it is suitable for describing concurrency and provides several well-established verification techniques. And it has been used as a base formalism for such high-level Petri nets as colored Petri nets, object-oriented Petri nets and etc. However, when analyzing complex models using P/T nets and P/T nets-based high-level Petri nets, there may be state explosion in reachability analysis due to improper handling of concurrency. In this paper, we define a structural concurrency in P/T nets, propose a partitioning algorithm based on the detected structural concurrency, and provide analysis techniques for such properties as boundedness of places and liveness of transitions, which are performed on compositional reachability graphs. The analysis techniques based on Petri net slices can be used in efficiently analyzing P/T nets-based high-level Petri net models as well as P/T net models.

Place/Transition(P/T) nets은 병행성 기술이 용이하고 도달성 분석 등 다양한 분석 방법이 제공되므로 프로토콜, 병행적 시스템 검증 등에 많이 이용되어 왔으며 또한 실시간 시스템, 객체지향 시스템 등 다양한 분야에 이용되는 고급 Petri nets과 객체 지향 Petri nets 등의 기반 정형적 기법으로 이용되고 있다. 하지만 P/T nets과 확장된 Petri nets 등에서는 모델에 내재된 병행성을 다루지 않으면 복잡한 병행적 모델의 도달성 분석 시에 시스템 상태가 급증하는 상태 폭발(state explosion)이 발생할 수 있다. 이 연구에서는 다양한 확장된 고급 Petri nets의 근간이 되는 P/T net 모델에서 구조적 병행성을 정의하고 이를 기반으로 시스템을 병행적인 단위로 분할, 합성적인 도달성 그래프를 생성하는 방법을 제시하여 복잡한 P/T net 모델을 효율적으로 분석할 수 있는 방법을 제시한다. 그리고 합성적 도달성 그래프를 이용하여 플레이스의 유한성, 트랜지션의 수행가능성 등의 특성을 효율적으로 분석할 수 있도록 한다. 이러한 분할 분석 기법은 P/T net 모델 뿐만 아니라 P/T nets에 기반을 두고 있는 모든 고급 Petri net model 분석에도 이용될 수 있다.

Keywords

References

  1. T. Suzuki, S.M. Shatz, 'A Protocol Modeling and Verification Approach Based on a Specification Language and Petri Nets,' IEEE Trans. on Software Engineering, Vol. 16, No. 5, pp. 523-536, May 1990 https://doi.org/10.1109/32.52775
  2. C. Ghezzi, D. Mandrioli, S. Modasca, and M. Pezze, 'A Unified High-Level Petri Net Formalism for Timed-Critical Systems,' IEEE Trans. on Software Engineering, Vol. 17, No. 2, pp. 160-172, 1991 https://doi.org/10.1109/32.67597
  3. G. Bucci and E. Vicario, 'Compositional Validation of Time-Critical Systems Using Communicating Time Petri Nets,' IEEE Trans. on Software Engineering, Vol 21, No.12, pp. 969-992, Dec. 1995 https://doi.org/10.1109/32.489073
  4. Wei Jen Yeh, Controlling State Explosion in Reachability Analysis, PhD. Thesis, Purdue University, Dec. 1993
  5. Wolfgang Reisig, Petri Nets: An Introduction, Springer-Verlag, 1985
  6. James L. Peterson, Petri Net Theory and The Modeling of Systems, Prentice-Hall, 1981
  7. K. Jensen, Coloured Petri Nets: Basic Concepts, Analysis methods and Practical Use, Volume 1, Springer-Verlag, 1992
  8. H.J. Genrich, 'Predicate/Transition Nets,' Petri Nets: Applications and Relationships to other Models of Concurrency(ed. W. Brauer, W. Reisig, and G. Rozenberg), pp. 207-247, Springer-Verlag, 1987
  9. E. Battiston and F.D. Cindio, 'Class Orientation and Inheritance in Modular Algebraic Nets,' Proceedings of IEEE Conference on System, Man, and Cybernetics, Vol. 2, pp. 712-723, Oct. 1993 https://doi.org/10.1109/ICSMC.1993.384960
  10. A. Perkusich and J. Figueiredo, 'G-Nets: a Petri Net Based Approach for Logical and Timing Analysis of Complex Software Systems,' Journal of System and Software, Vol. 39, pp. 39-59, 1997 https://doi.org/10.1016/S0164-1212(96)00162-8
  11. W.J. Lee, S.D. Cha, and Y.R. Kwon, 'Integration and Analysis of Use Cases Using Modular Petri Nets in Requirements Engineering,' IEEE Trans. On Software Engineering, Vol. 24. No. 12, pp. 1115-1130, Dec. 1998 https://doi.org/10.1109/32.738342
  12. W. Damm, G. Dohmen, V. Gerstner and B. Josko, 'Modular Verification of Petri Nets,' LNCS #430, 1989 https://doi.org/10.1007/3-540-52559-9_65
  13. S. Christensen and L. Petrucci, 'Modular State Space Analysis of Coloured Petri Nets,' Applications and Theory of Petri Nets '95(LNCS #935), 1995 https://doi.org/10.1007/3-540-60029-9_41
  14. R.Miler, Communication and Concurrency, Prentice-Hall, 1989
  15. Masato Notomi and Tadao Murata, 'Hierarchical Reachability Graph of Bounded Petri Nets for Concurrent-Software Analysis,' IEEE Trans. On Software Engineering, Vol. 20, No. 5, May 1994 https://doi.org/10.1109/32.286423