Concurrency – Rendezvous in Ada

adaconcurrency

In a test I was asked:

What elements present in the general form of a rendezvous are not present in Ada language?

I was a bit stumbled as I thought Ada fully supported rendezvous. Now it seems it doesn't. Can anyone tell me what are those elements?

Best Answer

The Ada rendezvous concept is based on the CSP rendezvous, so reading up on CSP may be a worthwhile.

An Ada rendezvous appears to provide more than a CSP rendezvous, so what you really lose out on is the ability to easily reason formally about the behaviour.

Incidentally, at university we were actually taught CSP using Occam syntax, since we had been taught Occam in our first year. We were also taught the Z notation along with Miranda (a functional language which was the precursor to Haskell).

Together, these provided a solid grounding in formal reasoning for software systems, both distributed and non-distributed.

Related Topic