A read extent action is an action that retrieves the current instances of a classifier. The type of the result output pin is the classifier. OCL true The multiplicity of the result output pin is 0..*. OCL self.result.multiplicity.is(0,#null) The runtime instances of the classifier. The classifier whose instances are to be retrieved. A reclassify object action is an action that changes which classifiers classify an object. None of the new classifiers may be abstract. OCL not self.newClassifier->exists(isAbstract = true) The multiplicity of the input pin is 1..1. OCL self.argument.multiplicity.is(1,1) The input pin has no type. OCL self.argument.type->size() = 0 Specifies whether existing classifiers should be removed before adding the new classifiers. A set of classifiers to be removed from the classifiers of the object. A set of classifiers to be added to the classifiers of the object. Holds the object to be reclassified. A read is classified object action is an action that determines whether a runtime object is classified by a given classifier. The multiplicity of the input pin is 1..1. OCL self.object.multiplicity.is(1,1) The input pin has no type. OCL self.object.type->isEmpty() The multiplicity of the output pin is 1..1. OCL self.result.multiplicity.is(1,1) The type of the output pin is Boolean OCL self.result.type = Boolean Indicates whether the classifier must directly classify the input object. The classifier against which the classification of the input object is tested. After termination of the action, will hold the result of the test. Holds the object whose classification is to be tested. A start classifier behavior action is an action that starts the classifier behavior of the input. The multiplicity of the input pin is 1..1 OCL true If the input pin has a type, then the type must have a classifier behavior. OCL true Holds the object on which to start the owned behavior. A qualifier value is not an action. It is an element that identifies links. It gives a single qualifier within a link end data specification. The qualifier attribute must be a qualifier of the association end of the link-end data. OCL self.LinkEndData.end->collect(qualifier)->includes(self.qualifier) The type of the qualifier value input pin is the same as the type of the qualifier attribute. OCL self.value.type = self.qualifier.type The multiplicity of the qualifier value input pin is "1..1". OCL self.value.multiplicity.is(1,1) Attribute representing the qualifier for which the value is to be specified. Input pin from which the specified value for the qualifier is taken. The qualifiers include all and only the qualifiers of the association end. OCL self.qualifier->collect(qualifier) = self.end.qualifier The end object input pin is not also a qualifier value input pin. OCL self.value->excludesAll(self.qualifier.value) List of qualifier values A read link object end action is an action that retrieves an end object from a link object. The property must be an association end. OCL self.end.association.notEmpty() The association of the association end must be an association class. OCL self.end.Association.oclIsKindOf(AssociationClass) The ends of the association must not be static. OCL self.end.association.memberEnd->forall(e | not e.isStatic) The type of the object input pin is the association class that owns the association end. OCL self.object.type = self.end.association The multiplicity of the object input pin is 1..1. OCL self.object.multiplicity.is(1,1) The type of the result output pin is the same as the type of the association end. OCL self.result.type = self.end.type The multiplicity of the result output pin is 1..1. OCL self.result.multiplicity.is(1,1) Gives the input pin from which the link object is obtained. Link end to be read. Pin where the result value is placed. A read link object end qualifier action is an action that retrieves a qualifier end value from a link object. The qualifier attribute must be a qualifier attribute of an association end. OCL self.qualifier.associationEnd->size() = 1 The association of the association end of the qualifier attribute must be an association class. OCL self.qualifier.associationEnd.association.oclIsKindOf(AssociationClass) The ends of the association must not be static. OCL self.qualifier.associationEnd.association.memberEnd->forall(e | not e.isStatic) The type of the object input pin is the association class that owns the association end that has the given qualifier attribute. OCL self.object.type = self.qualifier.associationEnd.association The multiplicity of the qualifier attribute is 1..1. OCL self.qualifier.multiplicity.is(1,1) The multiplicity of the object input pin is 1..1. OCL self.object.multiplicity.is(1,1) The type of the result output pin is the same as the type of the qualifier attribute. OCL self.result.type = self.qualifier.type The multiplicity of the result output pin is 1..1. OCL self.result.multiplicity.is(1,1) Gives the input pin from which the link object is obtained. Pin where the result value is placed. The attribute representing the qualifier to be read. A create link object action creates a link object. The association must be an association class. OCL self.association().oclIsKindOf(Class) The type of the result pin must be the same as the association of the action. OCL self.result.type = self.association() The multiplicity of the output pin is 1..1. OCL self.result.multiplicity.is(1,1) Gives the output pin on which the result is put. A accept event action is an action that waits for the occurrence of an event meeting specified conditions. AcceptEventActions may have no input pins. OCL true There are no output pins if the trigger events are only ChangeEvents, or if they are only CallEvents when this action is an instance of AcceptEventAction and not an instance of a descendant of AcceptEventAction (such as AcceptCallAction). OCL true If the trigger events are all TimeEvents, there is exactly one output pin. OCL true If isUnmarshall is true, there must be exactly one trigger for events of type SignalEvent. The number of result output pins must be the same as the number of attributes of the signal. The type and ordering of each result output pin must be the same as the corresponding attribute of the signal. The multiplicity of each result output pin must be compatible with the multiplicity of the corresponding attribute. OCL true Indicates whether there is a single output pin for the event, or multiple output pins for attributes of the event. Pins holding the received event objects or their attributes. Event objects may be copied in transmission, so identity might not be preserved. The type of events accepted by the action, as specified by triggers. For triggers with signal events, a signal of the specified type or any subtype of the specified signal type is accepted. An accept call action is an accept event action representing the receipt of a synchronous call request. In addition to the normal operation parameters, the action produces an output that is needed later to supply the information to the reply action necessary to return control to the caller. This action is for synchronous calls. If it is used to handle an asynchronous call, execution of the subsequent reply action will complete immediately with no effects. The result pins must match the in and inout parameters of the operation specified by the trigger event in number, type, and order. OCL true The trigger event must be a CallEvent. OCL trigger.event.oclIsKindOf(CallEvent) isUnmrashall must be true for an AcceptCallAction. OCL isUnmarshall = true Pin where a value is placed containing sufficient information to perform a subsequent reply and return control to the caller. The contents of this value are opaque. It can be passed and copied but it cannot be manipulated by the model. A reply action is an action that accepts a set of return values and a value containing return information produced by a previous accept call action. The reply action returns the values to the caller of the previous call, completing execution of the call. The reply value pins must match the return, out, and inout parameters of the operation on the event on the trigger in number, type, and order. OCL true The event on replyToCall trigger must be a CallEvent replyToCallEvent.oclIsKindOf(CallEvent) OCL replyToCallEvent.oclIsKindOf(CallEvent) The trigger specifying the operation whose call is being replied to. A pin containing the return information value produced by an earlier AcceptCallAction. A list of pins containing the reply values of the operation. These values are returned to the caller. An unmarshall action is an action that breaks an object of a known type into outputs each of which is equal to a value from a structural feature of the object. The type of the object input pin must be the same as the unmarshall classifier. OCL true The multiplicity of the object input pin is 1..1 OCL true The number of result output pins must be the same as the number of structural features of the unmarshall classifier. OCL true The type and ordering of each result output pin must be the same as the corresponding structural feature of the unmarshall classifier. OCL true The multiplicity of each result output pin must be compatible with the multiplicity of the corresponding structural features of the unmarshall classifier. OCL true The unmarshall classifier must have at least one structural feature. OCL true unmarshallType must be a Classifier with ordered attributes OCL true The values of the structural features of the input object. The type of the object to be unmarshalled. The object to be unmarshalled. A reduce action is an action that reduces a collection to a single value by combining the elements of the collection. The type of the input must be a collection. OCL true The type of the output must be compatible with the type of the output of the reducer behavior. OCL true The reducer behavior must have two input parameters and one output parameter, of types compatible with the types of elements of the input collection. OCL true Behavior that is applied to two elements of the input collection to produce a value that is the same type as elements of the collection. Gives the output pin on which the result is put. The collection to be reduced. Tells whether the order of the input collection should determine the order in which the behavior is applied to its elements. StartObjectBehaviorAction is an action that starts the execution either of a directly instantiated behavior or of the classifier behavior of an object. Argument values may be supplied for the input parameters of the behavior. If the behavior is invoked synchronously, then output values may be obtained for output parameters. The type of the object input pin must be either a Behavior or a BehavioredClassifier with a classifier behavior. OCL true The multiplicity of the object input pin must be [1..1]. OCL true The number and order of the argument pins must be the same as the number and order of the in and in-out parameters of the invoked behavior. Pins are matched to parameters by order. OCL true The number and order of result pins must be the same as the number and order of the in-out, out and return parameters of the invoked behavior. Pins are matched to parameters by order. OCL true The type, ordering, and multiplicity of an argument or result pin must be the same as the corresponding parameter of the behavior. OCL true Holds the object which is either a behavior to be started or has a classifier behavior to be started. A create object action is an action that creates an object that conforms to a statically specified classifier and puts it on an output pin at runtime. The classifier cannot be abstract. OCL not (self.classifier.isAbstract = #true) The classifier cannot be an association class OCL not self.classifier.oclIsKindOf(AssociationClass) The type of the result pin must be the same as the classifier of the action. OCL self.result.type = self.classifier The multiplicity of the output pin is 1..1. OCL self.result.multiplicity.is(1,1) Classifier to be instantiated. Gives the output pin on which the result is put. A destroy object action is an action that destroys objects. The multiplicity of the input pin is 1..1. OCL self.target.multiplicity.is(1,1) The input pin has no type. OCL self.target.type->size() = 0 Specifies whether links in which the object participates are destroyed along with the object. Specifies whether objects owned by the object are destroyed along with the object. The input pin providing the object to be destroyed. A test identity action is an action that tests if two values are identical objects. The input pins have no type. OCL self.first.type->size() = 0 and self.second.type->size() = 0 The multiplicity of the input pins is 1..1. OCL self.first.multiplicity.is(1,1) and self.second.multiplicity.is(1,1) The type of the result is Boolean. OCL self.result.type.oclIsTypeOf(Boolean) Gives the pin on which an object is placed. Gives the pin on which an object is placed. Tells whether the two input objects are identical. A read self action is an action that retrieves the host object of an action. The action must be contained in an behavior that has a host classifier. OCL self.context->size() = 1 If the action is contained in an behavior that is acting as the body of a method, then the operation of the method must not be static. OCL true The type of the result output pin is the host classifier. OCL self.result.type = self.context The multiplicity of the result output pin is 1..1. OCL self.result.multiplicity.is(1,1) Gives the output pin on which the hosting object is placed. StructuralFeatureAction is an abstract class for all structural feature actions. The structural feature must not be static. OCL self.structuralFeature.isStatic = #false The structural feature must either be owned by the type of the object input pin, or it must be an owned end of a binary association with the type of the opposite end being the type of the object input pin. OCL self.structuralFeature.featuringClassifier.oclAsType(Type)->includes(self.object.type) or self.structuralFeature.oclAsType(Property).opposite.type = self.object.type The multiplicity of the object input pin must be 1..1. OCL self.object.lowerBound()=1 and self.object.upperBound()=1 Visibility of structural feature must allow access to the object performing the action. OCL let host : Classifier = self.context in self.structuralFeature.visibility = #public or host = self.structuralFeature.featuringClassifier.type or (self.structuralFeature.visibility = #protected and host.allSupertypes ->includes(self.structuralFeature.featuringClassifier.type))) A structural feature has exactly one featuringClassifier. OCL self.structuralFeature.featuringClassifier->size() = 1 Structural feature to be read. Gives the input pin from which the object whose structural feature is to be read or written is obtained. A read structural feature action is a structural feature action that retrieves the values of a structural feature. The type and ordering of the result output pin are the same as the type and ordering of the structural feature. OCL self.result.type = self.structuralFeature.type and self.result.ordering = self.structuralFeature.ordering The multiplicity of the structural feature must be compatible with the multiplicity of the output pin. OCL self.structuralFeature.multiplicity.compatibleWith(self.result.multiplicity) Gives the output pin on which the result is put. WriteStructuralFeatureAction is an abstract class for structural feature actions that change structural feature values. The type input pin is the same as the classifier of the structural feature. OCL self.value -> notEmpty() implies self.value.type.oclIsKindOf(Classifier) and self.structuralFeature.featuringClassifier->includes(self.value.type.oclAsType(Classifier)) The multiplicity of the input pin is 1..1. OCL self.value.multiplicity.is(1,1) The type of the result output pin is the same as the type of the inherited object input pin. OCL result->notEmpty() implies self.result.type = self.object.type The multiplicity of the result output pin must be 1..1. OCL result->notEmpty() implies self.result.multiplicity.is(1,1) Value to be added or removed from the structural feature. Gives the output pin on which the result is put. A clear structural feature action is a structural feature action that removes all values of a structural feature. The type of the result output pin is the same as the type of the inherited object input pin. OCL result->notEmpty() implies self.result.type = self.object.type The multiplicity of the result output pin must be 1..1. OCL result->notEmpty() implies self.result.multiplicity.is(1,1) Gives the output pin on which the result is put. A remove structural feature value action is a write structural feature action that removes values from structural features. Actions removing a value from ordered non-unique structural features must have a single removeAt input pin and no value input pin if isRemoveDuplicates is false. The removeAt pin must be of type Unlimited Natural with multiplicity 1..1. Otherwise, the action has a value input pin and no removeAt input pin. OCL if not self.structuralFeature.isOrdered or self.structuralFeature.isUnique or isRemoveDuplicates then self.removeAt -> isEmpty() and self.value -> notEmpty() else self.value -> isEmpty() and self.removeAt -> notEmpty() and self.removeAt.type = UnlimitedNatural and self.removeAt.lower = 1 and self.removeAt.upper = 1 endif Specifies whether to remove duplicates of the value in nonunique structural features. Specifies the position of an existing value to remove in ordered nonunique structural features. The type of the pin is UnlimitedNatural, but the value cannot be zero or unlimited. An add structural feature value action is a write structural feature action for adding values to a structural feature. Actions adding a value to ordered structural features must have a single input pin for the insertion point with type UnlimitedNatural and multiplicity of 1..1, otherwise the action has no input pin for the insertion point. OCL let insertAtPins : Collection = self.insertAt in if self.structuralFeature.isOrdered = #false then insertAtPins->size() = 0 else let insertAtPin : InputPin= insertAt->asSequence()->first() in insertAtPins->size() = 1 and insertAtPin.type = UnlimitedNatural and insertAtPin.multiplicity.is(1,1)) endif A value input pin is required. OCL self.value -> notEmpty() Specifies whether existing values of the structural feature of the object should be removed before adding the new value. Gives the position at which to insert a new value or move an existing value in ordered structural features. The type of the pin is UnlimitedNatural, but the value cannot be zero. This pin is omitted for unordered structural features. LinkAction is an abstract class for all link actions that identify their links by the objects at the ends of the links and by the qualifiers at ends of the links. The association ends of the link end data must all be from the same association and include all and only the association ends of that association. OCL self.endData->collect(end) = self.association()->collect(connection)) The association ends of the link end data must not be static. OCL self.endData->forall(end.oclisKindOf(NavigableEnd) implies end.isStatic = #false The input pins of the action are the same as the pins of the link end data and insertion pins. OCL self.input->asSet() = let ledpins : Set = self.endData->collect(value) in if self.oclIsKindOf(LinkEndCreationData) then ledpins->union(self.endData.oclAsType(LinkEndCreationData).insertAt) else ledpins Data identifying one end of a link by the objects on its ends and qualifiers. Pins taking end objects and qualifier values as input. The association operates on LinkAction. It returns the association of the action. OCL result = self.endData->asSequence().first().end.association A link end data is not an action. It is an element that identifies links. It identifies one end of a link to be read or written by the children of a link action. A link cannot be passed as a runtime value to or from an action. Instead, a link is identified by its end objects and qualifier values, if any. This requires more than one piece of data, namely, the statically-specified end in the user model, the object on the end, and the qualifier values for that end, if any. These pieces are brought together around a link end data. Each association end is identified separately with an instance of the LinkEndData class. The property must be an association end. OCL self.end.association->size() = 1 The type of the end object input pin is the same as the type of the association end. OCL self.value.type = self.end.type The multiplicity of the end object input pin must be 1..1. OCL self.value.multiplicity.is(1,1) Input pin that provides the specified object for the given end. This pin is omitted if the link-end data specifies an 'open' end for reading. Association end for which this link-end data specifies values. A read link action is a link action that navigates across associations to retrieve objects on one end. Exactly one link-end data specification (the 'open' end) must not have an end object input pin. OCL self.endData->select(ed | ed.value->size() = 0)->size() = 1 The type and ordering of the result output pin are same as the type and ordering of the open association end. OCL let openend : Property = self.endData->select(ed | ed.value->size() = 0)->asSequence()->first().end in self.result.type = openend.type and self.result.ordering = openend.ordering The multiplicity of the open association end must be compatible with the multiplicity of the result output pin. OCL let openend : Property = self.endData->select(ed | ed.value->size() = 0)->asSequence()->first().end in openend.multiplicity.compatibleWith(self.result.multiplicity) The open end must be navigable. OCL let openend : Property = self.endData->select(ed | ed.value->size() = 0)->asSequence()->first().end in openend.isNavigable() Visibility of the open end must allow access to the object performing the action. OCL let host : Classifier = self.context in let openend : Property = self.endData->select(ed | ed.value->size() = 0)->asSequence()->first().end in openend.visibility = #public or self.endData->exists(oed | not oed.end = openend and (host = oed.end.participant or (openend.visibility = #protected and host.allSupertypes->includes(oed.end.participant)))) The pin on which are put the objects participating in the association at the end not specified by the inputs. A link end creation data is not an action. It is an element that identifies links. It identifies one end of a link to be created by a create link action. LinkEndCreationData can only be end data for CreateLinkAction or one of its specializations. OCL self.LinkAction.oclIsKindOf(CreateLinkAction) Link end creation data for ordered association ends must have a single input pin for the insertion point with type UnlimitedNatural and multiplicity of 1..1, otherwise the action has no input pin for the insertion point. OCL let insertAtPins : Collection = self.insertAt in if self.end.ordering = #unordered then insertAtPins->size() = 0 else let insertAtPin : InputPin = insertAts->asSequence()->first() in insertAtPins->size() = 1 and insertAtPin.type = UnlimitedNatural and insertAtPin.multiplicity.is(1,1)) endif Specifies whether the existing links emanating from the object on this end should be destroyed before creating a new link. Specifies where the new link should be inserted for ordered association ends, or where an existing link should be moved to. The type of the input is UnlimitedNatural, but the input cannot be zero. This pin is omitted for association ends that are not ordered. A create link action is a write link action for creating links. The association cannot be an abstract classifier. OCL self.association().isAbstract = #false Specifies ends of association and inputs. A destroy link action is a write link action that destroys links and link objects. Specifies ends of association and inputs. WriteLinkAction is an abstract class for link actions that create and destroy links. The visibility of at least one end must allow access to the class using the action. OCL true A clear association action is an action that destroys all links of an association in which a particular object participates. The type of the input pin must be the same as the type of at least one of the association ends of the association. OCL self.association->exists(end.type = self.object.type) The multiplicity of the input pin is 1..1. OCL self.object.multiplicity.is(1,1) Gives the input pin from which is obtained the object whose participation in the association is to be cleared. Association to be cleared. A broadcast signal action is an action that transmits a signal instance to all the potential target objects in the system, which may cause the firing of a state machine transitions or the execution of associated activities of a target object. The argument values are available to the execution of associated behaviors. The requestor continues execution immediately after the signals are sent out. It does not wait for receipt. Any reply messages are ignored and are not transmitted to the requestor. The number and order of argument pins must be the same as the number and order of attributes in the signal. OCL true The type, ordering, and multiplicity of an argument pin must be the same as the corresponding attribute of the signal. OCL true The specification of signal object transmitted to the target objects. A send object action is an action that transmits an object to the target object, where it may invoke behavior such as the firing of state machine transitions or the execution of an activity. The value of the object is available to the execution of invoked behaviors. The requestor continues execution immediately. Any reply message is ignored and is not transmitted to the requestor. The target object to which the object is sent. The request object, which is transmitted to the target object. The object may be copied in transmission, so identity might not be preserved. A link end destruction data is not an action. It is an element that identifies links. It identifies one end of a link to be destroyed by destroy link action. LinkEndDestructionData can only be end data for DestroyLinkAction or one of its specializations. OCL true LinkEndDestructionData for ordered nonunique association ends must have a single destroyAt input pin if isDestroyDuplicates is false. It must be of type UnlimitedNatural and have a multiplicity of 1..1. Otherwise, the action has no input pin for the removal position. OCL true Specifies whether to destroy duplicates of the value in nonunique association ends. Specifies the position of an existing link to be destroyed in ordered nonunique association ends. The type of the pin is UnlimitedNatural, but the value cannot be zero or unlimited. A value specification action is an action that evaluates a value specification. The type of value specification must be compatible with the type of the result pin. OCL true The multiplicity of the result pin is 1..1 OCL true Value specification to be evaluated. Gives the output pin on which the result is put. An action with implementation-specific semantics. Specifies the action in one or more languages. Languages the body strings use, in the same order as the body strings Provides input to the action. Takes output from the action. A pin is a typed element and multiplicity element that provides values to actions and accept result values from them. A value pin is an input pin that provides a value by evaluating a value specification. The type of value specification must be compatible with the type of the value pin. OCL true Value that the pin will provide. An output pin is a pin that holds output values produced by an action. An input pin is a pin that holds input values to be consumed by an action. InvocationAction is an abstract class for the various actions that invoke behavior. Specification of the ordered set of argument values that appears during execution. CallAction is an abstract class for actions that invoke behavior and receive return values. Only synchronous call actions can have result pins. OCL true The number and order of argument pins must be the same as the number and order of parameters of the invoked behavior or behavioral feature. Pins are matched to parameters by order. OCL true The type, ordering, and multiplicity of an argument pin must be the same as the corresponding parameter of the behavior or behavioral feature. OCL true If true, the call is synchronous and the caller waits for completion of the invoked behavior. If false, the call is asynchronous and the caller proceeds immediately and does not expect a return values. A list of output pins where the results of performing the invocation are placed. A send signal action is an action that creates a signal instance from its inputs, and transmits it to the target object, where it may cause the firing of a state machine transition or the execution of an activity. The argument values are available to the execution of associated behaviors. The requestor continues execution immediately. Any reply message is ignored and is not transmitted to the requestor. If the input is already a signal instance, use a send object action. The number and order of argument pins must be the same as the number and order of attributes in the signal. OCL true The type, ordering, and multiplicity of an argument pin must be the same as the corresponding attribute of the signal. OCL true The target object to which the signal is sent. The type of signal transmitted to the target object. A call operation action is an action that transmits an operation call request to the target object, where it may cause the invocation of associated behavior. The argument values of the action are available to the execution of the invoked behavior. If the action is marked synchronous, the execution of the call operation action waits until the execution of the invoked behavior completes and a reply transmission is returned to the caller; otherwise execution of the action is complete when the invocation of the operation is established and the execution of the invoked operation proceeds concurrently with the execution of the calling behavior. Any values returned as part of the reply transmission are put on the result output pins of the call operation action. Upon receipt of the reply transmission, execution of the call operation action is complete. The number of argument pins and the number of owned parameters of the operation of type in and in-out must be equal. OCL true The number of result pins and the number of owned parameters of the operation of type return, out, and in-out must be equal. OCL true The type, ordering, and multiplicity of an argument or result pin is derived from the corresponding owned parameter of the operation. OCL true The type of the target pin must be the same as the type that owns the operation. OCL true The operation to be invoked by the action execution. The target object to which the request is sent. The classifier of the target object is used to dynamically determine a behavior to invoke. This object constitutes the context of the execution of the operation. A call behavior action is a call action that invokes a behavior directly rather than invoking a behavioral feature that, in turn, results in the invocation of that behavior. The argument values of the action are available to the execution of the invoked behavior. For synchronous calls the execution of the call behavior action waits until the execution of the invoked behavior completes and a result is returned on its output pin. The action completes immediately without a result, if the call is asynchronous. In particular, the invoked behavior may be an activity. The number of argument pins and the number of parameters of the behavior of type in and in-out must be equal. OCL true The number of result pins and the number of parameters of the behavior of type return, out, and in-out must be equal. OCL true The type, ordering, and multiplicity of an argument or result pin is derived from the corresponding parameter of the behavior. OCL true The invoked behavior. It must be capable of accepting and returning control. An action is a named element that is the fundamental unit of executable functionality. The execution of an action represents some transformation or processing in the modeled system, be it a computer system or otherwise. The ordered set of output pins connected to the Action. The action places its results onto pins in this set. The ordered set of input pins connected to the Action. These are among the total set of inputs. The classifier that owns the behavior of which this action is a part. The operation compatibleWith takes another multiplicity as input. It checks if one multiplicity is compatible with another. OCL result = Integer.allInstances()->forAll(i : Integer | self.includesCardinality(i) implies other.includesCardinality(i)) The operation is determines if the upper and lower bound of the ranges are the ones given. OCL result = (lowerbound = self.lowerbound and upperbound = self.upperbound) VariableAction is an abstract class for actions that operate on a statically specified variable. The action must be in the scope of the variable. OCL self.variable.isAccessibleBy(self) Variable to be read. A read variable action is a variable action that retrieves the values of a variable. The type and ordering of the result output pin of a read-variable action are the same as the type and ordering of the variable. OCL self.result.type =self.variable.type and self.result.ordering = self.variable.ordering The multiplicity of the variable must be compatible with the multiplicity of the output pin. OCL self.variable.multiplicity.compatibleWith(self.result.multiplicity) Gives the output pin on which the result is put. WriteVariableAction is an abstract class for variable actions that change variable values. The type input pin is the same as the type of the variable. OCL self.value -> notEmpty() implies self.value.type = self.variable.type The multiplicity of the input pin is 1..1. OCL self.value.multiplicity.is(1,1) Value to be added or removed from the variable. A clear variable action is a variable action that removes all values of a variable. An add variable value action is a write variable action for adding values to a variable. Actions adding values to ordered variables must have a single input pin for the insertion point with type UnlimtedNatural and multiplicity of 1..1, otherwise the action has no input pin for the insertion point. OCL let insertAtPins : Collection = self.insertAt in if self.variable.ordering = #unordered then insertAtPins->size() = 0 else let insertAtPin : InputPin = insertAt->asSequence()->first() in insertAtPins->size() = 1 and insertAtPin.type = UnlimitedNatural and insertAtPin.multiplicity.is(1,1)) endif A value input pin is required. OCL self.value -> notEmpty() Specifies whether existing values of the variable should be removed before adding the new value. Gives the position at which to insert a new value or move an existing value in ordered variables. The types is UnlimitedINatural, but the value cannot be zero. This pin is omitted for unordered variables. A remove variable value action is a write variable action that removes values from variables. Actions removing a value from ordered non-unique variables must have a single removeAt input pin and no value input pin if isRemoveDuplicates is false. The removeAt pin must be of type Unlimited Natural with multiplicity 1..1. Otherwise, the action has a value input pin and no removeAt input pin. OCL if not self.variable.isOrdered or self.variable.isUnique or isRemoveDuplicates then self.removeAt -> isEmpty() and self.value -> notEmpty() else self.value -> isEmpty() and self.removeAt -> notEmpty() and self.removeAt.type = UnlimitedNatural and self.removeAt.lower() = 1 and self.removeAt.upper() = 1 endif Specifies whether to remove duplicates of the value in nonunique variables. Specifies the position of an existing value to remove in ordered nonunique variables. The type of the pin is UnlimitedNatural, but the value cannot be zero or unlimited. A raise exception action is an action that causes an exception to occur. The input value becomes the exception object. An input pin whose value becomes an exception object. An action input pin is a kind of pin that executes an action to determine the values to input to another. The fromAction of an action input pin must have exactly one output pin. OCL true The fromAction of an action input pin must only have action input pins as input pins. OCL true The fromAction of an action input pin cannot have control or data flows coming into or out of it or its pins. OCL true The action used to provide values. An object node is an abstract activity node that is part of defining object flow in an activity. All edges coming into or going out of object nodes must be object flow edges. OCL true A control node is an abstract activity node that coordinates flows in an activity. An activity edge is an abstract class for directed connections between two activity nodes. The source and target of an edge must be in the same activity as the edge. OCL true Activity edges may be owned only by activities or groups. OCL true Activity containing the edge. Node from which tokens are taken when they traverse the edge. Node to which tokens are put when they traverse the edge. Groups containing the edge. Inherited edges replaced by this edge in a specialization of the activity. A control flow is an edge that starts an activity node after the previous one is finished. Control flows may not have object nodes at either end, except for object nodes with control type. OCL true An object flow is an activity edge that can have objects or data passing along it. Object flows may not have actions at either end. OCL true Object nodes connected by an object flow, with optionally intervening control nodes, must have compatible types. In particular, the downstream object node type must be the same or a supertype of the upstream object node type. OCL true Object nodes connected by an object flow, with optionally intervening control nodes, must have the same upper bounds. OCL true An initial node is a control node at which flow starts when the activity is invoked. An initial node has no incoming edges. OCL true Only control edges can have initial nodes as source. OCL true An activity final node is a final node that stops all flows in an activity. All nodes and edges of the group must be in the same activity as the group. OCL true No node or edge in a group may be contained by its subgroups or its containing groups, transitively. OCL true Groups may only be owned by activities or groups. OCL true Edges immediately contained in the group. An activity parameter node is an object node for inputs and outputs to activities. Activity parameter nodes must have parameters from the containing activity. OCL true The type of an activity parameter node is the same as the type of its parameter. OCL true An activity parameter node may have all incoming edges or all outgoing edges, but it must not have both incoming and outgoing edges. OCL true Activity parameter object nodes with no incoming edges and one or more outgoing edges must have a parameter with in or inout direction. OCL true Activity parameter object nodes with no outgoing edges and one or more incoming edges must have a parameter with out, inout, or return direction. OCL true A parameter with direction other than inout must have at most one activity parameter node in an activity. OCL true A parameter with direction inout must have at most two activity parameter nodes in an activity, one with incoming flows and one with outgoing flows. OCL true The parameter the object node will be accepting or providing values for. Activity nodes can only be owned by activities or groups. OCL true Edges that have the node as source. Edges that have the node as target. Inherited nodes replaced by this node in a specialization of the activity. A pin is an object node for inputs and outputs to actions. The nodes of the activity must include one ActivityParameterNode for each parameter. OCL true An activity cannot be autonomous and have a classifier or behavioral feature context at the same time. OCL true If true, this activity must not make any changes to variables outside the activity or to objects. (This is an assertion, not an executable property. It may be used by an execution engine to optimize model execution. If the assertion is violated by the action, then the model is ill-formed.) The default is false (an activity may make nonlocal changes). Edges expressing flow between nodes of the activity. Value pins have no incoming edges. OCL true A fork node is a control node that splits a flow into multiple concurrent flows. A fork node has one incoming edge. OCL true The edges coming into and out of a fork node must be either all object flows or all control flows. OCL true A flow final node is a final node that terminates a flow. A central buffer node is an object node for managing flows from multiple sources and destinations. An activity partition is a kind of activity group for identifying actions that have some characteristic in common. A partition with isDimension = true may not be contained by another partition. OCL true If a partition represents a part, then all the non-external partitions in the same dimension and at the same level of nesting in that dimension must represent parts directly contained in the internal structure of the same classifier. OCL true If a non-external partition represents a classifier and is contained in another partition, then the containing partition must represent a classifier, and the classifier of the subpartition must be nested in the classifier represented by the containing partition, or be at the contained end of a strong composition association with the classifier represented by the containing partition. OCL true If a partition represents a part and is contained by another partition, then the part must be of a classifier represented by the containing partition, or of a classifier that is the type of a part representing the containing partition. OCL true Tells whether the partition groups other partitions along a dimension. Tells whether the partition represents an entity to which the partitioning structure does not apply. Edges immediately contained in the group. Nodes immediately contained in the group. Partitions immediately contained in the partition. Partition immediately containing the partition. An element constraining behaviors invoked by nodes in the partition. Partitions containing the edge. Specification evaluated at runtime to determine if the edge can be traversed. Groups containing the edge. Partitions containing the node. Groups containing the node. A merge node is a control node that brings together multiple alternate flows. It is not used to synchronize concurrent flows but to accept one among several alternate flows. A merge node has one outgoing edge. OCL true The edges coming into and out of a merge node must be either all object flows or all control flows. OCL true A decision node is a control node that chooses between outgoing flows. A decision node has one or two incoming edges and at least one outgoing edge. OCL true The edges coming into and out of a decision node, other than the decision input flow (if any), must be either all object flows or all control flows. OCL true The decisionInputFlow of a decision node must be an incoming edge of the decision node. OCL true A decision input behavior has no output parameters, no in-out parameters and one return parameter. OCL true If the decision node has no decision input flow and an incoming control flow, then a decision input behavior has zero input parameters. OCL true If the decision node has no decision input flow and an incoming object flow, then a decision input behavior has one input parameter whose type is the same as or a supertype of the type of object tokens offered on the incoming edge. OCL true If the decision node has a decision input flow and an incoming control flow, then a decision input behavior has one input parameter whose type is the same as or a supertype of the type of object tokens offered on the decision input flow. OCL true If the decision node has a decision input flow and an second incoming object flow, then a decision input behavior has two input parameters, the first of which has a type that is the same as or a supertype of the type of the type of object tokens offered on the nondecision input flow and the second of which has a type that is the same as or a supertype of the type of object tokens offered on the decision input flow. OCL true Provides input to guard specifications on edges outgoing from the decision node. An additional edge incoming to the decision node that provides a decision input value. A final node is an abstract control node at which a flow in an activity stops. A final node has no outgoing edges. OCL true A join node is a control node that synchronizes multiple flows. Nodes immediately contained in the group. Edges immediately contained in the group. Activity containing the group. Top-level partitions in the activity. Top-level groups in the activity. Join nodes have a Boolean value specification using the names of the incoming edges to specify the conditions under which the join will emit a token. A join node has one outgoing edge. OCL self.outgoing->size() = 1 If a join node has an incoming object flow, it must have an outgoing object flow, otherwise, it must have an outgoing control flow. OCL (self.incoming.select(e | e.isTypeOf(ObjectFlow)->notEmpty() implies self.outgoing.isTypeOf(ObjectFlow)) and (self.incoming.select(e | e.isTypeOf(ObjectFlow)->empty() implies self.outgoing.isTypeOf(ControlFlow)) Tells whether tokens having objects with the same identity are combined into one by the join. A specification giving the conditions under which the join with emit a token. Default is "and". A data store node is a central buffer node for non-transient information. Object flows have support for multicast/receive, token selection from object nodes, and transformation of tokens. An edge with constant weight may not target an object node, or lead to an object node downstream with no intervening actions, that has an upper bound less than the weight. OCL true A transformation behavior has one input parameter and one output parameter. The input parameter must be the same as or a supertype of the type of object token coming from the source end. The output parameter must be the same or a subtype of the type of object token expected downstream. The behavior cannot have side effects. OCL true An object flow may have a selection behavior only if has an object node as a source. OCL true A selection behavior has one input parameter and one output parameter. The input parameter must be a bag of elements of the same as or a supertype of the type of source object node. The output parameter must be the same or a subtype of the type of source object node. The behavior cannot have side effects. OCL true isMulticast and isMultireceive cannot both be true. OCL true Tells whether the objects in the flow are passed by multicasting. Tells whether the objects in the flow are gathered from respondents to multicasting. Changes or replaces data tokens flowing along edge. Selects tokens from a source object node. Activity edges can be contained in interruptible regions. The minimum number of tokens that must traverse the edge at the same time. Region that the edge can interrupt. Object nodes have support for token selection, limitation on the number of tokens, specifying the state required for tokens, and carrying control values. If an object node has a selection behavior, then the ordering of the object node is ordered, and vice versa. OCL true A selection behavior has one input parameter and one output parameter. The input parameter must be a bag of elements of the same type as the object node or a supertype of the type of object node. The output parameter must be the same or a subtype of the type of object node. The behavior cannot have side effects. OCL true Tells whether and how the tokens in the object node are ordered for selection to traverse edges outgoing from the object node. Tells whether the type of the object node is to be treated as control. The maximum number of tokens allowed in the node. Objects cannot flow into the node if the upper bound is reached. The required states of the object available at this point in the activity. Selects tokens for outgoing edges. A parameter set is an element that provides alternative sets of inputs or outputs that a behavior may use. The parameters in a parameter set must all be inputs or all be outputs of the same parameterized entity, and the parameter set is owned by that entity. OCL true If a behavior has input parameters that are in a parameter set, then any inputs that are not in a parameter set must be streaming. Same for output parameters. OCL true Two parameter sets cannot have exactly the same set of parameters. OCL true Parameters in the parameter set. Constraint that should be satisfied for the owner of the parameters in an input parameter set to start execution using the values provided for those parameters, or the owner of the parameters in an output parameter set to end execution providing the values for those parameters, if all preconditions and conditions on input parameter sets were satisfied. If true, all invocations of the activity are handled by the same execution. Parameters have support for streaming, exceptions, and parameter sets. A parameter cannot be a stream and exception at the same time. OCL true An input parameter cannot be an exception. OCL true Reentrant behaviors cannot have stream parameters. OCL true Only in and inout parameters may have a delete effect. Only out, inout, and return parameters may have a create effect. OCL true Tells whether an output parameter may emit a value to the exclusion of the other outputs. Tells whether an input parameter may accept values while its behavior is executing, or whether an output parameter post values while the behavior is executing. Specifies the effect that the owner of the parameter has on values passed in or out of the parameter. The parameter sets containing the parameter. See ParameterSet. An action has pre- and post-conditions. Constraint that must be satisfied when execution is started. Constraint that must be satisfied when executed is completed. An interruptible activity region is an activity group that supports termination of tokens flowing in the portions of an activity. Interrupting edges of a region must have their source node in the region and their target node outside the region in the same activity containing the region. OCL true The edges leaving the region that will abort other tokens flowing in the region. Nodes immediately contained in the group. Interruptible regions containing the node. Groups containing the node. A behavioral feature owns zero or more parameter sets. The ParameterSets owned by this BehavioralFeature. A behavior owns zero or more parameter sets. The ParameterSets owned by this Behavior. Control pins have a control type OCL isControl implies isControlType Tells whether the pins provide data to the actions, or just controls when it executes it. Nodes immediately contained in the group. ObjectNodeOrderingKind is an enumeration indicating queuing order within a node. Indicates that object node tokens are unordered. Indicates that object node tokens are ordered. Indicates that object node tokens are queued in a last in, first out manner. Indicates that object node tokens are queued in a first in, first out manner. The datatype ParameterEffectKind is an enumeration that indicates the effect of a behavior on values passed in or out of its parameters. Indicates that the behavior creates values. Indicates that the behavior reads values. Indicates that the behavior updates values. Indicates that the behavior deletes values. Variables are elements for passing data between actions indirectly. A local variable stores values shared by the actions within a structured activity group but not accessible outside it. The output of an action may be written to a variable and read for the input to a subsequent action, which is effectively an indirect data flow path. Because there is no predefined relationship between actions that read and write variables, these actions must be sequenced by control flows to prevent race conditions that may occur between actions that read or write the same variable. A variable is owned by a StructuredNode or Activity, but not both. OCL true A structured activity node that owns the variable. An activity that owns the variable. The isAccessibleBy() operation is not defined in standard UML. Implementations should define it to specify which actions can access a variable. OCL result = true A structured activity node is an executable activity node that may have an expansion into subordinate nodes as an activity group. The subordinate nodes must belong to only one structured activity node, although they may be nested. A variable defined in the scope of the structured activity node. It has no value and may not be accessed Nodes immediately contained in the group. Activity immediately containing the node. A conditional node is a structured activity node that represents an exclusive choice among some number of alternatives. The union of the ExecutabledNodes in the test and body parts of all clauses must be the same as the subset of nodes contained in the ConditionalNode (considered as a StructuredActivityNode) that are ExecutableNodes. OCL true No ExecutableNode may appear in the test or body part of more than one clause of a conditional node. OCL true No two clauses within a ConditionalNode maybe predecessor clauses of each other, either directly or indirectly. OCL true If true, the modeler asserts that at most one test will succeed. If true, the modeler asserts that at least one test will succeed. Set of clauses composing the conditional. A loop node is a structured activity node that represents a loop with setup, test, and body sections. The union of the ExecutableNodes in the setupPart, test and bodyPart of a LoopNode must be the same as the subset of nodes contained in the LoopNode (considered as a StructuredActivityNode) that are ExecutableNodes. OCL true If true, the test is performed before the first execution of the body. If false, the body is executed once before the test is performed. The set of nodes and edges that perform the repetitive computations of the loop. The body section is executed as long as the test section produces a true value. The set of nodes and edges that initialize values or perform other setup computations for the loop. An output pin within the test fragment the value of which is examined after execution of the test to determine whether to execute the loop body. The set of nodes, edges, and designated value that compute a Boolean value to determine if another execution of the body will be performed. A clause is an element that represents a single branch of a conditional construct, including a test and a body section. The body section is executed only if (but not necessarily if) the test section evaluates true. The decider output pin must be for the test body or a node contained by the test body as a structured node. OCL true The test and body parts must be disjoint. OCL true A nested activity fragment with a designated output pin that specifies the result of the test. A nested activity fragment that is executed if the test evaluates to true and the clause is chosen over any concurrent clauses that also evaluate to true. A set of clauses whose tests must all evaluate false before the current clause can be tested. A set of clauses which may not be tested unless the current clause tests false. An output pin within the test fragment the value of which is examined after execution of the test to determine whether the body should be executed. Top-level structured nodes in the activity. Top-level variables in the activity. Top-level groups in the activity. Nodes coordinated by the activity. Activity nodes may be owned by at most one structured node. OCL true Structured activity node containing the node. Groups containing the node. Activity containing the node. An executable node is an abstract class for activity nodes that may be executed. It is used as an attachment point for exception handlers. A sequence node is a structured activity node that executes its actions in order. An ordered set of executable nodes. Nodes immediately contained in the group. Activity containing the group. An expansion node is an object node used to indicate a flow across the boundary of an expansion region. A flow into a region contains a collection that is broken into its individual elements inside the region, which is executed once per element. A flow out of a region combines individual elements into a collection for use outside the region. The expansion region for which the node is an output. The expansion region for which the node is an input. An expansion region is a structured activity region that executes multiple times corresponding to elements of an input collection. An ExpansionRegion must have one or more argument ExpansionNodes and zero or more result ExpansionNodes. OCL true The way in which the executions interact: parallel: all interactions are independent iterative: the interactions occur in order of the elements stream: a stream of values flows into a single execution An object node that accepts a separate element of the output collection during each of the multiple executions of the region. The values are formed into a collection that is available when the execution of the region is complete. An object node that holds a separate element of the input collection during each of the multiple executions of the region. An executable node is an abstract class for activity nodes that may be executed. It is used as an attachment point for exception handlers. One of regionAsInput or regionAsOutput must be non-empty, but not both. OCL true A set of exception handlers that are examined if an uncaught exception propagates to the outer level of the executable node. An exception handler is an element that specifies a body to execute in case the specified exception occurs during the execution of the protected node. The exception handler and its input object node are not the source or target of any edge. OCL true If the protected node is a StructuredActivityNode with output pins, then the exception handler body must also be a StructuredActivityNode with output pins that correspond in number and types to those of the protected node. OCL true The handler body has one input, and that input is the same as the exception input. OCL true An edge that has a source in an exception handler structured node must have its target in the handler also, and vice versa. OCL true The node protected by the handler. The handler is examined if an exception propagates to the outside of the node. A node that is executed if the handler satisfies an uncaught exception. An object node within the handler body. When the handler catches an exception, the exception token is placed in this node, causing the body to execute. The kind of instances that the handler catches. If an exception occurs whose type is any of the classifiers in the set, the handler catches the exception and executes its body. ExpansionKind is an enumeration type used to specify how multiple executions of an expansion region interact. The executions are independent. They may be executed concurrently. The executions are dependent and must be executed one at a time, in order of the collection elements. A stream of collection elements flows into a single execution, in order of the collection elements. The result output pins have no incoming edges. OCL true Each clause of a conditional node must have the same number of bodyOutput pins as the conditional node has result output pins, and each clause bodyOutput pin must be compatible with the corresponding result pin (by positional order) in type, multiplicity, ordering and uniqueness. OCL true A conditional node has no input pins. OCL true A list of output pins that constitute the data flow outputs of the conditional. Because of the concurrent nature of the execution of actions within and across activities, it can be difficult to guarantee the consistent access and modification of object memory. In order to avoid race conditions or other concurrency-related problems, it is sometimes necessary to isolate the effects of a group of actions from the effects of actions outside the group. This may be indicated by setting the mustIsolate attribute to true on a structured activity node. If a structured activity node is "isolated," then any object used by an action within the node cannot be accessed by any action outside the node until the structured activity node as a whole completes. Any concurrent actions that would result in accessing such objects are required to have their execution deferred until the completion of the node. The edges owned by a structured node must have source and target nodes in the structured node, and vice versa. OCL true The incoming edges of the input pins of a StructuredActivityNode must have sources that are not within the StructuredActivityNode. OCL true The outgoing edges of the output pins of a StructuredActivityNode must have targets that are not within the StructuredActivityNode. OCL true If true, then the actions in the node execute in isolation from actions outside the node. Edges immediately contained in the structured node. Loop variable inputs must not have outgoing edges. OCL true The bodyOutput pins are output pins on actions in the body of the loop node. OCL true The result output pins have no incoming edges. OCL true A list of output pins that constitute the data flow output of the entire loop. A list of output pins that hold the values of the loop variables during an execution of the loop. When the test fails, the values are movied to the result pins of the loop. A list of output pins within the body fragment the values of which are moved to the loop variable pins after completion of execution of the body, before the next iteration of the loop begins or before the loop exits. A list of values that are moved into the loop variable pins before the first iteration of the loop. The bodyOutput pins are output pins on actions in the body of the clause. OCL true A list of output pins within the body fragment whose values are moved to the result pins of the containing conditional node after execution of the clause body. Activity edges may be owned by at most one structured node. OCL true Structured activity node containing the edge. Groups containing the edge. Edges immediately contained in the group. Output pins may have incoming edges only when they are on actions that are structured nodes, and these edges may not target a node contained by the structured node. OCL true Input pins may have outgoing edges only when they are on actions that are structured nodes, and these edges must target a node contained by the structured node. OCL true An activity is the specification of parameterized behavior as the coordinated sequencing of subordinate units whose individual elements are actions. The groups of an activity have no supergroups. OCL true Nodes coordinated by the activity. Top-level groups in the activity. ActivityGroup is an abstract class for defining sets of nodes and edges in an activity. Nodes immediately contained in the group. Activity containing the group. Groups immediately contained in the group. Group immediately containing the group. An action represents a single step within an activity, that is, one that is not further decomposed within the activity. If true, the action can begin a new, concurrent execution, even if there is already another execution of the action ongoing. If false, the action cannot begin a new execution until any previous execution has completed. ActivityNode is an abstract class for points in the flow of an activity connected by edges. Activity containing the node. Groups containing the node. The default multiplicity of an extension end is 0..1. An information item is an abstraction of all kinds of information that can be exchanged between objects. It is a kind of classifier intended for representing information in a very abstract way, one which cannot be instantiated. The sources and targets of an information item (its related information flows) must designate subsets of the sources and targets of the representation information item, if any.The Classifiers that can realize an information item can only be of the following kind: Class, Interface, InformationItem, Signal, Component. OCL (self.represented->select(p | p->oclIsKindOf(InformationItem))->forAll(p | p.informationFlow.source->forAll(q | self.informationFlow.source->include(q)) and p.informationFlow.target->forAll(q | self.informationFlow.target->include(q)))) and (self.represented->forAll(p | p->oclIsKindOf(Class) or oclIsKindOf(Interface) or oclIsKindOf(InformationItem) or oclIsKindOf(Signal) or oclIsKindOf(Component))) An informationItem has no feature, no generalization, and no associations. OCL self.generalization->isEmpty() and self.feature->isEmpty() It is not instantiable. OCL isAbstract Determines the classifiers that will specify the structure and nature of the information. An information item represents all its represented classifiers. An information flow specifies that one or more information items circulates from its sources to its targets. Information flows require some kind of information channel for transmitting information items from the source to the destination. An information channel is represented in various ways depending on the nature of its sources and targets. It may be represented by connectors, links, associations, or even dependencies. For example, if the source and destination are parts in some composite structure such as a collaboration, then the information channel is likely to be represented by a connector between them. Or, if the source and target are objects (which are a kind of instance specification), they may be represented by a link that joins the two, and so on. The sources and targets of the information flow can only be one of the following kind: Actor, Node, UseCase, Artifact, Class, Component, Port, Property, Interface, Package, ActivityNode, ActivityPartition and InstanceSpecification except when its classifier is a relationship (i.e. it represents a link). OCL (self.informationSource->forAll(p | p->oclIsKindOf(Actor) or oclIsKindOf(Node) or oclIsKindOf(UseCase) or oclIsKindOf(Artifact) or oclIsKindOf(Class) or oclIsKindOf(Component) or oclIsKindOf(Port) or oclIsKindOf(Property) or oclIsKindOf(Interface) or oclIsKindOf(Package) or oclIsKindOf(ActivityNode) or oclIsKindOf(ActivityPartition) or oclIsKindOf(InstanceSpecification))) and (self.informationTarget->forAll(p | p->oclIsKindOf(Actor) or oclIsKindOf(Node) or oclIsKindOf(UseCase) or oclIsKindOf(Artifact) or oclIsKindOf(Class) or oclIsKindOf(Component) or oclIsKindOf(Port) or oclIsKindOf(Property) or oclIsKindOf(Interface) or oclIsKindOf(Package) or oclIsKindOf(ActivityNode) or oclIsKindOf(ActivityPartition) or oclIsKindOf(InstanceSpecification))) The sources and targets of the information flow must conform with the sources and targets or conversely the targets and sources of the realization relationships. OCL true An information flow can only convey classifiers that are allowed to represent an information item. OCL self.conveyed.represented->forAll(p | p->oclIsKindOf(Class) or oclIsKindOf(Interface) or oclIsKindOf(InformationItem) or oclIsKindOf(Signal) or oclIsKindOf(Component)) Determines which Relationship will realize the specified flow Specifies the information items that may circulate on this information flow. Defines from which source the conveyed InformationItems are initiated. Defines to which target the conveyed InformationItems are directed. Determines which ActivityEdges will realize the specified flow. Determines which Connectors will realize the specified flow. Determines which Messages will realize the specified flow. A model captures a view of a physical system. It is an abstraction of the physical system, with a certain purpose. This purpose determines what is to be included in the model and what is irrelevant. Thus the model completely describes those aspects of the physical system that are relevant to the purpose of the model, at the appropriate level of detail. The name of the viewpoint that is expressed by a model (This name may refer to a profile definition). A template signature bundles the set of formal template parameters for a templated element. Parameters must own the elements they parameter or those elements must be owned by the element being templated. OCL templatedElement.ownedElement->includesAll(parameter.parameteredElement - parameter.ownedParameteredElement) The ordered set of all formal template parameters for this template signature. The formal template parameters that are owned by this template signature. The element that owns this template signature. A named element supports using a string expression to specify its name. This allows names of model elements to involve template parameters. The actual name is evaluated from the string expression only when it is sensible to do so (e.g., when a template is bound). The string expression used to define the name of this named element. A template parameter exposes a parameterable element as a formal template parameter of a template. The default must be compatible with the formal template parameter. OCL default->notEmpty() implies default->isCompatibleWith(parameteredElement) The template signature that owns this template parameter. The element exposed by this template parameter. The element that is owned by this template parameter. The element that is the default for this formal template parameter. The element that is owned by this template parameter for the purpose of providing a default. An expression that specifies a string value that is derived by concatenating a set of sub string expressions, some of which might be template parameters. All the operands of a StringExpression must be LiteralStrings OCL operand->forAll (op | op.oclIsKindOf (LiteralString)) If a StringExpression has sub-expressions, it cannot have operands and vice versa (this avoids the problem of having to define a collating sequence between operands and subexpressions). OCL if subExpression->notEmpty() then operand->isEmpty() else operand->notEmpty() The StringExpressions that constitute this StringExpression. The string expression of which this expression is a substring. The query stringValue() returns the string that concatenates, in order, all the component string literals of all the subexpressions that are part of the StringExpression. OCL result = if subExpression->notEmpty() then subExpression->iterate(se; stringValue = ‘| stringValue.concat(se.stringValue())) else operand->iterate()(op; stringValue = ‘ | stringValue.concat(op.value)) A template binding represents a relationship between a templateable element and a template. A template binding specifies the substitutions of actual parameters for the formal parameters of the template. Each parameter substitution must refer to a formal template parameter of the target template signature. OCL parameterSubstitution->forAll(b | template.parameter->includes(b.formal)) A binding contains at most one parameter substitution for each formal template parameter of the target template signature. OCL template.parameter->forAll(p | parameterSubstitution->select(b | b.formal = p)->size() <= 1) The element that is bound by this binding. The template signature for the template that is the target of the binding. The parameter substitutions owned by this template binding. A template parameter substitution relates the actual parameter to a formal template parameter as part of a template binding. The actual parameter must be compatible with the formal template parameter, e.g. the actual parameter for a class template parameter must be a class. OCL actual->forAll(a | a.isCompatibleWith(formal.parameteredElement)) The formal template parameter that is associated with this substitution. The optional bindings from this element to templates. The element that is the actual parameter for this substitution. The actual parameter that is owned by this substitution. A templateable element is an element that can optionally be defined as a template and bound to other templates. The optional bindings from this element to templates. The optional template signature specifying the formal template parameters. The query parameterableElements() returns the set of elements that may be used as the parametered elements for a template parameter of this templateable element. By default, this set includes all the owned elements. Subclasses may override this operation if they choose to restrict the set of parameterable elements. OCL result = allOwnedElements->select(oclIsKindOf(ParameterableElement)) The query isTemplate() returns whether this templateable element is actually a template. OCL result = ownedTemplateSignature->notEmpty() A parameterable element is an element that can be exposed as a formal template parameter for a template, or specified as an actual parameter in a binding of a template. The template parameter that exposes this element as a formal parameter. The formal template parameter that owns this element. The query isCompatibleWith() determines if this parameterable element is compatible with the specified parameterable element. By default parameterable element P is compatible with parameterable element Q if the kind of P is the same or a subtype as the kind of Q. Subclasses should override this operation to specify different compatibility constraints. OCL result = p->oclIsKindOf(self.oclType) The query isTemplateParameter() determines if this parameterable element is exposed as a formal template parameter. OCL result = templateParameter->notEmpty() Property specializes ParameterableElement to specify that a property can be exposed as a formal template parameter, and provided as an actual parameter in a binding of a template. A binding of a property template parameter representing an attribute must be to an attribute. OCL (isAttribute(self) and (templateParameterSubstitution->notEmpty()) implies (templateParameterSubstitution->forAll(ts | isAttribute(ts.formal))) The query isCompatibleWith() determines if this parameterable element is compatible with the specified parameterable element. By default parameterable element P is compatible with parameterable element Q if the kind of P is the same or a subtype as the kind of Q. In addition, for properties, the type must be conformant with the type of the specified parameterable element. OCL result = p->oclIsKindOf(self.oclType) and self.type.conformsTo(p.oclAsType(TypedElement).type) ValueSpecification specializes ParameterableElement to specify that a value specification can be exposed as a formal template parameter, and provided as an actual parameter in a binding of a template. The query isCompatibleWith() determines if this parameterable element is compatible with the specified parameterable element. By default parameterable element P is compatible with parameterable element Q if the kind of P is the same or a subtype as the kind of Q. In addition, for ValueSpecification, the type must be conformant with the type of the specified parameterable element. OCL result = p->oclIsKindOf(self.oclType) and self.type.conformsTo(p.oclAsType(TypedElement).type) Operation specializes TemplateableElement in order to support specification of template operations and bound operations. Operation specializes ParameterableElement to specify that an operation can be exposed as a formal template parameter, and provided as an actual parameter in a binding of a template. The template parameter that exposes this element as a formal parameter. An operation template parameter exposes an operation as a formal parameter for a template. The operation for this template parameter. Packageable elements are able to serve as a template parameter. Classifier is defined to be a kind of templateable element so that a classifier can be parameterized. It is also defined to be a kind of parameterable element so that a classifier can be a formal template parameter. The optional template signature specifying the formal template parameters. The template parameter that exposes this element as a formal parameter. The query isTemplate() returns whether this templateable element is actually a template. OCL result = oclAsType(TemplatableElement).isTemplate() or general->exists(g | g.isTemplate()) A classifier template parameter exposes a classifier as a formal template parameter. If "allowSubstitutable" is true, then there must be a constrainingClassifier. OCL allowSubstitutable implies constrainingClassifier->notEmpty() Constrains the required relationship between an actual parameter and the parameteredElement for this formal parameter. The parameterable classifier for this template parameter. The classifiers that constrain the argument that can be used for the parameter. If the allowSubstitutable attribute is true, then any classifier that is compatible with this constraining classifier can be substituted; otherwise, it must be either this classifier or one of its subclasses. If this property is empty, there are no constraints on the classifier that can be used as an argument. A redefinable template signature supports the addition of formal template parameters in a specialization of a template classifier. The inherited parameters are the parameters of the extended template signature. OCL if extendedSignature->isEmpty() then Set{} else extendedSignature.parameter endif The classifier that owns this template signature. The template signature that is extended by this template signature. The formal template parameters of the extendedSignature. The query isConsistentWith() specifies, for any two RedefinableTemplateSignatures in a context in which redefinition is possible, whether redefinition would be logically consistent. A redefining template signature is always consistent with a redefined template signature, since redefinition only adds new formal parameters. OCL redefinee.isRedefinitionContextValid(self) OCL result = redefinee.oclIsKindOf(RedefineableTemplateSignature) A connectable element may be exposed as a connectable element template parameter. The ConnectableElementTemplateParameter for this ConnectableElement parameter. A connectable element template parameter exposes a connectable element as a formal parameter for a template. The ConnectableElement for this template parameter. Package specializes TemplateableElement and PackageableElement specializes ParameterableElement to specify that a package can be used as a template and a PackageableElement as a template parameter. An element is a constituent of a model. As such, it has the capability of owning other elements. An element may not directly or indirectly own itself. OCL not self.allOwnedElements()->includes(self) Elements that must be owned must have an owner. OCL self.mustBeOwned() implies owner->notEmpty() The Elements owned by this element. The Element that owns this element. The Comments owned by this element. The query allOwnedElements() gives all of the direct and indirect owned elements of an element. OCL result = ownedElement->union(ownedElement->collect(e | e.allOwnedElements())) The query mustBeOwned() indicates whether elements of this type must have an owner. Subclasses of Element that do not require an owner must override this operation. OCL result = true A comment is a textual annotation that can be attached to a set of elements. Specifies a string that is the comment. References the Element(s) being commented. A directed relationship represents a relationship between a collection of source model elements and a collection of target model elements. Specifies the sources of the DirectedRelationship. Specifies the targets of the DirectedRelationship. A named element is an element in a model that may have a name. If there is no name, or one of the containing namespaces has no name, there is no qualified name. OCL (self.name->isEmpty() or self.allNamespaces()->select(ns | ns.name->isEmpty())->notEmpty()) implies self.qualifiedName->isEmpty() When there is a name, and all of the containing namespaces have a name, the qualified name is constructed from the names of the containing namespaces. OCL (self.name->notEmpty() and self.allNamespaces()->select(ns | ns.name->isEmpty())->isEmpty()) implies self.qualifiedName = self.allNamespaces()->iterate( ns : Namespace; result: String = self.name | ns.name->union(self.separator())->union(result)) If a NamedElement is not owned by a Namespace, it does not have a visibility. OCL namespace->isEmpty() implies visibility->isEmpty() The name of the NamedElement. Determines where the NamedElement appears within different Namespaces within the overall model, and its accessibility. 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. Specifies the namespace that owns the NamedElement. The query allNamespaces() gives the sequence of namespaces in which the NamedElement is nested, working outwards. OCL result = if self.namespace->isEmpty() then Sequence{} else self.namespace.allNamespaces()->prepend(self.namespace) endif The query isDistinguishableFrom() determines whether two NamedElements may logically co-exist within a Namespace. By default, two named elements are distinguishable if (a) they have unrelated types or (b) they have related types but different names. OCL result = if self.oclIsKindOf(n.oclType) or n.oclIsKindOf(self.oclType) then ns.getNamesOfMember(self)->intersection(ns.getNamesOfMember(n))->isEmpty() else true endif The query separator() gives the string that is used to separate names when constructing a qualified name. OCL result = '::' A packageable element indicates a named element that may be owned directly by a package. Indicates that packageable elements must always have a visibility, i.e., visibility is not optional. An opaque expression is an uninterpreted textual statement that denotes a (possibly empty) set of values when evaluated in a context. If the language attribute is not empty, then the size of the body and language arrays must be the same. OCL language->notEmpty() implies (body->size() = language->size()) The text of the expression, possibly in multiple languages. Specifies the languages in which the expression is stated. The interpretation of the expression body depends on the languages. If the languages are unspecified, they might be implicit from the expression body or the context. Languages are matched to body strings by order. The query value() gives an integer value for an expression intended to produce one. OCL self.isIntegral() OCL true The query isIntegral() tells whether an expression is intended to produce an integer. OCL result = false The query isPositive() tells whether an integer expression has a positive value. OCL self.isIntegral() OCL result = false The query isNonNegative() tells whether an integer expression has a non-negative value. OCL self.isIntegral() OCL result = false A literal specification identifies a literal constant being modeled. A literal integer is a specification of an integer value. The specified Integer value. The query isComputable() is redefined to be true. OCL result = true The query integerValue() gives the value. OCL result = value A literal string is a specification of a string value. The specified String value. The query isComputable() is redefined to be true. OCL result = true The query stringValue() gives the value. OCL result = value A literal Boolean is a specification of a Boolean value. The specified Boolean value. The query isComputable() is redefined to be true. OCL result = true The query booleanValue() gives the value. OCL result = value A literal null specifies the lack of a value. The query isComputable() is redefined to be true. OCL result = true The query isNull() returns true. OCL result = true A constraint is a condition or restriction expressed in natural language text or in a machine readable language for the purpose of declaring some of the semantics of an element. The value specification for a constraint must evaluate to a Boolean value. OCL true Evaluating the value specification for a constraint must not have side effects. OCL true A constraint cannot be applied to itself. OCL not constrainedElement->includes(self) The ordered set of Elements referenced by this Constraint. A condition that must be true when evaluated in order for the constraint to be satisfied. Specifies the namespace that owns the NamedElement. An element import identifies an element in another package, and allows the element to be referenced using its name without a qualifier. The visibility of an ElementImport is either public or private. OCL self.visibility = #public or self.visibility = #private An importedElement has either public visibility or no visibility at all. OCL self.importedElement.visibility.notEmpty() implies self.importedElement.visibility = #public Specifies the visibility of the imported PackageableElement within the importing Package. The default visibility is the same as that of the imported element. If the imported element does not have a visibility, it is possible to add visibility to the element import. Specifies the name that should be added to the namespace of the importing package in lieu of the name of the imported packagable element. The aliased name must not clash with any other member name in the importing package. By default, no alias is used. Specifies the PackageableElement whose name is to be added to a Namespace. Specifies the Namespace that imports a PackageableElement from another Package. The query getName() returns the name under which the imported PackageableElement will be known in the importing namespace. OCL result = if self.alias->notEmpty() then self.alias else self.importedElement.name endif A multiplicity is a definition of an inclusive interval of non-negative integers beginning with a lower bound and ending with a (possibly infinite) upper bound. A multiplicity element embeds this information to specify the allowable cardinalities for an instantiation of this element. The lower bound must be a non-negative integer literal. OCL lowerBound()->notEmpty() implies lowerBound() >= 0 The upper bound must be greater than or equal to the lower bound. OCL (upperBound()->notEmpty() and lowerBound()->notEmpty()) implies upperBound() >= lowerBound() If a non-literal ValueSpecification is used for the lower or upper bound, then evaluating that specification must not have side effects. OCL true If a non-literal ValueSpecification is used for the lower or upper bound, then that specification must be a constant expression. OCL true For a multivalued multiplicity, this attribute specifies whether the values in an instantiation of this element are sequentially ordered. For a multivalued multiplicity, this attributes specifies whether the values in an instantiation of this element are unique. Specifies the upper bound of the multiplicity interval. Specifies the lower bound of the multiplicity interval. The specification of the upper bound for this multiplicity. The specification of the lower bound for this multiplicity. The derived lower attribute must equal the lowerBound. OCL result = lowerBound() The derived upper attribute must equal the upperBound. OCL result = upperBound() The query isMultivalued() checks whether this multiplicity has an upper bound greater than one. OCL upperBound()->notEmpty() OCL result = upperBound() > 1 The query includesCardinality() checks whether the specified cardinality is valid for this multiplicity. OCL upperBound()->notEmpty() and lowerBound()->notEmpty() OCL result = (lowerBound() <= C) and (upperBound() >= C) The query includesMultiplicity() checks whether this multiplicity includes all the cardinalities allowed by the specified multiplicity. OCL self.upperBound()->notEmpty() and self.lowerBound()->notEmpty() and M.upperBound()->notEmpty() and M.lowerBound()->notEmpty() OCL result = (self.lowerBound() <= M.lowerBound()) and (self.upperBound() >= M.upperBound()) The query lowerBound() returns the lower bound of the multiplicity as an integer. OCL result = if lowerValue->isEmpty() then 1 else lowerValue.integerValue() endif The query upperBound() returns the upper bound of the multiplicity for a bounded multiplicity as an unlimited natural. OCL result = if upperValue->isEmpty() then 1 else upperValue.unlimitedValue() endif A typed element has a type. The type of the TypedElement. A classifier is a classification of instances - it describes a set of instances that have features in common. A classifier can specify a generalization hierarchy by referencing its general classifiers. Generalization hierarchies must be directed and acyclical. A classifier can not be both a transitively general and transitively specific classifier of the same classifier. OCL not self.allParents()->includes(self) A classifier may only specialize classifiers of a valid type. OCL self.parents()->forAll(c | self.maySpecializeType(c)) The parents of a classifier must be non-final. OCL self.parents()->forAll(not isFinalSpecialization) If true, the Classifier does not provide a complete declaration and can typically not be instantiated. An abstract classifier is intended to be used by other classifiers e.g. as the target of general metarelationships or generalization relationships. Specifies the Generalization relationships for this Classifier. These Generalizations navigaten to more general classifiers in the generalization hierarchy. Specifies each feature defined in the classifier. Specifies all elements inherited by this classifier from the general classifiers. Refers to all of the Properties that are direct (i.e. not inherited or imported) attributes of the classifier. References the Classifiers that are redefined by this Classifier. Specifies the general Classifiers for this Classifier. If true, the Classifier cannot be specialized by generalization. Note that this property is preserved through package merge operations; that is, the capability to specialize a Classifier (i.e., isFinalSpecialization =false) must be preserved in the resulting Classifier of a package merge operation where a Classifier with isFinalSpecialization =false is merged with a matching Classifier with isFinalSpecialization =true: the resulting Classifier will have isFinalSpecialization =false. The general classifiers are the classifiers referenced by the generalization relationships. OCL result = self.parents() The inheritedMember association is derived by inheriting the inheritable members of the parents. OCL result = self.inherit(self.parents()->collect(p | p.inheritableMembers(self)) The query allFeatures() gives all of the features in the namespace of the classifier. In general, through mechanisms such as inheritance, this will be a larger set than feature. OCL result = member->select(oclIsKindOf(Feature)) The query parents() gives all of the immediate ancestors of a generalized Classifier. OCL result = generalization.general The query inheritableMembers() gives all of the members of a classifier that may be inherited in one of its descendants, subject to whatever visibility restrictions apply. OCL c.allParents()->includes(self) OCL c.allParents()->includes(self) OCL result = member->select(m | c.hasVisibilityOf(m)) The query hasVisibilityOf() determines whether a named element is visible in the classifier. By default all are visible. It is only called when the argument is something owned by a parent. OCL self.allParents()->collect(c | c.member)->includes(n) OCL result = if (self.inheritedMember->includes(n)) then (n.visibility <> #private) else true The query conformsTo() gives true for a classifier that defines a type that conforms to another. This is used, for example, in the specification of signature conformance for operations. OCL result = (self=other) or (self.allParents()->includes(other)) The query inherit() defines how to inherit a set of elements. Here the operation is defined to inherit them all. It is intended to be redefined in circumstances where inheritance is affected by redefinition. OCL result = inhs The query maySpecializeType() determines whether this classifier may have a generalization relationship to classifiers of the specified type. By default a classifier may specialize classifiers of the same or a more general type. It is intended to be redefined by classifiers that have different specialization constraints. OCL result = self.oclIsKindOf(c.oclType) The query allParents() gives all of the direct and indirect ancestors of a generalized Classifier. OCL result = self.parents()->union(self.parents()->collect(p | p.allParents()) A feature declares a behavioral or structural characteristic of instances of classifiers. Specifies whether this feature characterizes individual instances classified by the classifier (false) or the classifier itself (true). The Classifiers that have this Feature as a feature. A redefinable element is an element that, when defined in the context of a classifier, can be redefined more specifically or differently in the context of another classifier that specializes (directly or indirectly) the context classifier. At least one of the redefinition contexts of the redefining element must be a specialization of at least one of the redefinition contexts for each redefined element. OCL self.redefinedElement->forAll(e | self.isRedefinitionContextValid(e)) A redefining element must be consistent with each redefined element. OCL self.redefinedElement->forAll(re | re.isConsistentWith(self)) A redefinable element can only redefine non-leaf redefinable elements OCL self.redefinedElement->forAll(not isLeaf) Indicates whether it is possible to further redefine a RedefinableElement. If the value is true, then it is not possible to further redefine the RedefinableElement. Note that this property is preserved through package merge operations; that is, the capability to redefine a RedefinableElement (i.e., isLeaf=false) must be preserved in the resulting RedefinableElement of a package merge operation where a RedefinableElement with isLeaf=false is merged with a matching RedefinableElement with isLeaf=true: the resulting RedefinableElement will have isLeaf=false. Default value is false. The redefinable element that is being redefined by this element. References the contexts that this element may be redefined from. The query isConsistentWith() specifies, for any two RedefinableElements in a context in which redefinition is possible, whether redefinition would be logically consistent. By default, this is false; this operation must be overridden for subclasses of RedefinableElement to define the consistency conditions. OCL redefinee.isRedefinitionContextValid(self) OCL result = false The query isRedefinitionContextValid() specifies whether the redefinition contexts of this RedefinableElement are properly related to the redefinition contexts of the specified RedefinableElement to allow this element to redefine the other. By default at least one of the redefinition contexts of this element must be a specialization of at least one of the redefinition contexts of the specified element. OCL result = redefinitionContext->exists(c | c.allParents()->includes(redefined.redefinitionContext))) A generalization is a taxonomic relationship between a more general classifier and a more specific classifier. Each instance of the specific classifier is also an indirect instance of the general classifier. Thus, the specific classifier inherits the features of the more general classifier. Indicates whether the specific classifier can be used wherever the general classifier can be used. If true, the execution traces of the specific classifier will be a superset of the execution traces of the general classifier. References the specializing classifier in the Generalization relationship. References the general classifier in the Generalization relationship. A behavioral feature is a feature of a classifier that specifies an aspect of the behavior of its instances. Specifies the ordered set of formal parameters of this BehavioralFeature. References the Types representing exceptions that may be raised during an invocation of this feature. The query isDistinguishableFrom() determines whether two BehavioralFeatures may coexist in the same Namespace. It specifies that they have to have different signatures. OCL result = if n.oclIsKindOf(BehavioralFeature) then if ns.getNamesOfMember(self)->intersection(ns.getNamesOfMember(n))->notEmpty() then Set{}->including(self)->including(n)->isUnique(bf | bf.ownedParameter->collect(type)) else true endif else true endif A parameter is a specification of an argument used to pass information into or out of an invocation of a behavioral feature. Indicates whether a parameter is being sent into or out of a behavioral element. Specifies a String that represents a value to be used when no argument is supplied for the Parameter. Specifies a ValueSpecification that represents a value to be used when no argument is supplied for the Parameter. References the Operation owning this parameter. By specializing multiplicity element, it supports a multiplicity that specifies valid cardinalities for the collection of values associated with an instantiation of the structural feature. States whether the feature's value may be modified by a client. An instance specification is a model element that represents an instance in a modeled system. The defining feature of each slot is a structural feature (directly or inherited) of a classifier of the instance specification. OCL slot->forAll(s | classifier->exists (c | c.allFeatures()->includes (s.definingFeature))) One structural feature (including the same feature inherited from multiple classifiers) is the defining feature of at most one slot in an instance specification. OCL classifier->forAll(c | (c.allFeatures()->forAll(f | slot->select(s | s.definingFeature = f)->size() <= 1))) The classifier or classifiers of the represented instance. If multiple classifiers are specified, the instance is classified by all of them. A slot giving the value or values of a structural feature of the instance. An instance specification can have one slot per structural feature of its classifiers, including inherited features. It is not necessary to model a slot for each structural feature, in which case the instance specification is a partial description. A specification of how to compute, derive, or construct the instance. A slot specifies that an entity modeled by an instance specification has a value or values for a specific structural feature. The instance specification that owns this slot. The structural feature that specifies the values that may be held by the slot. The value or values corresponding to the defining feature for the owning instance specification. A package is used to group elements, and provides a namespace for the grouped elements. If an element that is owned by a package has visibility, it is public or private. OCL self.ownedElements->forAll(e | e.visibility->notEmpty() implies e.visbility = #public or e.visibility = #private) References the PackageMerges that are owned by this Package. Specifies the packageable elements that are owned by this Package. References the packaged elements that are Types. References the packaged elements that are Packages. References the Package that owns this Package. The query mustBeOwned() indicates whether elements of this type must have an owner. OCL result = false The query visibleMembers() defines which members of a Package can be accessed outside it. OCL result = member->select( m | self.makesVisible(m)) The query makesVisible() defines whether a Package makes an element visible outside itself. Elements with no visibility and elements with public visibility are made visible. OCL self.member->includes(el) OCL result = (ownedMember->includes(el)) or (elementImport->select(ei|ei.importedElement = #public)->collect(ei|ei.importedElement)->includes(el)) or (packageImport->select(pi|pi.visibility = #public)->collect(pi|pi.importedPackage.member->includes(el))->notEmpty()) A package import is a relationship that allows the use of unqualified names to refer to package members from other namespaces. The visibility of a PackageImport is either public or private. OCL self.visibility = #public or self.visibility = #private Specifies the visibility of the imported PackageableElements within the importing Namespace, i.e., whether imported elements will in turn be visible to other packages that use that importingPackage as an importedPackage. If the PackageImport is public, the imported elements will be visible outside the package, while if it is private they will not. Specifies the Namespace that imports the members from a Package. Specifies the Package whose members are imported into a Namespace. A class describes a set of objects that share the same specifications of features, constraints, and semantics. If true, the Classifier does not provide a complete declaration and can typically not be instantiated. An abstract classifier is intended to be used by other classifiers e.g. as the target of general metarelationships or generalization relationships. References all the Classifiers that are defined (nested) within the Class. The attributes (i.e. the properties) owned by the class. The operations owned by the class. This gives the superclasses of a class. The inherit operation is overridden to exclude redefined properties. OCL result = inhs->excluding(inh | ownedMember->select(oclIsKindOf(RedefinableElement))->select(redefinedElement->includes(inh))) A property is a structural feature of a classifier that characterizes instances of the classifier. A property related by ownedAttribute to a classifier (other than an association) represents an attribute and might also represent an association end. It relates an instance of the class to a value or set of values of the type of the attribute. A property related by memberEnd or its specializations to an association represents an end of the association. The type of the property is the type of the end of the association. A multiplicity on an aggregate end of a composite aggregation must not have an upper bound greater than 1. OCL isComposite implies (upperBound()->isEmpty() or upperBound() <= 1) Subsetting may only occur when the context of the subsetting property conforms to the context of the subsetted property. OCL self.subsettedProperty->notEmpty() implies (self.subsettingContext()->notEmpty() and self.subsettingContext()->forAll (sc | self.subsettedProperty->forAll(sp | sp.subsettingContext()->exists(c | sc.conformsTo(c))))) A redefined property must be inherited from a more general classifier containing the redefining property. OCL if (redefinedProperty->notEmpty()) then (redefinitionContext->notEmpty() and redefinedProperty->forAll(rp| ((redefinitionContext->collect(fc| fc.allParents()))->asSet())->collect(c| c.allFeatures())->asSet()->includes(rp)) A subsetting property may strengthen the type of the subsetted property, and its upper bound may be less. OCL self.subsettedProperty->forAll(sp | self.type.conformsTo(sp.type) and ((self.upperBound()->notEmpty() and sp.upperBound()->notEmpty()) implies self.upperBound()<=sp.upperBound() )) Only a navigable property can be marked as readOnly. OCL isReadOnly implies isNavigable() A derived union is derived. OCL isDerivedUnion implies isDerived A derived union is read only. OCL isDerivedUnion implies isReadOnly A property may not subset a property with the same name. OCL true Specifies whether the Property is derived, i.e., whether its value or values can be computed from other information. If true, the attribute may only be read, and not written. Specifies whether the property is derived as the union of all of the properties that are constrained to subset it. A String that is evaluated to give a default value for the Property when an object of the owning Classifier is instantiated. Specifies the kind of aggregation that applies to the Property. This is a derived value, indicating whether the aggregation of the Property is composite or not. References the Class that owns the Property. References the properties that are redefined by this property. References the owning association of this property, if any. The DataType that owns this Property. A ValueSpecification that is evaluated to give a default value for the Property when an object of the owning Classifier is instantiated. In the case where the property is one navigable end of a binary association with both ends navigable, this gives the other end. References the properties of which this property is constrained to be a subset. References the association of which this property is a member, if any. The query isAttribute() is true if the Property is defined as an attribute of some classifier. OCL result = Classifier.allInstances->exists(c | c.attribute->includes(p)) If this property is owned by a class, associated with a binary association, and the other end of the association is also owned by a class, then opposite gives the other end. OCL result = if owningAssociation->isEmpty() and association.memberEnd->size() = 2 then let otherEnd = (association.memberEnd - self)->any() in if otherEnd.owningAssociation->isEmpty() then otherEnd else Set{} endif else Set {} endif The value of isComposite is true only if aggregation is composite. OCL result = (self.aggregation = #composite) The query isConsistentWith() specifies, for any two Properties in a context in which redefinition is possible, whether redefinition would be logically consistent. A redefining property is consistent with a redefined property if the type of the redefining property conforms to the type of the redefined property, the multiplicity of the redefining property (if specified) is contained in the multiplicity of the redefined property, and the redefining property is derived if the redefined property is derived. OCL redefinee.isRedefinitionContextValid(self) OCL result = redefinee.oclIsKindOf(Property) and let prop : Property = redefinee.oclAsType(Property) in (prop.type.conformsTo(self.type) and ((prop.lowerBound()->notEmpty() and self.lowerBound()->notEmpty()) implies prop.lowerBound() >= self.lowerBound()) and ((prop.upperBound()->notEmpty() and self.upperBound()->notEmpty()) implies prop.lowerBound() <= self.lowerBound()) and (self.isDerived implies prop.isDerived) and (self.isComposite implies prop.isComposite)) The query subsettingContext() gives the context for subsetting a property. It consists, in the case of an attribute, of the corresponding classifier, and in the case of an association end, all of the classifiers at the other ends. OCL result = if association->notEmpty() then association.endType-type else if classifier->notEmpty() then Set{classifier} else Set{} endif endif The query isNavigable() indicates whether it is possible to navigate across the property. OCL result = not classifier->isEmpty() or association.owningAssociation.navigableOwnedEnd->includes(self) An operation is a behavioral feature of a classifier that specifies the name, type, parameters, and constraints for invoking an associated behavior. An operation can have at most one return parameter; i.e., an owned parameter with the direction set to 'return' OCL self.ownedParameter->select(par | par.direction = #return)->size() <= 1 A bodyCondition can only be specified for a query operation. OCL bodyCondition->notEmpty() implies isQuery Specifies whether an execution of the BehavioralFeature leaves the state of the system unchanged (isQuery=true) or whether side effects may occur (isQuery=false). Specifies whether the return parameter is ordered or not, if present. Specifies whether the return parameter is unique or not, if present. Specifies the lower multiplicity of the return parameter, if present. Specifies the upper multiplicity of the return parameter, if present. The class that owns the operation. An optional set of Constraints on the state of the system when the Operation is invoked. An optional set of Constraints specifying the state of the system when the Operation is completed. References the Operations that are redefined by this Operation. The DataType that owns this Operation. An optional Constraint on the result values of an invocation of this Operation. Specifies the return result of the operation, if present. Specifies the parameters owned by this Operation. References the Types representing exceptions that may be raised during an invocation of this operation. If this operation has a return parameter, isOrdered equals the value of isOrdered for that parameter. Otherwise isOrdered is false. OCL result = if returnResult()->notEmpty() then returnResult()->any().isOrdered else false endif If this operation has a return parameter, isUnique equals the value of isUnique for that parameter. Otherwise isUnique is true. OCL result = if returnResult()->notEmpty() then returnResult()->any().isUnique else true endif If this operation has a return parameter, lower equals the value of lower for that parameter. Otherwise lower is not defined. OCL result = if returnResult()->notEmpty() then returnResult()->any().lower else Set{} endif If this operation has a return parameter, upper equals the value of upper for that parameter. Otherwise upper is not defined. OCL result = if returnResult()->notEmpty() then returnResult()->any().upper else Set{} endif If this operation has a return parameter, type equals the value of type for that parameter. Otherwise type is not defined. OCL result = if returnResult()->notEmpty() then returnResult()->any().type else Set{} endif A redefining operation is consistent with a redefined operation if it has the same number of owned parameters, and the type of each owned parameter conforms to the type of the corresponding redefined parameter. OCL redefinee.isRedefinitionContextValid(self) OCL result = redefinee.oclIsKindOf(Operation) and let op : Operation = redefinee.oclAsType(Operation) in self.ownedParameter->size() = op.ownedParameter->size() and Sequence{1..self.ownedParameter->size()}-> forAll(i |op.ownedParameter->at(1).type.conformsTo(self.ownedParameter->at(i).type)) The query returnResult() returns the set containing the return parameter of the Operation if one exists, otherwise, it returns an empty set OCL result = ownedParameter->select (par | par.direction = #return) A data type is a type whose instances are identified only by their value. A data type may contain attributes to support the modeling of structured data types. The Attributes owned by the DataType. The Operations owned by the DataType. An enumeration is a data type whose values are enumerated in the model as enumeration literals. The ordered set of literals for this Enumeration. An enumeration literal is a user-defined data value for an enumeration. The Enumeration that this EnumerationLiteral is a member of. A primitive type defines a predefined data type, without any relevant substructure (i.e., it has no parts in the context of UML). A primitive datatype may have an algebra and operations defined outside of UML, for example, mathematically. An association describes a set of tuples whose values refer to typed instances. An instance of an association is called a link. A link is a tuple with one value for each end of the association, where each value is an instance of the type of the end. An association specializing another association has the same number of ends as the other association. OCL parents()->select(oclIsKindOf(Association)).oclAsType(Association)->forAll(p | p.memberEnd->size() = self.memberEnd->size()) When an association specializes another association, every end of the specific association corresponds to an end of the general association, and the specific end reaches the same type or a subtype of the more general end. OCL Sequence{1..self.memberEnd->size()}-> forAll(i | self.general->select(oclIsKindOf(Association)).oclAsType(Association)-> forAll(ga |self.memberEnd->at(i).type.conformsTo(ga.memberEnd->at(i).type))) Only binary associations can be aggregations. OCL self.memberEnd->exists(aggregation <> Aggregation::none) implies self.memberEnd->size() = 2 Association ends of associations with more than two ends must be owned by the association. OCL if memberEnd->size() > 2 then ownedEnd->includesAll(memberEnd) Specifies whether the association is derived from other model elements such as other associations or constraints. The ends that are owned by the association itself. References the classifiers that are used as types of the ends of the association. Each end represents participation of instances of the classifier connected to the end in links of the association. The navigable ends that are owned by the association itself. endType is derived from the types of the member ends. OCL result = self.memberEnd->collect(e | e.type) A namespace is an element in a model that contains a set of named elements that can be identified by name. All the members of a Namespace are distinguishable within it. OCL membersAreDistinguishable() References the ElementImports owned by the Namespace. References the PackageImports owned by the Namespace. Specifies a set of Constraints owned by this Namespace. A collection of NamedElements owned by the Namespace. A collection of NamedElements identifiable within the Namespace, either by being owned or by being introduced by importing or inheritance. References the PackageableElements that are members of this Namespace as a result of either PackageImports or ElementImports. The importedMember property is derived from the ElementImports and the PackageImports. References the PackageableElements that are members of this Namespace as a result of either PackageImports or ElementImports. OCL result = self.importMembers(self.elementImport.importedElement.asSet()- >union(self.packageImport.importedPackage->collect(p | p.visibleMembers()))) The query getNamesOfMember() gives a set of all of the names that a member would have in a Namespace. In general a member can have multiple names in a Namespace if it is imported more than once with different aliases. The query takes account of importing. It gives back the set of names that an element would have in an importing namespace, either because it is owned, or if not owned then imported individually, or if not individually then from a package. OCL result = if self.ownedMember ->includes(element) then Set{}->include(element.name) else let elementImports: ElementImport = self.elementImport->select(ei | ei.importedElement = element) in if elementImports->notEmpty() then elementImports->collect(el | el.getName()) else self.packageImport->select(pi | pi.importedPackage.visibleMembers()->includes(element))-> collect(pi | pi.importedPackage.getNamesOfMember(element)) endif endif The Boolean query membersAreDistinguishable() determines whether all of the namespace's members are distinguishable within it. OCL result = self.member->forAll( memb | self.member->excluding(memb)->forAll(other | memb.isDistinguishableFrom(other, self))) The query importMembers() defines which of a set of PackageableElements are actually imported into the namespace. This excludes hidden ones, i.e., those which have names that conflict with names of owned members, and also excludes elements which would have the same name when imported. OCL result = self.excludeCollisions(imps)->select(imp | self.ownedMember->forAll(mem | mem.imp.isDistinguishableFrom(mem, self))) The query excludeCollisions() excludes from a set of PackageableElements any that would not be distinguishable from each other in this namespace. OCL result = imps->reject(imp1 | imps.exists(imp2 | not imp1.isDistinguishableFrom(imp2, self))) A value specification is the specification of a (possibly empty) set of instances, including both objects and data values. The query isComputable() determines whether a value specification can be computed in a model. This operation cannot be fully defined in OCL. A conforming implementation is expected to deliver true for this operation for all value specifications that it can compute, and to compute all of those for which the operation is true. A conforming implementation is expected to be able to compute the value of all literals. OCL result = false The query integerValue() gives a single Integer value when one can be computed. OCL result = Set{} The query booleanValue() gives a single Boolean value when one can be computed. OCL result = Set{} The query stringValue() gives a single String value when one can be computed. OCL result = Set{} The query unlimitedValue() gives a single UnlimitedNatural value when one can be computed. OCL result = Set{} The query isNull() returns true when it can be computed that the value is null. OCL result = false Relationship is an abstract concept that specifies some kind of relationship between elements. Specifies the elements related by the Relationship. A package merge defines how the contents of one package are extended by the contents of another package. References the Package that is being extended with the contents of the merged package of the PackageMerge. References the Package that is to be merged with the receiving package of the PackageMerge. An instance value is a value specification that identifies an instance. The instance that is the specified value. A literal unlimited natural is a specification of an unlimited natural number. The specified UnlimitedNatural value. The query isComputable() is redefined to be true. OCL result = true The query unlimitedValue() gives the value. OCL result = value A type constrains the values represented by a typed element. Specifies the owning package of this classifier, if any. The query conformsTo() gives true for a type that conforms to another. By default, two types do not conform to each other. This query is intended to be redefined for specific conformance situations. OCL result = false An expression represents a node in an expression tree, which may be non-terminal or terminal. It defines a symbol, and has a possibly empty sequence of operands which are value specifications. The symbol associated with the node in the expression tree. Specifies a sequence of operands. AggregationKind is an enumeration type that specifies the literals for defining the kind of aggregation of a property. Indicates that the property has no aggregation. Indicates that the property has a shared aggregation. Indicates that the property is aggregated compositely, i.e., the composite object has responsibility for the existence and storage of the composed objects (parts). Parameter direction kind is an enumeration type that defines literals used to specify direction of parameters. Indicates that parameter values are passed into the behavioral element by the caller. Indicates that parameter values are passed into a behavioral element by the caller and then back out to the caller from the behavioral element. Indicates that parameter values are passed as return values from a behavioral element back to the caller. VisibilityKind is an enumeration type that defines literals to determine the visibility of elements in a model. The query bestVisibility() examines a set of VisibilityKinds, and returns public as the preferred visibility. OCL pre: not vis->includes(#protected) and not vis->includes(#package) OCL result = if vis->includes(#public) then #public else #private endif An interface is a kind of classifier that represents a declaration of a set of coherent public features and obligations. An interface specifies a contract; any instance of a classifier that realizes the interface must fulfill that contract. The obligations that may be associated with an interface are in the form of various kinds of constraints (such as pre- and post-conditions) or protocol specifications, which may impose ordering restrictions on interactions through the interface. The visibility of all features owned by an interface must be public. OCL self.feature->forAll(f | f.visibility = #public) The attributes (i.e. the properties) owned by the class. The operations owned by the class. References all the Classifiers that are defined (nested) within the Class. References all the Interfaces redefined by this Interface. An interface realization is a specialized realization relationship between a classifier and an interface. This relationship signifies that the realizing classifier conforms to the contract specified by the interface. References the Interface specifying the conformance contract. References the BehavioredClassifier that owns this Interfacerealization (i.e., the classifier that realizes the Interface to which it points). A behaviored classifier may have an interface realization. The set of InterfaceRealizations owned by the BehavioredClassifier. Interface realizations reference the Interfaces of which the BehavioredClassifier is an implementation. The Interface that owns this Operation. References the Interface that owns the Property A usage is a relationship in which one element requires another element (or set of elements) for its full implementation or operation. A usage is a dependency in which the client requires the presence of the supplier. An abstraction is a relationship that relates two elements or sets of elements that represent the same concept at different levels of abstraction or from different viewpoints. An composition of an Expression that states the abstraction relationship between the supplier and the client. In some cases, such as Derivation, it is usually formal and unidirectional; in other cases, such as Trace, it is usually informal and bidirectional. The mapping expression is optional and may be omitted if the precise relationship between the elements is not specified. A dependency is a relationship that signifies that a single or a set of model elements requires other model elements for their specification or implementation. This means that the complete semantics of the depending elements is either semantically or structurally dependent on the definition of the supplier element(s). The element(s) independent of the client element(s), in the same respect and the same dependency relationship. In some directed dependency relationships (such as Refinement Abstractions), a common convention in the domain of class-based OO software is to put the more abstract element in this role. Despite this convention, users of UML may stipulate a sense of dependency suitable for their domain, which makes a more abstract element dependent on that which is more specific. The element(s) dependent on the supplier element(s). In some cases (such as a Trace Abstraction) the assignment of direction (that is, the designation of the client element) is at the discretion of the modeler, and is a stipulation. Realization is a specialized abstraction relationship between two sets of model elements, one representing a specification (the supplier) and the other represents an implementation of the latter (the client). Realization can be used to model stepwise refinement, optimizations, transformations, templates, model synthesis, framework composition, etc. A substitution is a relationship between two classifiers signifies that the substituting classifier complies with the contract specified by the contract classifier. This implies that instances of the substituting classifier are runtime substitutable where instances of the contract classifier are expected. The contract with which the substituting classifier complies. Instances of the substituting classifier are runtime substitutable where instances of the contract classifier are expected. References the substitutions that are owned by this Classifier. Indicates the dependencies that reference the client. Specifies the namespace that owns the NamedElement. A collection of NamedElements owned by the Namespace. Indicates the dependencies that reference the supplier. A generalization set is a packageable element whose instances define collections of subsets of generalization relationships. Every Generalization associated with a particular GeneralizationSet must have the same general Classifier. OCL generalization->collect(g | g.general)->asSet()->size() <= 1 The Classifier that maps to a GeneralizationSet may neither be a specific nor a general Classifier in any of the Generalization relationships defined for that GeneralizationSet. In other words, a power type may not be an instance of itself nor may its instances be its subclasses. OCL true Indicates (via the associated Generalizations) whether or not the set of specific Classifiers are covering for a particular general classifier. When isCovering is true, every instance of a particular general Classifier is also an instance of at least one of its specific Classifiers for the GeneralizationSet. When isCovering is false, there are one or more instances of the particular general Classifier that are not instances of at least one of its specific Classifiers defined for the GeneralizationSet. Indicates whether or not the set of specific Classifiers in a Generalization relationship have instance in common. If isDisjoint is true, the specific Classifiers for a particular GeneralizationSet have no members in common; that is, their intersection is empty. If isDisjoint is false, the specific Classifiers in a particular GeneralizationSet have one or more members in common; that is, their intersection is not empty. For example, Person could have two Generalization relationships, each with the different specific Classifier: Manager or Staff. This would be disjoint because every instance of Person must either be a Manager or Staff. In contrast, Person could have two Generalization relationships involving two specific (and non-covering) Classifiers: Sales Person and Manager. This GeneralizationSet would not be disjoint because there are instances of Person which can be a Sales Person and a Manager. Designates the Classifier that is defined as the power type for the associated GeneralizationSet. Designates the instances of Generalization which are members of a given GeneralizationSet. The Classifier that maps to a GeneralizationSet may neither be a specific nor a general Classifier in any of the Generalization relationships defined for that GeneralizationSet. In other words, a power type may not be an instance of itself nor may its instances also be its subclasses. OCL true Designates the GeneralizationSet of which the associated Classifier is a power type. A generalization relates a specific classifier to a more general classifier, and is owned by the specific classifier. Every Generalization associated with a given GeneralizationSet must have the same general Classifier. That is, all Generalizations for a particular GeneralizationSet must have the same superclass. OCL true Designates a set in which instances of Generalization is considered members. A model element that has both association and class properties. An AssociationClass can be seen as an association that also has class properties, or as a class that also has association properties. It not only connects a set of classifiers but also defines a set of features that belong to the relationship itself and not to any of the classifiers. An AssociationClass cannot be defined between itself and something else. OCL self.endType->excludes(self) and self.endType>collect(et|et.allparents()->excludes(self)) The owned attributes and owned ends of an AssociationClass are disjoint OCL ownedAttribute->intersection(ownedEnd)->isEmpty() Property represents a declared state of one or more instances in terms of a named relationship to a value or values. When a property is an attribute of a classifier, the value or values are related to the instance of the classifier by being held in slots of the instance. When a property is an association end, the value or values are related to the instance or instances at the other end(s) of the association. The range of valid values represented by the property can be controlled by setting the property's type. An optional list of ordered qualifier attributes for the end. If the list is empty, then the Association is not qualified. Designates the optional association end that owns a qualifier attribute. A behavioral feature is implemented (realized) by a behavior. A behavioral feature specifies that a classifier will respond to a designated request by invoking its implementing method. Specifies the semantics of concurrent calls to the same passive instance (i.e., an instance originating from a class with isActive being false). Active instances control access to their own behavioral features. A call event models the receipt by an object of a message invoking a call of an operation. Designates the operation whose invocation raised the call event. A change event models a change in the system configuration that makes a condition true. A Boolean-valued expression that will result in a change event whenever its value changes from false to true. A class may be designated as active (i.e., each of its instances having its own thread of control) or passive (i.e., each of its instances executing within the context of some other object). A class may also specify which signals the instances of this class handle. A passive class may not own receptions. OCL not self.isActive implies self.ownedReception.isEmpty() Determines whether an object specified by this class is active or not. If true, then the owning class is referred to as an active class. If false, then such a class is referred to as a passive class. Receptions that objects of this class are willing to accept. A trigger relates an event to a behavior that may affect an instance of the classifier. The event that causes the trigger. Interfaces may include receptions (in addition to operations). Receptions that objects providing this interface are willing to accept. A reception is a declaration stating that a classifier is prepared to react to the receipt of a signal. A reception designates a signal and specifies the expected behavioral response. The details of handling a signal are specified by the behavior associated with the reception or the classifier itself. A Reception can not be a query. OCL not self.isQuery The signal that this reception handles. A signal is a specification of send request instances communicated between objects. The receiving object handles the received request instances as specified by its receptions. The data carried by a send request (which was passed to it by the send invocation occurrence that caused that request) are represented as attributes of the signal. A signal is defined independently of the classifiers handling the signal occurrence. The attributes owned by the signal. A signal event represents the receipt of an asynchronous signal instance. A signal event may, for example, cause a state machine to trigger a transition. The specific signal that is associated with this event. A message event specifies the receipt by an object of either a call or a signal. A trigger for an AnyReceiveEvent is triggered by the receipt of any message that is not explicitly handled by any related trigger. A classifier can have behavior specifications defined in its namespace. One of these may specify the behavior of the classifier itself. References Trigger descriptions owned by a Classifier. An event is the specification of some occurrence that may potentially trigger effects by an object. An operation may invoke both the execution of method behaviors as well as other behavioral responses. CallConcurrencyKind is an enumeration type. No concurrency management mechanism is associated with the operation and, therefore, concurrency conflicts may occur. Instances that invoke a behavioral feature need to coordinate so that only one invocation to a target on any behavioral feature occurs at once. Multiple invocations of a behavioral feature may occur simultaneously to one instance, but only one is allowed to commence. The others are blocked until the performance of the currently executing behavioral feature is complete. It is the responsibility of the system designer to ensure that deadlocks do not occur due to simultaneous blocks. Multiple invocations of a behavioral feature may occur simultaneously to one instance and all of them may proceed concurrently. Behavior is a specification of how its context classifier changes state over time. This specification may be either a definition of possible behavior execution or emergent behavior, or a selective illustration of an interesting subset of possible executions. The latter form is typically used for capturing examples, such as a trace of a particular execution. The parameters of the behavior must match the parameters of the implemented behavioral feature. OCL true The implemented behavioral feature must be a feature (possibly inherited) of the context classifier of the behavior. OCL true If the implemented behavioral feature has been redefined in the ancestors of the owner of the behavior, then the behavior must realize the latest redefining behavioral feature. OCL true There may be at most one behavior for a given pairing of classifier (as owner of the behavior) and behavioral feature (as specification of the behavior). OCL true Tells whether the behavior can be invoked while it is still executing from a previous invocation. References a behavior that this behavior redefines. A subtype of Behavior may redefine any other subtype of Behavior. If the behavior implements a behavioral feature, it replaces the redefined behavior. If the behavior is a classifier behavior, it extends the redefined behavior. Designates a behavioral feature that the behavior implements. The behavioral feature must be owned by the classifier that owns the behavior or be inherited by it. The parameters of the behavioral feature and the implementing behavior must match. A behavior does not need to have a specification, in which case it either is the classifer behavior of a BehavioredClassifier or it can only be invoked by another behavior of the classifier. References a list of parameters to the behavior which describes the order and type of arguments that can be given when the behavior is invoked and of the values which will be returned when the behavior completes its execution. The classifier that is the context for the execution of the behavior. If the behavior is owned by a BehavioredClassifier, that classifier is the context. Otherwise, the context is the first BehavioredClassifier reached by following the chain of owner relationships. For example, following this algorithm, the context of an entry action in a state machine is the classifier that owns the state machine. The features of the context classifier as well as the elements visible to the context classifier are visible to the behavior. An optional set of Constraints specifying what must be fulfilled when the behavior is invoked. An optional set of Constraints specifying what is fulfilled after the execution of the behavior is completed, if its precondition was fulfilled before its invocation. A classifier can have behavior specifications defined in its namespace. One of these may specify the behavior of the classifier itself. If a behavior is classifier behavior, it does not have a specification. OCL self.classifierBehavior->notEmpty() implies self.classifierBehavior.specification->isEmpty() References behavior specifications owned by a classifier. A behavior specification that specifies the behavior of the classifier itself. Provides a mechanism for precisely defining the behavior of an opaque expression. An opaque expression is defined by a behavior restricted to return one result. The behavior may only have return result parameters. OCL self.behavior.notEmpty() implies self.behavior.ownedParameters->select(p | p.direction<>#return)->isEmpty() The behavior must have exactly one return result parameter. OCL self.behavior.notEmpty() implies self.behavior.ownedParameter->select(p | p.direction=#return)->size() = 1 Restricts an opaque expression to return exactly one return result. When the invocation of the opaque expression completes, a single set of values is returned to its owner. This association is derived from the single return result parameter of the associated behavior. Specifies the behavior of the opaque expression. A behavioral feature is implemented (realized) by a behavior. A behavioral feature specifies that a classifier will respond to a designated request by invoking its implementing method. If true, then the behavioral feature does not have an implementation, and one must be supplied by a more specific element. If false, the behavioral feature must have an implementation in the classifier or one must be inherited from a more general element. A behavioral description that implements the behavioral feature. There may be at most one behavior for a particular pairing of a classifier (as owner of the behavior) and a behavioral feature (as specification of the behavior). An behavior with implementation-specific semantics. Specifies the behavior in one or more languages. Languages the body strings use in the same order as the body strings. A function behavior is an opaque behavior that does not access or modify any objects or other external data. A function behavior has at least one output parameter. OCL self.ownedParameters-> select(p | p.direction=#out or p.direction=#inout or p.direction=#return)->size() >= 1 The types of parameters are all data types, which may not nest anything but other datatypes. OCL def: hasAllDataTypeAttributes(d : DataType) : Boolean = d.ownedAttribute->forAll(a | a.type.oclIsTypeOf(DataType) and hasAllDataTypeAttributes(a.type)) self.ownedParameters->forAll(p | p.type.notEmpty() and p.oclIsTypeOf(DataType) and hasAllDataTypeAttributes(p)) A time expression defines a value specification that represents a time value. The value of the time expression. Refers to the time and duration observations that are involved in expr. Duration defines a value specification that specifies the temporal distance between two time instants. The value of the Duration. Refers to the time and duration observations that are involved in expr. A duration interval defines the range between two durations. Refers to the Duration denoting the minimum value of the range. Refers to the Duration denoting the maximum value of the range. A time constraint is a constraint that refers to a time interval. A condition that must be true when evaluated in order for the constraint to be satisfied. The value of firstEvent is related to constrainedElement. If firstEvent is true, then the corresponding observation event is the first time instant the execution enters constrainedElement. If firstEvent is false, then the corresponding observation event is the last time instant the execution is within constrainedElement. A time interval defines the range between two time expressions. Refers to the TimeExpression denoting the maximum value of the range. Refers to the TimeExpression denoting the minimum value of the range. A duration constraint is a constraint that refers to a duration interval. The multiplicity of firstEvent must be 2 if the multiplicity of constrainedElement is 2. Otherwise the multiplicity of firstEvent is 0. OCL if (constrainedElement->size() =2) then (firstEvent->size() = 2) else (firstEvent->size() = 0) The interval constraining the duration. The value of firstEvent[i] is related to constrainedElement[i] (where i is 1 or 2). If firstEvent[i] is true, then the corresponding observation event is the first time instant the execution enters constrainedElement[i]. If firstEvent[i] is false, then the corresponding observation event is the last time instant the execution is within constrainedElement[i]. Default value is true applied when constrainedElement[i] refers an element that represents only one time instant. An interval constraint is a constraint that refers to an interval. A condition that must be true when evaluated in order for the constraint to be satisfied. An interval defines the range between two value specifications. Refers to the ValueSpecification denoting the minimum value of the range. Refers to the ValueSpecification denoting the maximum value of the range. A time event specifies a point in time. At the specified time, the event occurs. The ValueSpecification when must return a non-negative Integer. OCL true Specifies whether it is relative or absolute time. Specifies the corresponding time deadline. Observation is a superclass of TimeObservation and DurationObservation in order for TimeExpression and Duration to refer to either in a simple way. A time observation is a reference to a time instant during an execution. It points out the element in the model to observe and whether the observation is when this model element is entered or when it is exited. The observation is determined by the entering or exiting of the event element during execution. The value of firstEvent is related to event. If firstEvent is true, then the corresponding observation event is the first time instant the execution enters event. If firstEvent is false, then the corresponding observation event is the time instant the execution exits event. A duration observation is a reference to a duration during an execution. It points out the element(s) in the model to observe and whether the observations are when this model element is entered or when it is exited. The multiplicity of firstEvent must be 2 if the multiplicity of event is 2. Otherwise the multiplicity of firstEvent is 0. OCL if (event->size() = 2) then (firstEvent->size() = 2) else (firstEvent->size() = 0) The observation is determined by the entering or exiting of the event element during execution. The value of firstEvent[i] is related to event[i] (where i is 1 or 2). If firstEvent[i] is true, then the corresponding observation event is the first time instant the execution enters event[i]. If firstEvent[i] is false, then the corresponding observation event is the time instant the execution exits event[i]. Default value is true applied when event[i] refers an element that represents only one time instant. In the namespace of a component, all model elements that are involved in or related to its definition are either owned or imported explicitly. This may include, for example, use cases and dependencies (e.g. mappings), packages, components, and artifacts. component nested in a Class cannot have any packaged elements. OCL (not self.class->isEmpty()) implies self.packagedElement->isEmpty() The set of PackageableElements that a Component owns. In the namespace of a component, all model elements that are involved in or related to its definition may be owned or imported explicitly. These may include e.g. Classes, Interfaces, Components, Packages, Use cases, Dependencies (e.g. mappings), and Artifacts. A component represents a modular part of a system that encapsulates its contents and whose manifestation is replaceable within its environment. A component cannot nest classifiers. OCL self.nestedClassifier->isEmpty() isIndirectlyInstantiated : Boolean {default = true} The kind of instantiation that applies to a Component. If false, the component is instantiated as an addressable object. If true, the Component is defined at design-time, but at run-time (or execution-time) an object specified by the Component does not exist, that is, the component is instantiated indirectly, through the instantiation of its realizing classifiers or parts. Several standard stereotypes use this meta attribute (e.g., «specification», «focus», «subsystem»). The interfaces that the component requires from other components in its environment in order to be able to offer its full set of provided functionality. These interfaces may be used by the Component or any of its realizingClassifiers, or they may be the Interfaces that are required by its public Ports. The interfaces that the component exposes to its environment. These interfaces may be Realized by the Component or any of its realizingClassifiers, or they may be the Interfaces that are provided by its public Ports. The set of Realizations owned by the Component. Realizations reference the Classifiers of which the Component is an abstraction; i.e., that realize its behavior. Utility returning the set of realized interfaces of a component. OCL result = (classifier.clientDependency-> select(dependency|dependency.oclIsKindOf(Realization) and dependency.supplier.oclIsKindOf(Interface)))-> collect(dependency|dependency.client) Utility returning the set of used interfaces of a component. OCL result = (classifier.supplierDependency-> select(dependency|dependency.oclIsKindOf(Usage) and dependency.supplier.oclIsKindOf(interface)))-> collect(dependency|dependency.supplier) OCL result = let usedInterfaces : Set(Interface) = UsedInterfaces(self), realizingClassifiers : Set(Classifier) = Set{self.realizingClassifier}->union(self.allParents().realizingClassifier), allRealizingClassifiers : Set(Classifier) = realizingClassifiers->union(realizingClassifiers.allParents()), realizingClassifierInterfaces : Set(Interface) = allRealizingClassifiers->iterate(c; rci : Set(Interface) = Set{} | rci->union(UsedInterfaces(c))), ports : Set(Port) = self.ownedPort->union(allParents.oclAsType(Set(EncapsulatedClassifier)).ownedPort), usedByPorts : Set(Interface) = ports.required in usedInterfaces->union(realizingClassifierInterfaces) ->union(usedByPorts)->asSet() OCL result = let realizedInterfaces : Set(Interface) = RealizedInterfaces(self) , realizingClassifiers : Set(Classifier) = Set{self.realizingClassifier}->union(self.allParents().realizingClassifier), allRealizingClassifiers : Set(Classifier) = realizingClassifiers->union(realizingClassifiers.allParents()) , realizingClassifierInterfaces : Set(Interface) = allRealizingClassifiers->iterate(c; rci : Set(Interface) = Set{} | rci->union(RealizedInterfaces(c))) , ports : Set(Port) = self.ownedPort->union(allParents.oclAsType(Set(EncapsulatedClassifier)).ownedPort) , providedByPorts : Set(Interface) = ports.provided in realizedInterfaces->union(realizingClassifierInterfaces) ->union(providedByPorts)->asSet() The realization concept is specialized to (optionally) define the classifiers that realize the contract offered by a component in terms of its provided and required interfaces. The component forms an abstraction from these various classifiers. The Component that owns this ComponentRealization and which is implemented by its realizing classifiers. The classifiers that are involved in the implementation of the Component that owns this Realization. A delegation connector is a connector that links the external contract of a component (as specified by its ports) to the realization of that behavior. It represents the forwarding of events (operation requests and events): a signal that arrives at a port that has a delegation connector to one or more parts or ports on parts will be passed on to those targets for handling. An assembly connector is a connector between two or more parts or ports on parts that defines that one or more parts provide the services that other parts use. Each feature of each of the required interfaces of each Port or Part at the end of a connector must have at least one compatible feature among the features of the provided interfaces of Ports or Parts at the other ends, where the required set of (interface) features of a delegating port from the context of the delegating connector is the set of features that exist in the port's provided interfaces, and the provided set of (interface) features of a delegating port from the context of the delegating connector is the set of features that exist in the port's required interfaces. OCL true Indicates the kind of connector. This is derived: a connector with one or more ends connected to a Port which is not on a Part and which is not a behavior port is a delegation; otherwise it is an assembly. The set of Behaviors that specify the valid interaction patterns across the connector. OCL result = if end->exists( role.oclIsKindOf(Port) and partWithPort->isEmpty() and not role.oclAsType(Port).isBehavior) then ConnectorKind::delegation else ConnectorKind::assembly endif ConnectorKind is an enumeration type. Indicates that the connector is an assembly connector. Indicates that the connector is a delegation connector. A class has the capability to have an internal structure and ports. A collaboration use represents one particular use of a collaboration to explain the relationships between the properties of a classifier. A collaboration use shows how the pattern described by a collaboration is applied in a given context, by binding specific entities from that context to the roles of the collaboration. Depending on the context, these entities could be structural features of a classifier, instance specifications, or even roles in some containing collaboration. There may be multiple occurrences of a given collaboration within a classifier, each involving a different set of roles and connectors. A given role or connector may be involved in multiple occurrences of the same or different collaborations. Associated dependencies map features of the collaboration type to features in the classifier. These dependencies indicate which role in the classifier plays which role in the collaboration. All the client elements of a roleBinding are in one classifier and all supplier elements of a roleBinding are in one collaboration and they are compatible. OCL true Every role in the collaboration is bound within the collaboration use to a connectable element within the owning classifier. OCL true The connectors in the classifier connect according to the connectors in the collaboration OCL true The collaboration which is used in this occurrence. The collaboration defines the cooperation between its roles which are mapped to properties of the classifier owning the collaboration use. A mapping between features of the collaboration type and features of the owning classifier. This mapping indicates which connectable element of the classifier plays which role(s) in the collaboration. A connectable element may be bound to multiple roles in the same collaboration use (that is, it may play multiple roles). A collaboration use represents the application of the pattern described by a collaboration to a specific situation involving specific classes or instances playing the roles of the collaboration. References connectable elements (possibly owned by other classifiers) which represent roles that instances may play in this collaboration. A classifier has the capability to own collaboration uses. These collaboration uses link a collaboration with the classifier to give a description of the workings of the classifier. References a collaboration use which indicates the collaboration that represents this classifier. References the collaboration uses owned by the classifier. Parameters are allowed to be treated as connectable elements. A parameter may only be associated with a connector end within the context of a collaboration. OCL self.end.notEmpty() implies self.collaboration.notEmpty() A port is a property of a classifier that specifies a distinct interaction point between that classifier and its environment or between the (behavior of the) classifier and its internal parts. Ports are connected to properties of the classifier by connectors through which requests can be made to invoke the behavioral features of a classifier. A Port may specify the services a classifier provides (offers) to its environment as well as the services that a classifier expects (requires) of its environment. Port.aggregation must be composite. OCL true When a port is destroyed, all connectors attached to this port will be destroyed also. OCL true A defaultValue for port cannot be specified when the type of the Port is an Interface OCL true Specifies whether requests arriving at this port are sent to the classifier behavior of this classifier. Such ports are referred to as behavior port. Any invocation of a behavioral feature targeted at a behavior port will be handled by the instance of the owning classifier itself, rather than by any instances that this classifier may contain. If true indicates that this port is used to provide the published functionality of a classifier; if false, this port is used to implement the classifier but is not part of the essential externally-visible functionality of the classifier and can, therefore, be altered or deleted along with the internal implementation of the classifier and other properties that are considered part of its implementation. References the interfaces specifying the set of operations and receptions that the classifier expects its environment to handle via this port. This association is derived according to the value of isConjugated. If isConjugated is false, required is derived as the union of the sets of interfaces used by the type of the port and its supertypes. If isConjugated is true, it is derived as the union of the sets of interfaces realized by the type of the port and its supertypes, or directly from the type of the port if the port is typed by an interface. A port may be redefined when its containing classifier is specialized. The redefining port may have additional interfaces to those that are associated with the redefined port or it may replace an interface by one of its subtypes. References the interfaces specifying the set of operations and receptions that the classifier offers to its environment via this port, and which it will handle either directly or by forwarding it to a part of its internal structure. This association is derived according to the value of isConjugated. If isConjugated is false, provided is derived as the union of the sets of interfaces realized by the type of the port and its supertypes, or directly from the type of the port if the port is typed by an interface. If isConjugated is true, it is derived as the union of the sets of interfaces used by the type of the port and its supertypes. Specifies the way that the provided and required interfaces are derived from the Port’s Type. The default value is false. A classifier has the ability to own ports as specific and type checked interaction points. References a set of ports that an encapsulated classifier owns. A connector end is an endpoint of a connector, which attaches the connector to a connectable element. Each connector end is part of one connector. If a connector end is attached to a port of the containing classifier, partWithPort will be empty. OCL true If a connector end references a partWithPort, then the role must be a port that is defined by the type of the partWithPort. OCL true The property held in self.partWithPort must not be a Port. OCL true Indicates the role of the internal structure of a classifier with the port to which the connector end is attached. In addition to targeting an object, invocation actions can also invoke behavioral features on ports from where the invocation requests are routed onwards on links deriving from attached connectors. Invocation actions may also be sent to a target via a given port, either on the sending object or on another object. The onPort must be a port on the receiver object. OCL true A optional port of the receiver object on which the behavioral feature is invoked. A trigger specification may be qualified by the port on which the event occurred. A optional port of the receiver object on which the behavioral feature is invoked. A connector end is an endpoint of a connector, which attaches the connector to a connectable element. Each connector end is part of one connector. The multiplicity of the connector end may not be more general than the multiplicity of the association typing the owning connector. OCL true A derived association referencing the corresponding association end on the association which types the connector owing this connector end. This association is derived by selecting the association end at the same place in the ordering of association ends as this connector end. The connectable element attached at this connector end. When an instance of the containing classifier is created, a link may (depending on the multiplicities) be created to an instance of the classifier that types this connectable element. Specifies a link that enables communication between two or more instances. This link may be an instance of an association, or it may represent the possibility of the instances being able to communicate because their identities are known by virtue of being passed in as parameters, held in variables or slots, or because the communicating instances are the same instance. The link may be realized by something as simple as a pointer or by something as complex as a network connection. In contrast to associations, which specify links between any instance of the associated classifiers, connectors specify links between instances playing the connected parts only. The types of the connectable elements that the ends of a connector are attached to must conform to the types of the association ends of the association that types the connector, if any. OCL true The connectable elements attached to the ends of a connector must be compatible. OCL true The ConnectableElements attached as roles to each ConnectorEnd owned by a Connector must be roles of the Classifier that owned the Connector, or they must be ports of such roles. OCL true An optional association that specifies the link corresponding to this connector. A connector may be redefined when its containing classifier is specialized. The redefining connector may have a type that specializes the type of the redefined connector. The types of the connector ends of the redefining connector may specialize the types of the connector ends of the redefined connector. The properties of the connector ends of the redefining connector may be replaced. A connector consists of at least two connector ends, each representing the participation of instances of the classifiers typing the connectable elements attached to this end. The set of connector ends is ordered. A property represents a set of instances that are owned by a containing classifier instance. A structured classifier is an abstract metaclass that represents any classifier whose behavior can be fully or partly described by the collaboration of owned or referenced instances. The multiplicities on connected elements must be consistent. OCL true References the properties owned by the classifier. References the properties specifying instances that the classifier owns by composition. This association is derived, selecting those owned properties where isComposite is true. References the roles that instances may play in this classifier. References the connectors owned by the classifier. ConnectableElement is an abstract metaclass representing a set of instances that play roles of a classifier. Connectable elements may be joined by attached connectors and specify configurations of linked instances to be created within an instance of the containing classifier. Denotes a connector that attaches to this connectable element. OCL result = ConnectorEnd.allInstances()->select(e | e.role=self) A classifier has the capability to own collaboration uses. These collaboration uses link a collaboration with the classifier to give a description of the workings of the classifier. Refers to all of the Properties that are direct (i.e. not inherited or imported) attributes of the classifier. A variable is considered a connectable element. A component deployment is the deployment of one or more artifacts or artifact instances to a deployment target, optionally parameterized by a deployment specification. Examples are executables and configuration files. The specification of properties that parameterize the deployment and execution of one or more Artifacts. A deployment specification specifies a set of properties that determine execution parameters of a component artifact that is deployed on a node. A deployment specification can be aimed at a specific type of container. An artifact that reifies or implements deployment specification properties is a deployment descriptor. The deployedElements of a DeploymentTarget that are involved in a Deployment that has an associated Deployment-Specification is a kind of Component (i.e. the configured components). OCL self.deployment->forAll (d | d.location.deployedElements->forAll (de | de.oclIsKindOf(Component))) The DeploymentTarget of a DeploymentSpecification is a kind of ExecutionEnvironment. OCL result = self.deployment->forAll (d | d.location..oclIsKindOf(ExecutionEnvironment)) The location where an Artifact is deployed onto a Node. This is typically a 'directory' or 'memory address'. The location where a component Artifact executes. This may be a local or remote location. The deployment with which the DeploymentSpecification is associated. A deployment is the allocation of an artifact or artifact instance to a deployment target. The Artifacts that are deployed onto a Node. This association specializes the supplier association. The DeployedTarget which is the target of a Deployment. A node is computational resource upon which artifacts may be deployed for execution. Nodes can be interconnected through communication paths to define network structures. The internal structure of a Node (if defined) consists solely of parts of type Node. OCL true The Nodes that are defined (nested) within the Node. A device is a physical computational resource with processing capability upon which artifacts may be deployed for execution. Devices may be complex (i.e., they may consist of other devices). An execution environment is a node that offers an execution environment for specific types of components that are deployed on it in the form of executable artifacts. A deployment target is the location for a deployed artifact. The set of Deployments for a DeploymentTarget. The set of elements that are manifested in an Artifact that is involved in Deployment to a DeploymentTarget. OCL result = ((self.deployment->collect(deployedArtifact))->collect(manifestation))->collect(utilizedElement) A deployed artifact is an artifact or artifact instance that has been deployed to a deployment target. A communication path is an association between two deployment targets, through which they are able to exchange signals and messages. The association ends of a CommunicationPath are typed by DeploymentTargets. OCL result = self.endType->forAll (t | t.oclIsKindOf(DeploymentTarget)) A property has the capability of being a deployment target in a deployment relationship. This enables modeling the deployment to hierarchical nodes that have properties functioning as internal parts. A Property can be a DeploymentTarget if it is a kind of Node and functions as a part in the internal structure of an encompassing Node. OCL true An instance specification has the capability of being a deployment target in a deployment relationship, in the case that it is an instance of a node. It is also has the capability of being a deployed artifact, if it is an instance of an artifact. An InstanceSpecification can be a DeploymentTarget if it is the instance specification of a Node and functions as a part in the internal structure of an encompassing Node. OCL true An InstanceSpecification can be a DeployedArtifact if it is the instance specification of an Artifact. OCL true An artifact is the source of a deployment to a node. An artifact is the specification of a physical piece of information that is used or produced by a software development process, or by deployment and operation of a system. Examples of artifacts include model files, source files, scripts, and binary executable files, a table in a database system, a development deliverable, or a word-processing document, a mail message. A concrete name that is used to refer to the Artifact in a physical context. Example: file system name, universal resource locator. The Artifacts that are defined (nested) within the Artifact. The association is a specialization of the ownedMember association from Namespace to NamedElement. The set of model elements that are manifested in the Artifact. That is, these model elements are utilized in the construction (or generation) of the artifact. The Operations defined for the Artifact. The association is a specialization of the ownedMember association. The attributes or association ends defined for the Artifact. The association is a specialization of the ownedMember association. A manifestation is the concrete physical rendering of one or more model elements by an artifact. The model element that is utilized in the manifestation in an Artifact. An interaction is a unit of behavior that focuses on the observable exchange of information between connectable elements. Specifies the participants in this Interaction. The Messages contained in this Interaction. The ordered set of fragments in the Interaction. Actions owned by the Interaction. A lifeline represents an individual participant in the interaction. While parts and structural features may have multiplicity greater than 1, lifelines represent only one interacting entity. If two (or more) InteractionUses within one Interaction, refer to Interactions with 'common Lifelines,' those Lifelines must also appear in the Interaction with the InteractionUses. By common Lifelines we mean Lifelines with the same selector and represents associations. OCL true The selector for a Lifeline must only be specified if the referenced Part is multivalued. OCL (self.selector->isEmpty() implies not self.represents.isMultivalued()) or (not self.selector->isEmpty() implies self.represents.isMultivalued()) The classifier containing the referenced ConnectableElement must be the same classifier, or an ancestor, of the classifier that contains the interaction enclosing this lifeline. OCL if (represents->notEmpty()) then (if selector->notEmpty() then represents.isMultivalued() else not represents.isMultivalued()) References the InteractionFragments in which this Lifeline takes part. References the ConnectableElement within the classifier that contains the enclosing interaction. References the Interaction enclosing this Lifeline. If the referenced ConnectableElement is multivalued, then this specifies the specific individual part within that set. InteractionFragment is an abstract notion of the most general interaction unit. An interaction fragment is a piece of an interaction. Each interaction fragment is conceptually like an interaction by itself. References the Lifelines that the InteractionFragment involves. The general ordering relationships contained in this fragment. The Interaction enclosing this InteractionFragment. A message defines a particular communication between lifelines of an interaction. If the sending MessageEvent and the receiving MessageEvent of the same Message are on the same Lifeline, the sending MessageEvent must be ordered before the receiving MessageEvent. OCL true The signature must either refer an Operation (in which case messageSort is either synchCall or asynchCall) or a Signal (in which case messageSort is asynchSignal). The name of the NamedElement referenced by signature must be the same as that of the Message. OCL true In the case when the Message signature is an Operation, the arguments of the Message must correspond to the parameters of the Operation. A Parameter corresponds to an Argument if the Argument is of the same Class or a specialization of that of the Parameter. OCL true In the case when the Message signature is a Signal, the arguments of the Message must correspond to the attributes of the Signal. A Message Argument corresponds to a Signal Attribute if the Arguement is of the same Class or a specialization of that of the Attribute. OCL true Arguments of a Message must only be: i) attributes of the sending lifeline ii) constants iii) symbolic values (which are wildcard values representing any legal value) iv) explicit parameters of the enclosing Interaction v) attributes of the class owning the Interaction OCL true Messages cannot cross bounderies of CombinedFragments or their operands. OCL true If the MessageEnds are both OccurrenceSpecifications then the connector must go between the Parts represented by the Lifelines of the two MessageEnds. OCL true The derived kind of the Message (complete, lost, found or unknown) The sort of communication reflected by the Message References the Receiving of the Message References the Sending of the Message. The Connector on which this Message is sent. The enclosing Interaction owning the Message The arguments of the Message The definition of the type or signature of the Message (depending on its kind). The associated named element is derived from the message end that constitutes the sending or receiving message event. If both a sending event and a receiving message event are present, the signature is obtained from the sending event. A general ordering represents a binary relation between two occurrence specifications, to describe that one occurrence specification must occur before the other in a valid trace. This mechanism provides the ability to define partial orders of occurrence cpecifications that may otherwise not have a specified order. An occurrence specification must not be ordered relative to itself through a series of general orderings. (In other words, the transitive closure of the general orderings is irreflexive.) OCL start.lifeline = finish.lifeline The OccurrenceSpecification referenced comes before the OccurrenceSpecification referenced by after. The OccurrenceSpecification referenced comes after the OccurrenceSpecification referenced by before. An execution specification is a specification of the execution of a unit of behavior or action within the lifeline. The duration of an execution specification is represented by two cccurrence specifications, the start occurrence specification and the finish occurrence specification. The startEvent and the finishEvent must be on the same Lifeline OCL start.lifeline = finish.lifeline References the OccurrenceSpecification that designates the start of the Action or Behavior References the OccurrenceSpecification that designates the finish of the Action or Behavior. An occurrence specification is the basic semantic unit of interactions. The sequences of occurrences specified by them are the meanings of interactions. References the Lifeline on which the OccurrenceSpecification appears. References the GeneralOrderings that specify EventOcurrences that must occur after this OccurrenceSpecification References the GeneralOrderings that specify EventOcurrences that must occur before this OccurrenceSpecification References a specification of the occurring event. MessageEnd is an abstract specialization of NamedElement that represents what can occur at the end of a message. References a Message. A state invariant is a runtime constraint on the participants of the interaction. It may be used to specify a variety of different kinds of constraints, such as values of attributes or variables, internal or external states, and so on. A state invariant is an interaction fragment and it is placed on a lifeline. A Constraint that should hold at runtime for this StateInvariant References the Lifeline on which the StateInvariant appears. An action execution specification is a kind of execution specification representing the execution of an action. The Action referenced by the ActionExecutionSpecification, if any, must be owned by the Interaction owning the ActionExecutionOccurrence. OCL true Action whose execution is occurring. A behavior execution specification is a kind of execution specification representing the execution of a behavior. Behavior whose execution is occurring. An ExecutionEvent models the start or finish of an execution specification. A creation event models the creation of an object. No othet OccurrenceSpecification may appear above an OccurrenceSpecification which references a CreationEvent on a given Lifeline in an InteractionOperand. OCL true A destruction event models the destruction of an object. No other OccurrenceSpecifications may appear below an OccurrenceSpecification which references a DestructionEvent on a given Lifeline in an InteractionOperand. OCL true A send operation event models the invocation of an operation call. The operation associated with this event. A send signal event models the sending of a signal. The signal associated with this event. A message occurrence specification pecifies the occurrence of message events, such as sending and receiving of signals or invoking or receiving of operation calls. A message occurrence specification is a kind of message end. Messages are generated either by synchronous operation calls or asynchronous signal sends. They are received by the execution of corresponding accept event actions. An execution occurrence specification represents moments in time at which actions or behaviors start or finish. References the execution specification describing the execution that is started or finished at this execution event. The event referenced is restricted to an execution event. A receive operation event specifies the event of receiving an operation invocation for a particular operation by the target entity. The operation associated with this event. A receive signal event specifies the event of receiving a signal by the target entity. The signal associated with this event. This is an enumerated type that identifies the type of message. sendEvent and receiveEvent are present sendEvent present and receiveEvent absent sendEvent absent and receiveEvent present sendEvent and receiveEvent absent (should not appear) This is an enumerated type that identifies the type of communication action that was used to generate the message. The message was generated by a synchronous call to an operation. The message was generated by an asynchronous call to an operation; i.e., a CallAction with isSynchronous = false. The message was generated by an asynchronous send action. The message designating the creation of another lifeline object. The message designating the termination of another lifeline. The message is a reply message to an operation call. This association shows the lifelines that make up an interaction. A lifeline may be part of more than one interaction use. The event shows the time point at which the action begins execution. The event shows the time point at which the action completes execution. If a Part has multiplicity, multiple lifelines might be used to show it. An interaction use refers to an interaction. The interaction use is a shorthand for copying the contents of the referenced interaction where the interaction use is. To be accurate the copying must take into account substituting parameters with arguments and connect the formal gates with the actual ones. Actual Gates of the InteractionUse must match Formal Gates of the referred Interaction. Gates match when their names are equal. OCL true The InteractionUse must cover all Lifelines of the enclosing Interaction that represent the same properties as lifelines within the referred Interaction. OCL true The arguments of the InteractionUse must correspond to parameters of the referred Interaction OCL true The arguments must only be constants, parameters of the enclosing Interaction or attributes of the classifier owning the enclosing Interaction. OCL true Refers to the Interaction that defines its meaning The actual gates of the InteractionUse The actual arguments of the Interaction A part decomposition is a description of the internal interactions of one lifeline relative to an interaction. PartDecompositions apply only to Parts that are Parts of Internal Structures not to Parts of Collaborations. OCL true Assume that within Interaction X, Lifeline L is of class C and decomposed to D. Within X there is a sequence of constructs along L (such constructs are CombinedFragments, InteractionUse and (plain) OccurrenceSpecifications). Then a corresponding sequence of constructs must appear within D, matched one-to-one in the same order. i) CombinedFragment covering L are matched with an extra-global CombinedFragment in D ii) An InteractionUse covering L are matched with a global (i.e. covering all Lifelines) InteractionUse in D. iii) A plain OccurrenceSpecification on L is considered an actualGate that must be matched by a formalGate of D OCL true Assume that within Interaction X, Lifeline L is of class C and decomposed to D. Assume also that there is within X an InteractionUse (say) U that covers L. According to the constraint above U will have a counterpart CU within D. Within the Interaction referenced by U, L should also be decomposed, and the decomposition should reference CU. (This rule is called commutativity of decomposition) OCL true An interaction operand is contained in a combined fragment. An interaction operand represents one operand of the expression given by the enclosing combined fragment. The guard must be placed directly prior to (above) the OccurrenceSpecification that will become the first OccurrenceSpecification within this InteractionOperand. OCL true The guard must contain only references to values local to the Lifeline on which it resides, or values global to the whole Interaction. OCL true Constraint of the operand. The fragments of the operand. An interaction constraint is a Boolean expression that guards an operand in a combined fragment. The dynamic variables that take part in the constraint must be owned by the ConnectableElement corresponding to the covered Lifeline. OCL true The constraint may contain references to global data or write-once data. OCL true Minint/maxint can only be present if the InteractionConstraint is associated with the operand of a loop CombinedFragment. OCL true If minint is specified, then the expression must evaluate to a non-negative integer. OCL true If maxint is specified, then the expression must evaluate to a positive integer. OCL true If maxint is specified, then minint must be specified and the evaluation of maxint must be >= the evaluation of minint OCL true The minimum number of iterations of a loop The maximum number of iterations of a loop A gate is a connection point for relating a message outside an interaction fragment with a message inside the interaction fragment. The message leading to/from an actualGate of an InteractionUse must correspond to the message leading from/to the formalGate with the same name of the Interaction referenced by the InteractionUse. OCL true The message leading to/from an (expression) Gate within a CombinedFragment must correspond to the message leading from/to the CombinedFragment on its outside. OCL true A combined fragment defines an expression of interaction fragments. A combined fragment is defined by an interaction operator and corresponding interaction operands. Through the use of combined fragments the user will be able to describe a number of traces in a compact and concise manner. If the interactionOperator is opt, loop, break, assert or neg, there must be exactly one operand. OCL true The InteractionConstraint with minint and maxint only apply when attached to an InteractionOperand where the interactionOperator is loop. OCL true If the interactionOperator is break, the corresponding InteractionOperand must cover all Lifelines within the enclosing InteractionFragment. OCL true The interaction operators 'consider' and 'ignore' can only be used for the CombineIgnoreFragment subtype of CombinedFragment OCL ((interactionOperator = #consider) or (interactionOperator = #ignore)) implies oclsisTypeOf(CombineIgnoreFragment) Specifies the operation which defines the semantics of this combination of InteractionFragments. The set of operands of the combined fragment. Specifies the gates that form the interface between this CombinedFragment and its surroundings Specifies the gates that form the message interface between this Interaction and any InteractionUses which reference it. References the Interaction that represents the decomposition. A continuation is a syntactic way to define continuations of different branches of an alternative combined fragment. Continuations is intuitively similar to labels representing intermediate points in a flow of control. Continuations with the same name may only cover the same set of Lifelines (within one Classifier). OCL true Continuations are always global in the enclosing InteractionFragment e.g. it always covers all Lifelines covered by the enclosing InteractionFragment. OCL true Continuations always occur as the very first InteractionFragment or the very last InteractionFragment of the enclosing InteractionFragment. OCL true True: when the Continuation is at the end of the enclosing InteractionFragment and False when it is in the beginning. The operand enclosing this InteractionFragment (they may nest recursively) A consider ignore fragment is a kind of combined fragment that is used for the consider and ignore cases, which require lists of pertinent messages to be specified. The interaction operator of a ConsiderIgnoreFragment must be either 'consider' or 'ignore'. OCL (interactionOperator = #consider) or (interactionOperator = #ignore) The NamedElements must be of a type of element that identifies a message (e.g., an Operation, Reception, or a Signal). OCL message->forAll(m | m.oclIsKindOf(Operation) or m.oclIsKindOf(Reception) or m.oclIsKindOf(Signal)) The set of messages that apply to this fragment InteractionOperatorKind is an enumeration designating the different kinds of operators of combined fragments. The interaction operand defines the type of operator of a combined fragment. The interactionOperator seq designates that the CombinedFragment represents a weak sequencing between the behaviors of the operands. The interactionOperator alt designates that the CombinedFragment represents a choice of behavior. At most one of the operands will be chosen. The chosen operand must have an explicit or implicit guard expression that evaluates to true at this point in the interaction. An implicit true guard is implied if the operand has no guard. The interactionOperator opt designates that the CombinedFragment represents a choice of behavior where either the (sole) operand happens or nothing happens. An option is semantically equivalent to an alternative CombinedFragment where there is one operand with non-empty content and the second operand is empty. The interactionOperator break designates that the CombinedFragment represents a breaking scenario in the sense that the operand is a scenario that is performed instead of the remainder of the enclosing InteractionFragment. A break operator with a guard is chosen when the guard is true and the rest of the enclosing Interaction Fragment is ignored. When the guard of the break operand is false, the break operand is ignored and the rest of the enclosing InteractionFragment is chosen. The choice between a break operand without a guard and the rest of the enclosing InteractionFragment is done non-deterministically. The interactionOperator par designates that the CombinedFragment represents a parallel merge between the behaviors of the operands. The OccurrenceSpecifications of the different operands can be interleaved in any way as long as the ordering imposed by each operand as such is preserved. The interactionOperator strict designates that the CombinedFragment represents a strict sequencing between the behaviors of the operands. The semantics of strict sequencing defines a strict ordering of the operands on the first level within the CombinedFragment with interactionOperator strict. Therefore OccurrenceSpecifications within contained CombinedFragment will not directly be compared with other OccurrenceSpecifications of the enclosing CombinedFragment. The interactionOperator loop designates that the CombinedFragment represents a loop. The loop operand will be repeated a number of times. The interactionOperator critical designates that the CombinedFragment represents a critical region. A critical region means that the traces of the region cannot be interleaved by other OccurrenceSpecifications (on those Lifelines covered by the region). This means that the region is treated atomically by the enclosing fragment when determining the set of valid traces. Even though enclosing CombinedFragments may imply that some OccurrenceSpecifications may interleave into the region, such as e.g. with par-operator, this is prevented by defining a region. The interactionOperator neg designates that the CombinedFragment represents traces that are defined to be invalid. The interactionOperator assert designates that the CombinedFragment represents an assertion. The sequences of the operand of the assertion are the only valid continuations. All other continuations result in an invalid trace. The interacionOperator ignore designates that there are some message types that are not shown within this combined fragment. These message types can be considered insignificant and are implicitly ignored if they appear in a corresponding execution. Alternatively, one can understand ignore to mean that the message types that are ignored can appear anywhere in the traces. The interactionOperator consider designates which messages should be considered within this combined fragment. This is equivalent to defining every other message to be ignored. State machines can be used to express the behavior of part of a system. Behavior is modeled as a traversal of a graph of state nodes interconnected by one or more joined transition arcs that are triggered by the dispatching of series of (event) occurrences. During this traversal, the state machine executes a series of activities associated with various elements of the state machine. The classifier context of a state machine cannot be an interface. OCL context->notEmpty() implies not context.oclIsKindOf(Interface) The context classifier of the method state machine of a behavioral feature must be the classifier that owns the behavioral feature. OCL specification->notEmpty() implies (context->notEmpty() and specification->featuringClassifier->exists (c | c = context)) The connection points of a state machine are pseudostates of kind entry point or exit point. OCL conectionPoint->forAll (c | c.kind = #entryPoint or c.kind = #exitPoint) A state machine as the method for a behavioral feature cannot have entry/exit connection points. OCL specification->notEmpty() implies connectionPoint->isEmpty() The regions owned directly by the state machine. The connection points defined for this state machine. They represent the interface of the state machine when used as part of submachine state. The state machines of which this is an extension. References the submachine(s) in case of a submachine state. Multiple machines are referenced in case of a concurrent state. The operation LCA(s1,s2) returns an orthogonal state or region which is the least common ancestor of states s1 and s2, based on the statemachine containment hierarchy. OCL true The query ancestor(s1, s2) checks whether s1 is an ancestor state of state s2. OCL result = if (s2 = s1) then true else if (s2.container->isEmpty() or not s2.container.owner.oclIsKindOf(State)) then false else ancestor(s1, s2.container.owner.oclAsType(State)) endif endif The query isRedefinitionContextValid() specifies whether the redefinition contexts of a statemachine are properly related to the redefinition contexts of the specified statemachine to allow this element to redefine the other. The containing classifier of a redefining statemachine must redefine the containing classifier of the redefined statemachine. OCL result = true The query isConsistentWith() specifies that a redefining state machine is consistent with a redefined state machine provided that the redefining state machine is an extension of the redefined state machine: Regions are inherited and regions can be added, inherited regions can be redefined. In case of multiple redefining state machines, extension implies that the redefining state machine gets orthogonal regions for each of the redefined state machines. OCL result = true A state models a situation during which some (usually implicit) invariant condition holds. Only submachine states can have connection point references. OCL isSubmachineState implies connection->notEmpty ( ) The connection point references used as destinations/sources of transitions associated with a submachine state must be defined as entry/exit points in the submachine state machine. OCL self.isSubmachineState implies (self.connection->forAll (cp | cp.entry->forAll (p | p.statemachine = self.submachine) and cp.exit->forAll (p | p.statemachine = self.submachine))) A state is not allowed to have both a submachine and regions. OCL isComposite implies not isSubmachineState Only composite states can have entry or exit pseudostates defined. OCL connectionPoint->notEmpty() implies isComoposite Only entry or exit pseudostates can serve as connection points. OCL connectionPoint->forAll(cp|cp.kind = #entry or cp.kind = #exit) A state with isComposite=true is said to be a composite state. A composite state is a state that contains at least one region. A state with isOrthogonal=true is said to be an orthogonal composite state. An orthogonal composite state contains two or more regions. A state with isSimple=true is said to be a simple state. A simple state does not have any regions and it does not refer to any submachine state machine. A state with isSubmachineState=true is said to be a submachine state. Such a state refers to a state machine (submachine). The state machine that is to be inserted in place of the (submachine) state. The entry and exit connection points used in conjunction with this (submachine) state, i.e. as targets and sources, respectively, in the region with the submachine state. A connection point reference references the corresponding definition of a connection point pseudostate in the statemachine referenced by the submachinestate. The state of which this state is a redefinition. The regions owned directly by the state. References the classifier in which context this element may be redefined. Specifies conditions that are always true when this state is the current state. In protocol state machines, state invariants are additional conditions to the preconditions of the outgoing transitions, and to the postcondition of the incoming transitions. An optional behavior that is executed whenever this state is entered regardless of the transition taken to reach the state. If defined, entry actions are always executed to completion prior to any internal behavior or transitions performed within the state. An optional behavior that is executed whenever this state is exited regardless of which transition was taken out of the state. If defined, exit actions are always executed to completion only after all internal activities and transition actions have completed execution. An optional behavior that is executed while being in the state. The execution starts when this state is entered, and stops either by itself, or when the state is exited, whichever comes first. The entry and exit pseudostates of a composite state. These can only be entry or exit Pseudostates, and they must have different names. They can only be defined for composite states. A list of triggers that are candidates to be retained by the state machine if they trigger no transitions out of the state (not consumed). A deferred trigger is retained until the state machine reaches a state configuration where it is no longer deferred. A simple state is a state without any regions. OCL result = region.isEmpty() A composite state is a state with at least one region. OCL result = region.notEmpty() An orthogonal state is a composite state with at least 2 regions OCL result = (region->size () > 1) Only submachine states can have a reference statemachine. OCL result = submachine.notEmpty() The redefinition context of a state is the nearest containing statemachine. OCL result = let sm = containingStateMachine() in if sm.context->isEmpty() or sm.general->notEmpty() then sm else sm.context endif The query isRedefinitionContextValid() specifies whether the redefinition contexts of a state are properly related to the redefinition contexts of the specified state to allow this element to redefine the other. The containing region of a redefining state must redefine the containing region of the redefined state. OCL result = true The query isConsistentWith() specifies that a redefining state is consistent with a redefined state provided that the redefining state is an extension of the redefined state: A simple state can be redefined (extended) to become a composite state (by adding a region) and a composite state can be redefined (extended) by adding regions and by adding vertices, states, and transitions to inherited regions. All states may add or replace entry, exit, and 'doActivity' actions. OCL result = true The query containingStateMachine() returns the state machine that contains the state either directly or transitively. OCL result = container.containingStateMachine() A transition is a directed relationship between a source vertex and a target 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 an occurrence of an event of a particular type. A transition with kind external can source any vertex except entry points. OCL (kind = TransitionKind::external) implies not (source.oclIsKindOf(Pseudostate) and source.oclAsType(Pseudostate).kind = PseudostateKind::entryPoint) A transition with kind local must have a composite state or an entry point as its source. OCL (kind = TransitionKind::local) implies ((source.oclIsKindOf (State) and source.oclAsType(State).isComposite) or (source.oclIsKindOf (Pseudostate) and source.oclAsType(Pseudostate).kind = PseudostateKind::entryPoint)) A fork segment must not have guards or triggers. OCL (source.oclIsKindOf(Pseudostate) and source.kind = #fork) implies (guard->isEmpty() and trigger->isEmpty()) A join segment must not have guards or triggers. OCL (target.oclIsKindOf(Pseudostate) and target.kind = #join) implies (guard->isEmpty() and trigger->isEmpty()) A fork segment must always target a state. OCL (source.oclIsKindOf(Pseudostate) and source.kind = #fork) implies (target.oclIsKindOf(State)) A join segment must always originate from a state. OCL (target.oclIsKindOf(Pseudostate) and target.kind = #join) implies (source.oclIsKindOf(State)) Transitions outgoing pseudostates may not have a trigger. OCL source.oclIsKindOf(Pseudostate) and (source.kind <> #initial)) implies trigger->isEmpty() An initial transition at the topmost level (region of a statemachine) either has no trigger or it has a trigger with the stereotype <<create>>. OCL self.source.oclIsKindOf(Pseudostate) implies (self.source.oclAsType(Pseudostate).kind = #initial) implies (self.source.container = self.stateMachine.top) implies ((self.trigger->isEmpty) or (self.trigger.stereotype.name = 'create')) In case of more than one trigger, the signatures of these must be compatible in case the parameters of the signal are assigned to local variables/attributes. OCL true A transition with kind internal must have a state as its source, and its source and target must be equal. OCL (kind = TransitionKind::internal) implies (source.oclIsKindOf (State) and source = target) Indicates the precise type of the transition. Designates the region that owns this transition. Designates the originating vertex (state or pseudostate) of the transition. Designates the target vertex that is reached when the transition is taken. The transition that is redefined by this transition. A guard is a constraint that provides a fine-grained control over the firing of the transition. The guard is evaluated when an event occurrence is dispatched by the state machine. If the guard is true at that time, the transition may be enabled, otherwise, it is disabled. Guards should be pure expressions without side effects. Guard expressions with side effects are ill formed. References the classifier in which context this element may be redefined. Specifies an optional behavior to be performed when the transition fires. Specifies the triggers that may fire the transition. The redefinition context of a transition is the nearest containing statemachine. OCL result = let sm = containingStateMachine() in if sm.context->isEmpty() or sm.general->notEmpty() then sm else sm.context endif The query isConsistentWith() specifies that a redefining transition is consistent with a redefined transition provided that the redefining transition has the following relation to the redefined transition: A redefining transition redefines all properties of the corresponding redefined transition, except the source state and the trigger. OCL result = (redefinee.oclIsKindOf(Transition) and let trans: Transition = redefinee.oclAsType(Transition) in (source() = trans.source() and trigger() = tran.trigger()) OCL redefinee.isRedefinitionContextValid(self) The query containingStateMachine() returns the state machine that contains the transition either directly or transitively. OCL result = container.containingStateMachine() A vertex is an abstraction of a node in a state machine graph. In general, it can be the source or destination of any number of transitions. The region that contains this vertex. Specifies the transitions departing from this vertex. Specifies the transitions entering this vertex. The operation containingStateMachine() returns the state machine in which this Vertex is defined OCL result = if not container->isEmpty() then -- the container is a region container.containingStateMachine() else if (oclIsKindOf(Pseudostate)) then -- entry or exit point? if (kind = #entryPoint) or (kind = #exitPoint) then stateMachine else if (oclIsKindOf(ConnectionPointReference)) then state.containingStateMachine() -- no other valid cases possible endif OCL result = Transition.allInstances()->select(t | t.source=self) OCL result = Transition.allInstances()->select(t | t.target=self) A pseudostate is an abstraction that encompasses different types of transient vertices in the state machine graph. An initial vertex can have at most one outgoing transition. OCL (self.kind = #initial) implies (self.outgoing->size <= 1) History vertices can have at most one outgoing transition. OCL ((self.kind = #deepHistory) or (self.kind = #shallowHistory)) implies (self.outgoing->size <= 1) In a complete statemachine, a join vertex must have at least two incoming transitions and exactly one outgoing transition. OCL (self.kind = #join) implies ((self.outgoing->size = 1) and (self.incoming->size >= 2)) All transitions incoming a join vertex must originate in different regions of an orthogonal state. OCL (self.kind = #join) implies self.incoming->forAll (t1, t2 | t1<>t2 implies (self.stateMachine.LCA(t1.source, t2.source).container.isOrthogonal)) In a complete statemachine, a fork vertex must have at least two outgoing transitions and exactly one incoming transition. OCL (self.kind = #fork) implies ((self.incoming->size = 1) and (self.outgoing->size >= 2)) All transitions outgoing a fork vertex must target states in different regions of an orthogonal state. OCL (self.kind = #fork) implies self.outgoing->forAll (t1, t2 | t1<>t2 implies (self.stateMachine.LCA(t1.target, t2.target).container.isOrthogonal)) In a complete statemachine, a junction vertex must have at least one incoming and one outgoing transition. OCL (self.kind = #junction) implies ((self.incoming->size >= 1) and (self.outgoing->size >= 1)) In a complete statemachine, a choice vertex must have at least one incoming and one outgoing transition. OCL (self.kind = #choice) implies ((self.incoming->size >= 1) and (self.outgoing->size >= 1)) The outgoing transition from and initial vertex may have a behavior, but not a trigger or a guard. OCL (self.kind = #initial) implies (self.outgoing.guard->isEmpty() and self.outgoing.trigger->isEmpty()) Determines the precise type of the Pseudostate and can be one of: entryPoint, exitPoint, initial, deepHistory, shallowHistory, join, fork, junction, terminate or choice. The StateMachine in which this Pseudostate is defined. This only applies to Pseudostates of the kind entryPoint or exitPoint. The State that owns this pseudostate and in which it appears. A special kind of state signifying that the enclosing region is completed. If the enclosing region is directly contained in a state machine and all other regions in the state machine also are completed, then it means that the entire state machine is completed. A final state cannot have any outgoing transitions. OCL self.outgoing->size() = 0 A final state cannot have regions. OCL self.region->size() = 0 A final state cannot reference a submachine. OCL self.submachine->isEmpty() A final state has no entry behavior. OCL self.entry->isEmpty() A final state has no exit behavior. OCL self.exit->isEmpty() A final state has no state (doActivity) behavior. OCL self.doActivity->isEmpty() 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. The entry Pseudostates must be Pseudostates with kind entryPoint. OCL entry->notEmpty() implies entry->forAll(e | e.kind = #entryPoint) The exit Pseudostates must be Pseudostates with kind exitPoint. OCL exit->notEmpty() implies exit->forAll(e | e.kind = #exitPoint) The entryPoint kind pseudo states corresponding to this connection point. The State in which the connection point refreshens are defined. The exitPoints kind pseudo states corresponding to this connection point. A region is an orthogonal part of either a composite state or a state machine. It contains states and transitions. A region can have at most one initial vertex OCL self.subvertex->select (v | v.oclIsKindOf(Pseudostate))-> select(p : Pseudostate | p.kind = #initial)->size() <= 1 A region can have at most one deep history vertex OCL self.subvertex->select (v | v.oclIsKindOf(Pseudostate))-> select(p : Pseudostate | p.kind = #deepHistory)->size() <= 1 A region can have at most one shallow history vertex OCL self.subvertex->select(v | v.oclIsKindOf(Pseudostate))-> select(p : Pseudostate | p.kind = #shallowHistory)->size() <= 1 If a Region is owned by a StateMachine, then it cannot also be owned by a State and vice versa. OCL (stateMachine->notEmpty() implies state->isEmpty()) and (state->notEmpty() implies stateMachine->isEmpty()) The set of vertices that are owned by this region. The set of transitions owned by the region. The StateMachine that owns the Region. If a Region is owned by a StateMachine, then it cannot also be owned by a State. The State that owns the Region. If a Region is owned by a State, then it cannot also be owned by a StateMachine. The region of which this region is an extension. References the classifier in which context this element may be redefined. The redefinition context of a region is the nearest containing statemachine OCL result = let sm = containingStateMachine() in if sm.context->isEmpty() or sm.general->notEmpty() then sm else sm.context endif The query isRedefinitionContextValid() specifies whether the redefinition contexts of a region are properly related to the redefinition contexts of the specified region to allow this element to redefine the other. The containing statemachine/state of a redefining region must redefine the containing statemachine/state of the redefined region. OCL result = true The query isConsistentWith() specifies that a redefining region is consistent with a redefined region provided that the redefining region is an extension of the redefined region, i.e. it adds vertices and transitions and it redefines states and transitions of the redefined region. OCL result = true The operation containingStateMachine() returns the sate machine in which this Region is defined OCL result = if stateMachine->isEmpty() then state.containingStateMachine() else stateMachine endif A time event can be defined relative to entering the current state of the executing state machine. The starting time for a relative time event may only be omitted for a time event that is the trigger of a state machine. OCL true PseudostateKind is an enumeration type. An initial pseudostate represents a default vertex that is the source for a single transition to the default state of a composite state. There can be at most one initial vertex in a region. The outgoing transition from the initial vertex may have a behavior, but not a trigger or guard. DeepHistory represents the most recent active configuration of the composite state that directly contains this pseudostate; e.g. the state configuration that was active when the composite state was last exited. A composite state can have at most one deep history vertex. At most one transition may originate from the history connector to the default deep history state. This transition is taken in case the composite state had never been active before. Entry actions of states entered on the path to the state represented by a deep history are performed. ShallowHistory represents the most recent active substate of its containing state (but not the substates of that substate). A composite state can have at most one shallow history vertex. A transition coming into the shallow history vertex is equivalent to a transition coming into the most recent active substate of a state. At most one transition may originate from the history connector to the default shallow history state. This transition is taken in case the composite state had never been active before. Entry actions of states entered on the path to the state represented by a shallow history are performed. Join vertices serve to merge several transitions emanating from source vertices in different orthogonal regions. The transitions entering a join vertex cannot have guards or triggers. Fork vertices serve to split an incoming transition into two or more transitions terminating on orthogonal target vertices (i.e. vertices in different regions of a composite state). The segments outgoing from a fork vertex must not have guards or triggers. Junction vertices are semantic-free vertices that are used to chain together multiple transitions. They are used to construct compound transition paths between states. For example, a junction can be used to converge multiple incoming transitions into a single outgoing transition representing a shared transition path (this is known as an merge). Conversely, they can be used to split an incoming transition into multiple outgoing transition segments with different guard conditions. This realizes a static conditional branch. (In the latter case, outgoing transitions whose guard conditions evaluate to false are disabled. A predefined guard denoted 'else' may be defined for at most one outgoing transition. This transition is enabled if all the guards labeling the other transitions are false.) Static conditional branches are distinct from dynamic conditional branches that are realized by choice vertices (described below). Choice vertices which, when reached, result in the dynamic evaluation of the guards of the triggers of its outgoing transitions. This realizes a dynamic conditional branch. It allows splitting of transitions into multiple outgoing paths such that the decision on which path to take may be a function of the results of prior actions performed in the same run-tocompletion step. If more than one of the guards evaluates to true, an arbitrary one is selected. If none of the guards evaluates to true, then the model is considered ill-formed. (To avoid this, it is recommended to define one outgoing transition with the predefined else guard for every choice vertex.) Choice vertices should be distinguished from static branch points that are based on junction points (described above). An entry point pseudostate is an entry point of a state machine or composite state. In each region of the state machine or composite state it has a single transition to a vertex within the same region. An exit point pseudostate is an exit point of a state machine or composite state. Entering an exit point within any region of the composite state or state machine referenced by a submachine state implies the exit of this composite state or submachine state and the triggering of the transition that has this exit point as source in the state machine enclosing the submachine or composite state. Entering a terminate pseudostate implies that the execution of this state machine by means of its context object is terminated. The state machine does not exit any states nor does it perform any exit actions other than those associated with the transition leading to the terminate pseudostate. Entering a terminate pseudostate is equivalent to invoking a DestroyObjectAction. TransitionKind is an enumeration type. Implies that the transition, if triggered, occurs without exiting or entering the source state. Thus, it does not cause a state change. This means that the entry or exit condition of the source state will not be invoked. An internal transition can be taken even if the state machine is in one or more regions nested within this state. Implies that the transition, if triggered, will not exit the composite (source) state, but it will apply to any state within the composite state, and these will be exited and entered. Implies that the transition, if triggered, will exit the composite (source) state. Protocol state machines can be redefined into more specific protocol state machines, or into behavioral state machines. Protocol conformance declares that the specific protocol state machine specifies a protocol that conforms to the general state machine one, or that the specific behavioral state machine abide by the protocol of the general protocol state machine. Specifies the state machine which conforms to the general state machine. Specifies the protocol state machine to which the specific state machine conforms. Since an interface specifies conformance characteristics, it does not own detailed behavior specifications. Instead, interfaces may own a protocol state machine that specifies event sequences and pre/post conditions for the operations and receptions described by the interface. References a protocol state machine specifying the legal sequences of the invocation of the behavioral features described in the interface. A port has an associated protocol state machine. References an optional protocol state machine which describes valid interactions at this interaction point. A protocol transition specifies a legal transition for an operation. Transitions of protocol state machines have the following information: a pre condition (guard), on trigger, and a post condition. Every protocol transition is associated to zero or one operation (referred BehavioralFeature) that belongs to the context classifier of the protocol state machine. A protocol transition always belongs to a protocol state machine. OCL container.belongsToPSM() A protocol transition never has associated actions. OCL effect->isEmpty() If a protocol transition refers to an operation (i. e. has a call trigger corresponding to an operation), then that operation should apply to the context classifier of the state machine of the protocol transition. OCL true Specifies the post condition of the transition which is the condition that should be obtained once the transition is triggered. This post condition is part of the post condition of the operation connected to the transition. This association refers to the associated operation. It is derived from the operation of the call trigger when applicable. Specifies the precondition of the transition. It specifies the condition that should be verified before triggering the transition. This guard condition added to the source state will be evaluated as part of the precondition of the operation referred by the transition if any. A protocol state machine is always defined in the context of a classifier. It specifies which operations of the classifier can be called in which state and under which condition, thus specifying the allowed call sequences on the classifier's operations. A protocol state machine presents the possible and permitted transitions on the instances of its context classifier, together with the operations which carry the transitions. In this manner, an instance lifecycle can be created for a classifier, by specifying the order in which the operations can be activated and the states through which an instance progresses during its existence. A protocol state machine must only have a classifier context, not a behavioral feature context. OCL (not context->isEmpty( )) and specification->isEmpty() All transitions of a protocol state machine must be protocol transitions. (transitions as extended by the ProtocolStateMachines package) OCL region->forAll(r | r.transition->forAll(t | t.oclIsTypeOf(ProtocolTransition))) The states of a protocol state machine cannot have entry, exit, or do activity actions. OCL region->forAll(r | r.subvertex->forAll(v | v.oclIsKindOf(State) implies (v.entry->isEmpty() and v.exit->isEmpty() and v.doActivity->isEmpty()))) Protocol state machines cannot have deep or shallow history pseudostates. OCL region->forAll (r | r.subvertex->forAll (v | v.oclIsKindOf(Psuedostate) implies ((v.kind <> #deepHistory) and (v.kind <> #shallowHistory))))) If two ports are connected, then the protocol state machine of the required interface (if defined) must be conformant to the protocol state machine of the provided interface (if defined). OCL true Conformance between protocol state machines. The states of protocol state machines are exposed to the users of their context classifiers. A protocol state represents an exposed stable situation of its context classifier: when an instance of the classifier is not processing any operation, users of this instance can always know its state configuration. The operation belongsToPSM () checks if the region belongs to a protocol state machine OCL result = if not stateMachine->isEmpty() then oclIsTypeOf(ProtocolStateMachine) else if not state->isEmpty() then state.container.belongsToPSM () else false Specifies the namespace in which the protocol state machine is defined. An actor specifies a role played by a user or any other system that interacts with the subject. An actor can only have associations to use cases, components and classes. Furthermore these associations must be binary. OCL self.ownedAttribute->forAll ( a | (a.association->notEmpty()) implies ((a.association.memberEnd.size() = 2) and (a.opposite.class.oclIsKindOf(UseCase) or (a.opposite.class.oclIsKindOf(Class) and not a.opposite.class.oclIsKindOf(Behavior)))) An actor must have a name. OCL name->notEmpty() A relationship from an extending use case to an extended use case that specifies how and when the behavior defined in the extending use case can be inserted into the behavior defined in the extended use case. The extension points referenced by the extend relationship must belong to the use case that is being extended. OCL extensionLocation->forAll (xp | extendedCase.extensionPoint->includes(xp)) References the use case that is being extended. References the use case that represents the extension and owns the extend relationship. References the condition that must hold when the first extension point is reached for the extension to take place. If no constraint is associated with the extend relationship, the extension is unconditional. An ordered list of extension points belonging to the extended use case, specifying where the respective behavioral fragments of the extending use case are to be inserted. The first fragment in the extending use case is associated with the first extension point in the list, the second fragment with the second point, and so on. (Note that, in most practical cases, the extending use case has just a single behavior fragment, so that the list of extension points is trivial.) An include relationship defines that a use case contains the behavior defined in another use case. References the use case which will include the addition and owns the include relationship. References the use case that is to be included. A use case is the specification of a set of actions performed by a system, which yields an observable result that is, typically, of value for one or more actors or other stakeholders of the system. A UseCase must have a name. OCL self.name -> notEmpty () UseCases can only be involved in binary Associations. OCL true UseCases can not have Associations to UseCases specifying the same subject. OCL true A use case cannot include use cases that directly or indirectly include it. OCL not self.allIncludedUseCases()->includes(self) References the Include relationships owned by this use case. References the Extend relationships owned by this use case. References the ExtensionPoints owned by the use case. References the subjects to which this use case applies. The subject or its parts realize all the use cases that apply to this subject. Use cases need not be attached to any specific subject, however. The subject may, but need not, own the use cases that apply to it. The query allIncludedUseCases() returns the transitive closure of all use cases (directly or indirectly) included by this use case. OCL result = self.include->union(self.include->collect(in | in.allIncludedUseCases())) An extension point identifies a point in the behavior of a use case where that behavior can be extended by the behavior of some other (extending) use case, as specified by an extend relationship. An ExtensionPoint must have a name. OCL self.name->notEmpty () References the use case that owns this extension point. A classifier has the capability to own use cases. Although the owning classifier typically represents the subject to which the owned use cases apply, this is not necessarily the case. In principle, the same use case can be applied to multiple subjects, as identified by the subject association role of a use case. References the use cases owned by this classifier. The set of use cases for which this Classifier is the subject.