Representing Ada´s rendezvous by annotated Petri graphs

A variety of hardware design languages have included concurrent constructs as a means of defining the required device. Thus Hardware C provides processes which communicate via send and receive statements while Scholar provides a means of denoting parallel sections in a BCPL like language. These constructs however fall short of the expressive power of the ADA rendezvous. In particular the reusability of a design component is enhanced by the rendezvous. Previous work has been reported on the inclusion of the rendezvous construct in a synthesis system, the implementation approach advocated however does seem to imply a large area overhead. Here the author shows how an annotated Petri Net can be usefully used to derive efficient designs from reusable descriptions