Research And Implementation On Graphical Design Method Of Concurrent Software Based On Ada

Concurrent becomes more important in today when distributed systems are used widely. However the reliable effective concurrent programs are more difficult to develop than consequent ones. The difficulties are because of their concurrent, which has become the bottleneck problem in concurrent and distributed systems.One graph surpasses thousands of words. The flowchart is a great success for sequential programs but can't work for concurrent ones. So people continue to investigate new tools. Such researches will contribute to increasing the productivity and improving the quality of concurrent softwares.It is hard to express concurrent programs graphically because all concurrent programs must involve synchronization, mutual exclusiveness and communications that occur frequently between tasks. Concurrent program has two characters: mutitask and communication, which make its expression complex excessively and difficult to draw and understand. So it is the present weakness in researches on graphical design method of concurrent software.Contra posed this status, the thesis dose more studies and researches on the rendezvous ordering graph of Ada programs, the concurrent software design language (CONDL) based on the mechanisms of communication on Ada and its graphical representation, lane representation. Based on what mentioned above, graphical unit and judge tree are brought forward. By using graphical unit, rules and arithmetic of judge tree, we can turn CONDL or lane representation to Ada program frame. It is good for the concurrent softwares' productivity and quality.After the introduction the main basal theories of the Ada programs, CONDL and its lane representation, the thesis covers some key technologies in more details. At last design principle and implementation are discussed thoroughly.