By Topic

Ada concurrent complexity metrics based on rendezvous relations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wang Zhenyu ; China State Shipbuilding Corp., Wuhan, China ; Chen Li

The most important factors influencing complexity of a concurrent program are communicating and synchronizing behaviours between tasks. In Ada program, these behaviours are expressed as rendezvous and relations between rendezvous. This paper investigates rendezvous successive and nesting relations, introduces the successive graph for successive relation and nesting tree for nesting relation, and gives the methods for constructing the graphs and trees. Some properties of the graph and the tree are given. Finally, the paper proposes that the concurrent complexity of a program is a weighted sum of the rendezvous successive complexity and nesting complexity and in turn, they are the sum of edge numbers of rendezvous successive graphs and sum of weighted node numbers on rendezvous nesting trees respectively

Published in:

Computer Software and Applications Conference, 1994. COMPSAC 94. Proceedings., Eighteenth Annual International

Date of Conference:

9-11 Nov 1994