A Study on Representation of Ada Tasking Execution Time Complexity using ATSN

ATSN을 이용한 Ada Tasking 실행 시간 복잡도 표현에 관한 연구

  • 이병복 (전북대학교 전자계산학과) ;
  • 유철중 (전북대학교 전자계산학과) ;
  • 김용성 (전북대학교 전자계산학과) ;
  • 장옥배 (전북대학교 전자계산학과)
  • Published : 1993.05.01


Marked Petri Net(MPN) is used to analyze communication complexity with respect to the maximum number of concurrently active rendezvous. But, because it cannot represent timed & probability characteristics explicitly, it is not used to analyze the new execution time of complexity with respect to the communication. Thus to effectively analyze that execution time complexity, we propose Ada Tasking Structure Nets (ATSN) introduced restrictive conditions : net reduction rules, execution time, and probability. Finally, we show the powers of analyze of communication complexity with ATSN.