作者机构：
[Wang, ZJ; Wang, ZY; Chen, L] CENT CHINA NORMAL UNIV,DEPT COMP SCI,WUHAN 430070,PEOPLES R CHINA.;[Wang, ZY] WUHAN DIGITAL ENGN INST,WUHAN 430074,PEOPLES R CHINA.
通讯机构：
[Wang, ZY] W;WUHAN DIGITAL ENGN INST,WUHAN 430074,PEOPLES R CHINA.
关键词：
Ada program complexity;concurrent program;rendezvous;successive relation;nesting relation
摘要：
Concurrency of a multi-task program is presented by its communicating and synchronizing behavior between tasks. In Ada, this behavior is expressed as rendezvous relations between them. Difficulties in understanding a program lie in understanding their rendezvouses and relations between them. Rendezvous successive and nesting relations are introduced. Successive graph and nesting tree are used for modeling these relations. Finally, it is proposed that concurrent complexity CC(P) of an Ada program P is a weighted sum of successive complexity SC(P) and nesting complexity NC(P), and SC(P) is the sum of edge numbers of rendezvous successive graphs and NC(P) is the sum of weighted node numbers on rendezvous nesting trees constructed from rendezvous relations which can be identified statically in Ada program text.
