Mapping CIRCAL-based algorithms to event logic

In this paper a new approach for implementing CIRCAL algorithms using event logic is presented. A high-level description of an algorithm is expressed in CIRCAL, a formal parallel hardware description language. The approach employs a transition signaling convention and a request-acknowledgment protocol under the bundled data model. The mapping approach is a syntax-directed one that will parse various CIRCAL constructs to their corresponding event logic. The mapping methodology is illustrated by an example.