TemporalRelationSpecification

Relation that specifies temporal constraints between pairs of Process Steps in a Sequence following Allen's interval algebra. A Sequence in the Process Model is a Control Construct in which the elements of the sequence (i.e. Process Steps) have positions on a timeline with respect to each other.
In Allen's interval algebra between Process Steps a and b there are seven possible relations. All but one are asymmetric and thus have a converse. The exception is the situation where two intervals are coextensive. Then the relation and its converse are the same, namely equal, which is an equivalence relation.
Explanatory Notes: 
Here are the relations in Allen's interval algebra:
a precedes b (p) and b is preceded by a (P)
a meets b (m) and b is met by a (M)
a overlaps b (o) and b is overlapped by a (O)
a is finished by b (F) and b finishes a (f)
a contains B (D) and b is during a (d)
a starts b (s) and b is started by a (S)
a and b equal (e) each other
There is no guarantee that a set of pairs will be tractable. A simple example of a collection of relations and intervals that is not tractable is three intervals a, b, and c such that a(p)b, b(p)c, and c(p)a (each precedes the next, and the last precedes the first). There are no definite intervals for which all these relations can hold. In this event we say that the collection is unsatisfiable.
That being said certain collections of pairwise relations are in fact composable. Composition is not commutative but is both left and right associative, and distributes over union. Collections that are composable support inference over their pairs. In fact, certain mixes of pairwise relations have been found to be composable over a collection. These mixes are call tractable subalgebras. Eighteen of these have been identified.
For a more in-depth discussion see http://www.ics.uci.edu/~alspaugh/cls/shr/allen.html.

Enumeration: 
Value: 
TemporalMeets
Description: 
A Meets Interval Relation. Representation of the meets relation in Allen's interval algebra. We say that an interval A meets another interval B if and only if A finishes when B begins. More precisely, A.ends = B.start. Instead of saying that A meets B we can also say that B is met by A (converse). An immediate-precedence relationship: Anti-Reflexive, Anti-Symmetric, Anti-Transitive
Value: 
TemporalContains
Description: 
A Contains Interval Relation. Representation of the contains relation in Allen's interval algebra. We say that an interval A contains another interval B if and only if A begins before B but finishes after it. More precisely, A.start < B.start < B.end < A.end. Instead of saying that A contains B we can also say that B is during A (converse). An asymmetric relationship: Anti-Reflexive, Anti-Symmetric, Transitive.
Value: 
TemporalFinishes
Description: 
A Finishes Interval Relation. Representation of the finishes relation in Allen's interval algebra. We say that an interval A finishes another interval B if and only if A begins after B but both finish at the same time. More precisely, B.start < A.start < B.end = A.end. Instead of saying that A finishes B we can also say that B is finished by A (converse). An asymmetric relationship: Anti-Reflexive, Anti-Symmetric, Transitive
Value: 
TemporalPrecedes
Description: 
A Precedes Interval Relation.Representation of the precedes relation in Allen's interval algebra. We say that an interval A precedes another interval B if and only if A finishes before B begins. More precisely, A.end < B.start. Instead of saying that A precedes B we can also say that B is preceded by A (converse). An asymmetric relationship: Anti-Reflexive, Anti-Symmetric, Transitive.
Value: 
TemporalStarts
Description: 
A Starts Interval Relation. Representation of the starts relation in Allen's interval algebra. We say that an interval A starts another interval B if and only if they both start at the same time but A finishes first. More precisely, A.start = B.start < A.end. An asymmetric relationship: Anti-Reflexive, Anti-Symmetric, Transitive.
Value: 
TemporalOverlaps
Description: 
A Overlaps Interval Relation. Representation of the overlaps relation in Allen's interval algebra. We say that an interval A overlaps another interval B if and only if A begins before B but finishes during B. More precisely, A.start < B.start < A.end < B.end. Instead of saying that A overlaps B we can also say that B is overlapped by A (converse). An acyclic precedence relationship: Anti-Reflexive, Anti-Symmetric, Neither
Value: 
TemporalEquals
Description: 
An Equals Interval Relation.Representation of the equals relation in Allen's interval algebra. We say that an interval A equals another interval B if and only if they both begin and finish at the same time. More precisely, A.start = B.start < A.end = B.end. Instead of saying that A equals B we can also say the B equals A (reflexive). An equivalence symmetric relationship: Reflexive, Symmetric, Transitive.
Package: 
EnumerationsRegExp
1