Skip to main content
SpringerLink
Log in

ρ Graph: Rendezvous ordering graph for Ada concurrent programs

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

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 via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

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

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  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.

    Article  Google Scholar 

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

    Article  Google Scholar 

  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.

    Google Scholar 

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

  10. DoD. ADA 95 Language Reference Manual. 1995.

Download references

Author information

Authors and Affiliations

  1. Wuhan Digital Engineering Institute, 430074, Wuhan, P.R. China

    Wang Zhenyu

Authors
  1. Wang Zhenyu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wang Zhenyu.

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

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02946505

Keywords

Search

Navigation