Advertisement

Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

ρ Graph: Rendezvous ordering graph for Ada concurrent programs

  • 21 Accesses

Abstract

In disciplined Ada software development and maintenance, an adequate and suitable graphical representation for concurrency is important. To describe rendezvous ordering, tasking and executing flow of tasks, ρ graph—Rendezvous Ordering Graph is presented in this paper. ρ graph is a kind of hierarchical oriented graph with nodes representing rendezvouses and edges showing ordering relations between rendezvouses as well as flow of tasks. It can be used in software understanding, design description and documentation.

This is a preview of subscription content, log in to check access.

References

  1. [1]

    Booch G. Software Engineering with Ada. Benjamin/Cummings Publishing Company, Inc., 1987.

  2. [2]

    Buhr R. System Design with Ada. Prentice-Hall, Inc., New Jersey, 1984.

  3. [3]

    Burkhardt B, Lee M. Drawing Ada structure charts.ACM Ada Letters, 1986, 3: 71–80.

  4. [4]

    Sterne Det al. A simplified graphic notation for Ada programs,ACM Ada Letters, 1989, 9(6): 108–118.

  5. [5]

    Shatz S M. Towards complexity metrics for Ada tasking.IEEE Trans. Software Engineering, 1989, 14: 1122–1127.

  6. [6]

    Shatz S M, Cheng W K. A Petri net framework for automated static analysis of Ada tasking behaviour.Journal of Systems and Software, 1988, 8: 343–359.

  7. [7]

    Dameria S, Shatz S M. Software complexity and Ada rendezvouses: Metrics based on nondeterminism.Journal of Systems and Software, 1992, 17: 119–127.

  8. [8]

    Wang Z, Chen L. Ada concurrent complexity metrics based on rendezvous relations. InProceedings of Eighteenth Annual International Computer Software and Applications Conference, 1994, Taipei:IEEE Computer Press, 1994.

  9. [9]

    DoD. ADA Language Reference Manual. ANSI-1815A, 1983.

  10. [10]

    DoD. ADA 95 Language Reference Manual. 1995.

Download references

Author information

Correspondence to Zhenyu Wang.

Additional information

Project supported by the National Natural Science Foundation of China.

Wang Zhenyu is a Professor. His research interests include software engineering, Ada language, tool and environment.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Wang, Z. ρ Graph: Rendezvous ordering graph for Ada concurrent programs. J. of Comput. Sci. & Technol. 13, 615–622 (1998). https://doi.org/10.1007/BF02946505

Download citation

Keywords

  • Ada concurrent program
  • rendezvous relation
  • rendezvous ordering graph