Contents:
Primary Developers: Jackie Leung, Gang Zhou, Ye Zhou, Edward A. Lee,
Christopher Brooks
Ptolemy II can now generate C code for SDF, FSM and HDF models.
This new code generator consists of actor templates (called helpers)
that contain C code stubs that are stitched together. Only a subset
of actors have helpers, so only a subset of models can be converted
to C. Creating new helpers is fairly easy though. The code generator
has been written to be easily extensible to languages other than C.
This domain supports both conditional and multi-way rendezvous. In conditional rendezvous, an actor is willing to rendezvous with any one of several other actors. In multiway rendezvous, an actor requires rendezvous with multiple other actors at the same time. When using conditional rendezvous, the choice of which rendezvous occurs is nondeterministic, in general.
The model of computation is based on the Communicating Sequential Processesmodel first proposed by Hoare in 1978. Rendezvous-based communication is also known as synchronous message passing, but we avoid this term to avoid confusion with the SR (synchronous/reactive) domain.
Demonstrations - Javadoc: kernel, lib
Distributed Sleep Demo - Javadoc: actor, client, common, domains.sdf.kernel, rmi, util
In a relation group, there is no significance to the order in which relations are linked, unlike the order in which ports are linked to relations. Also, unlike links between relations and ports, there is no significance to multiple links between the same relations. Any two relations are either linked or not linked.