Issue No. 08 - August (1988 vol. 14)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.7623
<p>Using Ada as a representative distributed programming language, the author discusses some ideas on complexity metrics that focus on Ada tasking and rendezvous. Concurrently active rendezvous are claimed to be an important aspect of communication complexity. A Petri net graph model of Ada rendezvous is used to introduce a rendezvous graph, an abstraction that can be useful in viewing and computing effective communication complexity.</p>
concurrently active rendezvous; software engineering; software complexity; complexity metrics; Ada tasking; representative distributed programming language; communication complexity; Petri net graph model; Ada rendezvous; rendezvous graph; Ada; computational complexity; directed graphs; distributed processing; software engineering
S. Shatz, "Towards Complexity Metrics for Ada Tasking," in IEEE Transactions on Software Engineering, vol. 14, no. , pp. 1122-1127, 1988.