Method Detail

• getKind

  PseudostateKind getKind()

  Returns the value of the 'Kind' attribute. The default value is "initial". The literals are from the enumeration PseudostateKind. Determines the precise type of the Pseudostate and can be one of: entryPoint, exitPoint, initial, deepHistory, shallowHistory, join, fork, junction, terminate or choice.

  Returns:

  the value of the 'Kind' attribute.

  See Also:

  PseudostateKind, setKind(PseudostateKind), UMLPackage.getPseudostate_Kind()

• setKind

  void setKind(PseudostateKind value)

  Sets the value of the 'Kind' attribute.

  Parameters:

  value - the new value of the 'Kind' attribute.

  See Also:

  PseudostateKind, getKind()

• getStateMachine

  StateMachine getStateMachine()

  Returns the value of the 'State Machine' container reference. It is bidirectional and its opposite is 'Connection Point'. The StateMachine in which this Pseudostate is defined. This only applies to Pseudostates of the kind entryPoint or exitPoint.

  Returns:

  the value of the 'State Machine' container reference.

  See Also:

  setStateMachine(StateMachine), UMLPackage.getPseudostate_StateMachine(), StateMachine.getConnectionPoints()

• setStateMachine

  void setStateMachine(StateMachine value)

  Sets the value of the 'State Machine' container reference.

  Parameters:

  value - the new value of the 'State Machine' container reference.

  See Also:

  getStateMachine()

• getState

  State getState()

  Returns the value of the 'State' container reference. It is bidirectional and its opposite is 'Connection Point'. The State that owns this pseudostate and in which it appears.

  Returns:

  the value of the 'State' container reference.

  See Also:

  setState(State), UMLPackage.getPseudostate_State(), State.getConnectionPoints()

• setState

  void setState(State value)

  Sets the value of the 'State' container reference.

  Parameters:

  value - the new value of the 'State' container reference.

  See Also:

  getState()

• validateInitialVertex

  boolean validateInitialVertex(DiagnosticChain diagnostics,
                                Map context)

  An initial vertex can have at most one outgoing transition. (self.kind = #initial) implies (self.outgoing->size <= 1)

• validateHistoryVertices

  boolean validateHistoryVertices(DiagnosticChain diagnostics,
                                  Map context)

  History vertices can have at most one outgoing transition. ((self.kind = #deepHistory) or (self.kind = #shallowHistory)) implies (self.outgoing->size <= 1)

• validateJoinVertex

  boolean validateJoinVertex(DiagnosticChain diagnostics,
                             Map context)

  In a complete statemachine, a join vertex must have at least two incoming transitions and exactly one outgoing transition. (self.kind = #join) implies ((self.outgoing->size = 1) and (self.incoming->size >= 2))

• validateTransitionsIncoming

  boolean validateTransitionsIncoming(DiagnosticChain diagnostics,
                                      Map context)

  All transitions incoming a join vertex must originate in different regions of an orthogonal state. (self.kind = #join) implies self.incoming->forAll (t1, t2 | t1<>t2 implies (self.stateMachine.LCA(t1.source, t2.source).container.isOrthogonal))

• validateForkVertex

  boolean validateForkVertex(DiagnosticChain diagnostics,
                             Map context)

  In a complete statemachine, 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))

• validateTransitionsOutgoing

  boolean validateTransitionsOutgoing(DiagnosticChain diagnostics,
                                      Map context)

  All transitions outgoing a fork vertex must target states in different regions of an orthogonal state. (self.kind = #fork) implies self.outgoing->forAll (t1, t2 | t1<>t2 implies (self.stateMachine.LCA(t1.target, t2.target).container.isOrthogonal))

• validateJunctionVertex

  boolean validateJunctionVertex(DiagnosticChain diagnostics,
                                 Map context)

  In a complete statemachine, 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))

• validateChoiceVertex

  boolean validateChoiceVertex(DiagnosticChain diagnostics,
                               Map context)

  In a complete statemachine, 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))

• validateOutgoingFromInitial

  boolean validateOutgoingFromInitial(DiagnosticChain diagnostics,
                                      Map context)

  The outgoing transition from and initial vertex may have a behavior, but not a trigger or a guard. (self.kind = #initial) implies (self.outgoing.guard->isEmpty() and self.outgoing.trigger->isEmpty())