Gluon as Handle and Service Entry Point (SEP)

Add to 4.5.2 after line 419:

More generally, a Gluon can be thought of as a pointer into a Sequence, which is a time-related set of intervals. With Gluons and inheritance rules, missing scheduling information can be dynamically included in a Sequence.

If one considers the unscheduled Sequence and referencing Gluons as a subroutine or template, than a Gluon defines an instance or invocation of that template.

Several Gluons MAY exist (and be advertised) pointing into a given Sequence. When used in this manner, effectively each Gluon acts as a Service Entry Point for interacting with that template

Each Gluon (service entry point) may in turn be associated with additional information: a different price, a different schedule of availability, and so on. Alternately, a Gluon makes the entire instance associated with each entry point actionable by Scheduling that Sequence. (See Table 3-1).

If a Gluon includes Recurrence, that Recurrences is not inherited by the Sequence. Rather the sequence is invoked multiple times in accord with the rules of Recurrence. As an example, consider a Sequence that lacks only a StartDateTime to be Scheduled. Recurrence in the Gluon would define an array of StartDateTimes. The result can be computed by Scheduling that Sequence N times, once with each element in that array.

(As in Proposal)

Add to 4.5.2 after line 419:

More generally, a Gluon can be thought of as a pointer into a Sequence, which is a time-related set of intervals. With Gluons and inheritance rules, missing scheduling information can be dynamically included in a Sequence.

If one considers the unscheduled Sequence and referencing Gluons as a subroutine or template, than a Gluon defines an instance or invocation of that template.

Several Gluons MAY exist (and be advertised) pointing into a given Sequence. When used in this manner, effectively each Gluon acts as a Service Entry Point for interacting with that template

Each Gluon (service entry point) may in turn be associated with additional information: a different price, a different schedule of availability, and so on. Alternately, a Gluon makes the entire instance associated with each entry point actionable by Scheduling that Sequence. (See Table 3-1).

If a Gluon includes Recurrence, that Recurrences is not inherited by the Sequence. Rather the sequence is invoked multiple times in accord with the rules of Recurrence. As an example, consider a Sequence that lacks only a StartDateTime to be Scheduled. Recurrence in the Gluon would define an array of StartDateTimes. The result can be computed by Scheduling that Sequence N times, once with each element in that array.