Zhuge et al.

Evaluation

Ratings can take the form '+' which indicates that a particular tool or language provides direct support for the pattern involved, '+/-' which indicates that some limitations exists regaring direct support, and '-' which indicates that no direct support is provided. If support is not specified this is indicated by the label '0'.

Pattern Design Choice Score Comment
  System-specific Design Choices A[a,c] +/- partially supported
A Parameters of a pattern may be set at a build-time + supported
b instantiation time - not supported
c run-time + supported
B Time parameters can be specified in different time
granularities
a Basic - not supported
b System-defined - not supported
c User-defined - not supported
TP1 Time Lags between two Activities D[a,b,c], E[c*] +/- partially supported
D There are three kinds of restrictions a Minimum value + supported
b Maximum value + supported
c Time interval + supported as minimum and maximum are supported
E Time lags can be realized based on four different time relations a Start-Start - not supported
b Start-End - not supported
c End-Start +/- partially supported, only succeeding activities (flow constraint d(F_ij) < D_R(F_ij) < D(F_ij))
d End-End - not supported
TP2 Durations C[a], D[a,b,c] +/- partially supported
C Patterns can be applied to different process elements a Single activity + supported (duration constraint d(A) <= D_R(A) <= D(A))
b Activity set - not supported
c Process model - not supported
d Set of process instances - not supported
D There are three kinds of restrictions a Minimum value + supported
b Maximum value + supported
c Time interval + supported as minimum and maximum are supported
TP3 Time Lags between Arbitrary Events - events are not supported
D There are three kinds of restrictions a Minimum value -  
b Maximum value -
c Time interval -
TP4 Fixed Date Elements C[a], F[b] +/- partially supported
C Patterns can be applied to different process elements a Single activity + supported
c Process model - not supported
F Patterns can restrict three dates of a process artifact a Earliest start date - not supported
b Latest start date + supported (fixed-point constraints, S(A) < p)
c Earliest completion date - not supported
d Latest completion date - not supported
TP5 Schedule Restricted Element - not supported
C Patterns can be applied to different process elements a Single activity -  
c Process model -
F Patterns can restrict three dates of a process artifact a Earliest start date -
b Latest start date -
c Earliest completion date -
d Latest completion date -
TP6 Time Based Restrictions - not supported
G Time Based Restrictions can be applied to different types of process artifacts a activities within same process instance -  
b activities within different process instances -
c Instances of a process or group of processes -
H There are two kinds of restrictions a Minimum number of executions -
b Maximum number of executions -
I There are two types of restrictions which can be expressed by Time Based Restrictions a Number of concurrent executions -
b Number of executions per time period -
TP7 Validity Period C[a?], F[b?] 0 not discussed but can be supported similar to TP4
C Patterns can be applied to different process elements a Single activity 0 similar to TP4
c Process model - not supported
F Patterns can restrict three dates of a process artifact a Earliest start date - not supported
b Latest start date 0 similar to TP4
c Earliest completion date - not supported
d Latest completion date - not supported
TP8 Time Dependent Variability - not discussed
J There are different time aspects which may be considered by an instance of this pattern a Execution time of an activity / process instance -  
b Time lags between activities / events -
TP9 Cyclic Elements - not discussed
D There are three kinds of restrictions a Minimum value -  
b Maximum value -
c Time interval  
Time Lags can be realized based on four different time relations a Start-Start -
b Start-End -
c End-Start  
d End-End -
K Cyclic Elements may restrict the time lag between  a two directly succeeding iterations -
b two subsequent activity instances belonging to arbitrary iterations -
L Time Lag between cycles a is fixed -
b may vary -
TP10 Periodicity - not discussed
M The Number of cycles is a fixed / dynamic number of iterations -  
b depends on time lag and end date -
c depends on exit condition -