Software Disclaimer

Class UML 2.3::ConnectionPointReference


A connection point reference represents a usage (as part of a submachine state) of an entry/exit point defined in the statemachine reference by the submachine state.

Direct Superclasses: Vertex

Direct Subclasses:

Class Precedence List: ConnectionPointReference, Vertex, NamedElement, Element


entry : Pseudostate (0 *); -- source ConnectionPointReference
exit : Pseudostate (0 *); -- source ConnectionPointReference

The exitPoints kind pseudo states corresponding to this connection point.

state : State (0 1); -- source ConnectionPointReference

The State in which the connection point refreshens are defined.
Subsets: NamedElement.namespace
Opposite: State.connection

container : Region (0 1); -- source Vertex

The region that contains this vertex.
Subsets: NamedElement.namespace
Opposite: Region.subvertex

incoming : Transition (0 *); -- source Vertex
outgoing : Transition (0 *); -- source Vertex
clientDependency : Dependency (0 *); -- source NamedElement
name : String (0 1); -- source NamedElement

The name of the NamedElement.

nameExpression : StringExpression (0 1); -- source NamedElement

The string expression used to define the name of this named element.
Subsets: Element.ownedElement

namespace : Namespace (0 1); -- source NamedElement
qualifiedName : String (0 1); -- source NamedElement

A name which allows the NamedElement to be identified within a hierarchy of nested Namespaces. It is constructed from the names of the containing namespaces starting at the root of the hierarchy and ending with the name of the NamedElement itself.
{readonly, derived}

visibility : VisibilityKind (0 1); -- source NamedElement
ownedComment : Comment (0 *); -- source Element
ownedElement : Element (0 *); -- source Element
owner : Element (0 1); -- source Element

The Element that owns this element.
Derived union with sources: (namespace, container, state)
Opposite: Element.ownedElement


Signature: exit_pseudostates() : Boolean;
Description: The exit Pseudostates must be Pseudostates with kind exitPoint.
Expression: exit->notEmpty() implies exit->forAll(e | e.kind = #exitPoint)

Signature: entry_pseudostates() : Boolean;
Description: The entry Pseudostates must be Pseudostates with kind entryPoint.
Expression: entry->notEmpty() implies entry->forAll(e | e.kind = #entryPoint)


No additional operations.

Send questions or comments to