In: IEEE Transactions of Software Engineering, Vol. 14, No. 8, pages 1122-1127. 1988.
Abstract: 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.