ISO/IEC 19501:2005(E)

Attributes

4.12.2.16 TimeEvent

A TimeEvent models the expiration of a specific deadline. Note that the time of occurrence of a time event instance; that is, the expiration of the deadline is the same as the time of its reception. However, it is important to note that there may be a variable delay between the time of reception and the time of dispatching (for example, due to queueing delays).

The expression specifying the deadline may be relative or absolute. If the time expression is relative and no explicit starting time is defined, then it is relative to the time of entry into the source state of the transition triggered by the event. In the latter case, the time event instance is generated only if the state machine is still in that state when the deadline expires.

Attributes

4.12.2.17 Transition

A transition is a directed relationship between a source state vertex and a target state vertex. It may be part of a compound transition, which takes the state machine from one state configuration to another, representing the complete response of the state machine to a particular event instance.

Transition is a child of ModelElement.

Associations

4.12.3 Well-FormednessRules

The following well-formedness rules apply to the State Machines package.

4.12.3.1CompositeState

[1]A composite state can have at most one initial vertex.

self.subvertex->select (v | v.oclIsKindOf(Pseudostate))->

select(p : Pseudostate | p.kind = #initial)->size <= 1

[2] A composite state can have at most one deep history vertex.

ISO/IEC 19501:2005(E)

[4]All transitions incoming a join vertex must originate in different regions of a concurrent state.

(self.kind = #join

and not oclIsKindOf(self.stateMachine, ActivityGraph)) implies

self.incoming->forAll (t1, t2 | t1<>t2 implies (self.stateMachine.LCA(t1.source, t2.source).

container.isConcurrent)

[5]A fork vertex must have at least two outgoing transitions and exactly one incoming transition.

(self.kind = #fork) implies

((self.incoming->size = 1) and (self.outgoing->size >= 2))

[6]All transitions outgoing a fork vertex must target states in different regions of a concurrent state.

(self.kind = #fork

and not oclIsKindOf(self.stateMachine, ActivityGraph)) implies self.outgoing->forAll (t1, t2 | t1<>t2 implies

(self.stateMachine.LCA(t1.target, t2.target). container.isConcurrent)

[7]A junction vertex must have at least one incoming and one outgoing transition.

(self.kind = #junction) implies

((self.incoming->size >= 1) and (self.outgoing->size >= 1))

[8]A choice vertex must have at least one incoming and one outgoing transition.

(self.kind = #choice) implies

((self.incoming->size >= 1) and (self.outgoing->size >= 1))

4.12.3.5StateMachine

[1]A StateMachine is aggregated within either a classifier or a behavioral feature. self.context.notEmpty implies

(self.context.oclIsKindOf(BehavioralFeature) or self.context.oclIsKindOf(Classifier))

[2]A top state is always a composite. self.top.oclIsTypeOf(CompositeState)

[3]A top state cannot be directly contained in any other state. self.top.container->isEmpty

[4]The top state cannot be the source of a transition.

(self.top.outgoing->isEmpty)

[5]If a StateMachine describes a behavioral feature, it contains no triggers of type CallEvent, apart from the trigger on the initial transition (see OCL for Transition [8]).

self.context.oclIsKindOf(BehavioralFeature) implies self.transitions->reject(