OSLC Kernel Modeling Language (KerML) Constraints
Constraints on vocabulary terms defined in the OSLC Kernel Modeling Language (KerML) namespace.
OSLC Kernel Modeling Language (SysML) Version 2.0 Constraints
The Elements that are annotated by this AnnotatingElement. If annotation is not empty, these are the annotatedElements of the annotations. If annotation is empty, then it is the owningNamespace of the AnnotatingElement.
An AnnotatingElement is an Element that provides additional description of or metadata on some other Element. An AnnotatingElement is either attached to its annotatedElements by Annotation Relationships, or it implicitly annotates its owningNamespace.
The relatedElements from which this Relationship is considered to be directed..
The relatedElements to which this Relationship is considered to be directed.
The Element that is annotated by the annotatingElement of this Annotation.
An Annotation is a Relationship between an AnnotatingElement and the Element that is annotated by that AnnotatingElement.
The interpretations of a Type with differencingTypes are asserted to be those of the first of those Types, but not including those of the remaining Types. For example, a Classifier might be the difference of a Classifier for people and another for people of a particular nationality, leaving people who are not of that nationality. Similarly, a feature of people might be the difference between a feature for their children and a Classifier for people of a particular sex, identifying their children not of that sex (because the interpretations of the children Feature that identify those of that sex are also interpretations of the Classifier for that sex).
The interpretations of a Type with unioningTypes are asserted to be the same as those of all the unioningTypes together, which are the Types derived from the unioningType of the ownedUnionings of this Type. For example, a Classifier for people might be the union of Classifiers for all the sexes. Similarly, a feature for people's children might be the union of features dividing them in the same ways as people in general.
The interpretations of a Type with intersectingTypes are asserted to be those in common among the intersectingTypes, which are the Types derived from the intersectingType of the ownedIntersectings of this Type. For example, a Classifier might be an intersection of Classifiers for people of a particular sex and of a particular nationality. Similarly, a feature for people's children of a particular sex might be the intersection of a Feature for their children and a Classifier for people of that sex (because the interpretations of the children Feature that identify those of that sex are also interpretations of the Classifier for that sex).
The Memberships in this Namespace that result from the ownedImports of this Namespace.
An Association is a Relationship and a Classifier to enable classification of links between things (in the universe). The co-domains (types) of the associationEnd Features are the relatedTypes, as co-domain and participants (linked things) of an Association identify each other.
An AssociationStructure is an Association that is also a Structure, classifying link objects that are both links and objects. As objects, link objects can be created and destroyed, and their non-end Features can change over time. However, the values of the end Features of a link object are fixed and cannot change over its lifetime.
The parameters of this Behavior, which are defined as its directedFeatures, whose values are passed into and/or out of a performance of the Behavior.
A Behavior coordinates occurrences of other Behaviors, as well as changes in objects. Behaviors can be decomposed into Steps and be characterized by parameters.
Types that feature this Feature, such that any instance in the domain of the Feature must be classified by all of these Types, including at least all the featuringTypes of its typeFeaturings. If the Feature is chained, then the featuringTypes of the first Feature in the chain are also featuringTypes of the chained Feature.
The Type that is the owningType of the owningFeatureMembership of this Feature.
The Feature that are chained together to determine the values of this Feature, derived from the chainingFeatures of the ownedFeatureChainings of this Feature, in the same order. The values of a Feature with chainingFeatures are the same as values of the last Feature in the chain, which can be found by starting with the values of the first Feature (for each instance of the domain of the original Feature), then using each of those as domain instances to find the values of the second Feature in chainingFeatures, and so on, to values of the last Feature.
The target relatedFeatures for this Connector. This includes all the relatedFeatures other than the sourceFeature.
Types that restrict the values of this Feature, such that the values must be instances of all the types. The types of a Feature are derived from its typings and the types of its subsettings. If the Feature is chained, then the types of the last Feature in the chain are also types of the chained Feature.
A BindingConnector is a binary Connector that requires its relatedFeatures to identify the same things (have the same values).
Whether this Expression meets the constraints necessary to be evaluated at model level, that is, using metadata within the model.
The parameters of this Step, which are defined as its directedFeatures, whose values are passed into and/or out of a performance of the Step.
A BooleanExpression is a Boolean-valued Expression whose type is a Predicate. It represents a logical condition resulting from the evaluation of the Predicate.
A Class is a Classifier of things (in the universe) that can be distinguished without regard to how they are related to other things (via Features). This means multiple things classified by the same Class can be distinguished, even when they are related other things in exactly the same way.
A Classifier is a Type that classifies:.
A CollectExpression is an OperatorExpression whose operator is "collect", which resolves to the Function ControlFunctions::collect from the Kernel Functions Library.
The annotation text for the Comment.
A Comment is an AnnotatingElement whose body in some way describes its annotatedElements.
The conjugatedType of this Conjugation that is also its owningRelatedElement.
Conjugation is a Relationship between two types in which the conjugatedType inherits all the Features of the originalType, but with all input and output Features reversed. That is, any Features with a direction in relative to the originalType are considered to have an effective direction of out relative to the conjugatedType and, similarly, Features with direction out in the originalType are considered to have an effective direction of in in the conjugatedType. Features with direction inout, or with no direction, in the originalType, are inherited without change.
A Connector is a usage of Associations, with links restricted according to instances of the Type in which they are used (domain of the Connector). The associations of the Connector restrict what kinds of things might be linked. The Connector further restricts these links to be between values of Features on instances of its domain.
A ConstructorExpression is an InstantiationExpression whose result specializes its instantiatedType, binding some or all of the features of the instantiatedType to the results of its argument Expressions.
A subsettingFeature that is also the owningRelatedElement of this Subsetting.
The Type that is the specific Type of this Specialization and owns it as its owningRelatedElement.
CrossSubsetting is a kind of Subsetting for end Features, as identified by crossingFeature, to subset a chained Feature, identified by crossedFeature. It navigates to instances of the end Feature’s type from instances of other end Feature types on the same owningType (at least two end Features are required for any of them to have a CrossSubsetting).
A DataType is a Classifier of things (in the universe) that can only be distinguished by how they are related to other things (via Features). This means multiple things classified by the same DataType.
A Dependency is a Relationship that indicates that one or more client Elements require one more supplier Elements for their complete specification. In general, this means that a change to one of the supplier Elements may necessitate a change to, or re-specification of, the client Elements.
Type that partly determines interpretations of typeDifferenced, as described in Type::differencingType.
Differencing is a Relationship that makes its differencingType one of the differencingTypes of its typeDifferenced.
A typeDisjoined that is also an owningRelatedElement.
A Disjoining is a Relationship between Types asserted to have interpretations that are not shared (disjoint) between them, identified as typeDisjoined and disjoiningType. For example, a Classifier for mammals is disjoint from a Classifier for minerals, and a Feature for people's parents is disjoint from a Feature for their children.
Documentation is a Comment that specifically documents a documentedElement, which must be its owner.
Whether or not the Membership of the memberElement in the membershipOwningNamespace is publicly visible outside that Namespace.
ElementFilterMembership is a Membership between a Namespace and a model-level evaluable Boolean-valued Expression, asserting that imported members of the Namespace should be filtered using the condition Expression. A general Namespace does not define any specific filtering behavior, but such behavior may be defined for various specialized kinds of Namespaces.
An Element is a constituent of a model that is uniquely identified relative to all other Elements. It can have Relationships with other Elements. Some of these Relationships might imply ownership of other Elements, which means that if an Element is deleted from a model, then so are all the Elements that it owns.
The Type that owns this FeatureMembership.
EndFeatureMembership is a FeatureMembership that requires its memberFeature be owned and have isEnd = true.
An Expression is a Step that is typed by a Function. An Expression that also has a Function as its featuringType is a computational step within that Function. An Expression always has a single result parameter, which redefines the result parameter of its defining function. This allows Expressions to be interconnected in tree structures, in which inputs to each Expression in the tree are determined as the results of other Expression in the tree.
The Feature that is accessed by this FeatureChainExpression, which is its first non-parameter member. .
A FeatureChainExpression is an OperatorExpression whose operator is ".", which resolves to the Function ControlFunctions::'.' from the Kernel Functions Library. It evaluates to the result of chaining the result Feature of its single argument Expression with its targetFeature.
The Feature whose values partly determine values of featureChained, as described in Feature::chainingFeature.
FeatureChaining is a Relationship that makes its target Feature one of the chainingFeatures of its owning Feature.
A featureInverted that is also the owningRelatedElement of this FeatureInverting.
A FeatureInverting is a Relationship between Features asserting that their interpretations (sequences) are the reverse of each other, identified as featureInverted and invertingFeature. For example, a Feature identifying each person's parents is the inverse of a Feature identifying each person's children. A person identified as a parent of another will identify that other as one of their children.
A FeatureMembership is an OwningMembership between an ownedMemberFeature and an owningType. If the ownedMemberFeature has isVariable = false, then the FeatureMembership implies that the owningType is also a featuringType of the ownedMemberFeature. If the ownedMemberFeature has isVariable = true, then the FeatureMembership implies that the ownedMemberFeature is featured by the snapshots of the owningType, which must specialize the Kernel Semantic Library base class Occurrence.
The Feature that is referenced by this FeatureReferenceExpression, which is its first non-parameter member.
A FeatureReferenceExpression is an Expression whose result is bound to a referent Feature.
A Feature is a Type that classifies relations between multiple things (in the universe). The domain of the relation is the intersection of the featuringTypes of the Feature. (The domain of a Feature with no featuringTyps is implicitly the most general Type Base::Anything from the Kernel Semantic Library.) The co-domain of the relation is the intersection of the types of the Feature. .
A typedFeature that is also the owningRelatedElement of this FeatureTyping.
The Type that is being applied by this FeatureTyping.
FeatureTyping is Specialization in which the specific Type is a Feature. This means the set of instances of the (specific) typedFeature is a subset of the set of instances of the (general) type. In the simplest case, the type is a Classifier, whereupon the typedFeature has values that are instances of the Classifier.
The Expression that provides the value as a result.
A FeatureValue is a Membership that identifies a particular member Expression that provides the value of the Feature that owns the FeatureValue. The value is specified as either a bound value or an initial value, and as either a concrete or default value. A Feature can have at most one FeatureValue.
A FlowEnd is a Feature that is one of the connectorEnds giving the source or target of a Flow. For Flows typed by FlowTransfer or its specializations, FlowEnds must have exactly one ownedFeature, which redefines Transfer::source::sourceOutput or Transfer::target::targetInput and redefines the corresponding feature of the relatedElement for its end.
The connectorEnds of this Flow that are FlowEnds.
An Flow is a Step that represents the transfer of values from one Feature to another. Flows can take non-zero time to complete.
Whether this Function can be used as the function of a model-level evaluable InvocationExpression. Certain Functions from the Kernel Functions Library are considered to have isModelLevelEvaluable = true. For all other Functions it is false.
The object or value that is the result of evaluating the Function.
A Function is a Behavior that has an out parameter that is identified as its result. A Function represents the performance of a calculation that produces the values of its result parameter. This calculation may be decomposed into Expressions that are steps of the Function.
The visibility level of the imported members from this Import relative to the importOwningNamespace. The default is private.
An Import is an Relationship between its importOwningNamespace and either a Membership (for a MembershipImport) or another Namespace (for a NamespaceImport), which determines a set of Memberships that become importedMemberships of the importOwningNamespace. If isImportAll = false (the default), then only public Memberships are considered "visible". If isImportAll = true, then all Memberships are considered "visible", regardless of their declared visibility. If isRecursive = true, then visible Memberships are also recursively imported from owned sub-Namespaces.
An IndexExpression is an OperatorExpression whose operator is "#", which resolves to the Function BasicFunctions::'#' from the Kernel Functions Library.
An InstantiationExpression is an Expression that instantiates its instantiatedType, binding some or all of the features of that Type to the results of its arguments.
An Interaction is a Behavior that is also an Association, providing a context for multiple objects that have behaviors that impact one another.
Type that partly determines interpretations of typeIntersected, as described in Type::intersectingType.
Intersecting is a Relationship that makes its intersectingType one of the intersectingTypes of its typeIntersected.
An Invariant is a BooleanExpression that is asserted to have a specific Boolean result value. If isNegated = false, then the result is asserted to be true. If isNegated = true, then the result is asserted to be false.
An InvocationExpression is an InstantiationExpression whose instantiatedType must be a Behavior or a Feature typed by a single Behavior (such as a Step). Each of the input parameters of the instantiatedType are bound to the result of an argument Expression. If the instantiatedType is a Function or a Feature typed by a Function, then the result of the InvocationExpression is the result of the invoked Function. Otherwise, the result is an instance of the instantiatedType (essentially like a behavioral ConstructorExpression).
A LibraryPackage is a Package that is the container for a model library. A LibraryPackage is itself a library Element as are all Elements that are directly or indirectly contained in it.
The Boolean value that is the result of evaluating this LiteralBoolean.
LiteralBoolean is a LiteralExpression that provides a Boolean value as a result. Its result parameter must have type Boolean.
A LiteralExpression is an Expression that provides a basic DataValue as a result.
A LiteralInfinity is a LiteralExpression that provides the positive infinity value (*). It's result must have the type Positive.
The Integer value that is the result of evaluating this LiteralInteger.
A LiteralInteger is a LiteralExpression that provides an Integer value as a result. Its result parameter must have the type Integer.
The value whose rational approximation is the result of evaluating this LiteralRational.
A LiteralRational is a LiteralExpression that provides a Rational value as a result. Its result parameter must have the type Rational.
The String value that is the result of evaluating this Expression.
A LiteralString is a LiteralExpression that provides a String value as a result. Its result parameter must have the type String.
The Membership to be imported.
A MembershipImport is an Import that imports its importedMembership into the importOwningNamespace. If isRecursive = true and the memberElement of the importedMembership is a Namespace, then the equivalent of a recursive NamespaceImport is also performed on that Namespace.
A Membership is a Relationship between a Namespace and an Element that indicates the Element is a member of (i.e., is contained in) the Namespace. Any memberNames specify how the memberElement is identified in the Namespace and the visibility specifies whether or not the memberElement is publicly visible from outside the Namespace.
A Metaclass is a Structure used to type MetadataFeatures.
A MetadataAccessExpression is an Expression whose result is a sequence of instances of Metaclasses representing all the MetadataFeature annotations of the referencedElement. In addition, the sequence includes an instance of the reflective Metaclass corresponding to the MOF class of the referencedElement, with values for all the abstract syntax properties of the referencedElement.
A MetadataFeature is a Feature that is an AnnotatingElement used to annotate another Element with metadata. It is typed by a Metaclass. All its ownedFeatures must redefine features of its metaclass and any feature bindings must be model-level evaluable.
A MultiplicityRange is a Multiplicity whose value is defined to be the (inclusive) range of natural numbers given by the result of a lowerBound Expression and the result of an upperBound Expression. The result of these Expressions shall be of type Natural. If the result of the upperBound Expression is the unbounded value *, then the specified range includes all natural numbers greater than or equal to the lowerBound value. If no lowerBound Expression, then the default is that the lower bound has the same value as the upper bound, except if the upperBound evaluates to *, in which case the default for the lower bound is 0.
A Multiplicity is a Feature whose co-domain is a set of natural numbers giving the allowed cardinalities of each typeWithMultiplicity. The cardinality of a Type is defined as follows, depending on whether the Type is a Classifier or Feature. .
A NamespaceImport is an Import that imports Memberships from its importedNamespace into the importOwningNamespace. If isRecursive = false, then only the visible Memberships of the importedNamespace are imported. If isRecursive = true, then, in addition, Memberships are recursively imported from any ownedMembers of the importedNamespace that are Namespaces.
A Namespace is an Element that contains other Elements, known as its members, via Membership Relationships with those Elements. The members of a Namespace may be owned by the Namespace, aliased in the Namespace, or imported into the Namespace via Import Relationships.
A NullExpression is an Expression that results in a null value.
An OperatorExpression is an InvocationExpression whose function is determined by resolving its operator in the context of one of the standard packages from the Kernel Function Library.
An OwningMembership is a Membership that owns its memberElement as a ownedRelatedElement. The ownedMemberElement becomes an ownedMember of the membershipOwningNamespace.
A Package is a Namespace used to group Elements, without any instance-level semantics. It may have one or more model-level evaluable filterCondition Expressions used to filter its importedMemberships. Any imported member must meet all of the filterConditions.
A ParameterMembership is a FeatureMembership that identifies its memberFeature as a parameter, which is always owned, and must have a direction. A ParameterMembership must be owned by a Behavior, a Step, or the result parameter of a ConstructorExpression.
A PayloadFeature is the ownedFeature of a Flow that identifies the things carried by the kinds of transfers that are instances of the Flow.
A Predicate is a Function whose result parameter has type Boolean and multiplicity 1..1.
Redefinition is a kind of Subsetting that requires the redefinedFeature and the redefiningFeature to have the same values (on each instance of the domain of the redefiningFeature). This means any restrictions on the redefiningFeature, such as type or multiplicity, also apply to the redefinedFeature (on each instance of the domain of the redefiningFeature), and vice versa. The redefinedFeature might have values for instances of the domain of the redefiningFeature, but only as instances of the domain of the redefinedFeature that happen to also be instances of the domain of the redefiningFeature. This is supported by the constraints inherited from Subsetting on the domains of the redefiningFeature and redefinedFeature. However, these constraints are narrowed for Redefinition to require the owningTypes of the redefiningFeature and redefinedFeature to be different and the redefinedFeature to not be inherited into the owningNamespace of the redefiningFeature.This enables the redefiningFeature to have the same name as the redefinedFeature, if desired.
ReferenceSubsetting is a kind of Subsetting in which the referencedFeature is syntactically distinguished from other Features subsetted by the referencingFeature. ReferenceSubsetting has the same semantics as Subsetting, but the referencedFeature may have a special purpose relative to the referencingFeature. For instance, ReferenceSubsetting is used to identify the relatedFeatures of a Connector.
A Relationship is an Element that relates other Element. Some of its relatedElements may be owned, in which case those ownedRelatedElements will be deleted from a model if their owningRelationship is. A Relationship may also be owned by another Element, in which case the ownedRelatedElements of the Relationship are also considered to be transitively owned by the owningRelatedElement of the Relationship.
A ResultExpressionMembership is a FeatureMembership that indicates that the ownedResultExpression provides the result values for the Function or Expression that owns it. The owning Function or Expression must contain a BindingConnector between the result parameter of the ownedResultExpression and the result parameter of the owning Function or Expression.
A ReturnParameterMembership is a ParameterMembership that indicates that the ownedMemberParameter is the result parameter of a Function or Expression. The direction of the ownedMemberParameter must be out.
A SelectExpression is an OperatorExpression whose operator is "select", which resolves to the Function ControlFunctions::select from the Kernel Functions Library.
Specialization is a Relationship between two Types that requires all instances of the specific type to also be instances of the general Type (i.e., the set of instances of the specific Type is a subset of those of the general Type, which might be the same set).
A Step is a Feature that is typed by one or more Behaviors. Steps may be used by one Behavior to coordinate the performance of other Behaviors, supporting a steady refinement of behavioral descriptions. Steps can be ordered in time and can be connected using Flows to specify things flowing between their parameters.
A Structure is a Class of objects in the modeled universe that are primarily structural in nature. While such an object is not itself behavioral, it may be involved in and acted on by Behaviors, and it may be the performer of some of them.
Subclassification is Specialization in which both the specific and general Types are Classifier. This means all instances of the specific Classifier are also instances of the general Classifier.
Subsetting is Specialization in which the specific and general Types are Features. This means all values of the subsettingFeature (on instances of its domain, i.e., the intersection of its featuringTypes) are values of the subsettedFeature on instances of its domain. To support this the domain of the subsettingFeature must be the same or specialize (at least indirectly) the domain of the subsettedFeature (via Specialization), and the co-domain (intersection of the types) of the subsettingFeature must specialize the co-domain of the subsettedFeature.
A SuccessionFlow is a Flow that also provides temporal ordering. It classifies Transfers that cannot start until the source Occurrence has completed and that must complete before the target Occurrence can start.
A Succession is a binary Connector that requires its relatedFeatures to happen separately in time.
The textual representation of the representedElement in the given language.
A TextualRepresentation is an AnnotatingElement whose body represents the representedElement in a given language. The representedElement must be the owner of the TextualRepresentation. The named language can be a natural language, in which case the body is an informal representation, or an artificial language, in which case the body is expected to be a formal, machine-parsable representation.
The Type that features the featureOfType. It is the target of the TypeFeaturing.
A TypeFeaturing is a Featuring Relationship in which the featureOfType is the source and the featuringType is the target.
A Type is a Namespace that is the most general kind of Element supporting the semantics of classification. A Type may be a Classifier or a Feature, defining conditions on what is classified by the Type (see also the description of isSufficient).
Type that partly determines interpretations of typeUnioned, as described in Type::unioningType.
Unioning is a Relationship that makes its unioningType one of the unioningTypes of its typeUnioned.
The AnnotatingElement that annotates the annotatedElement of this Annotation. This is always either the ownedAnnotatingElement or the owningAnnotatingElement.
The owned Expressions of the MultiplicityRange whose results provide its bounds. These must be the first ownedMembers of the MultiplicityRange.
The Element or Elements dependent on the supplier Elements.
The model-level evaluable Boolean-valued Expression used to filter the imported members of the membershipOwningNamespace of this ElementFilterMembership.
The Type that is the result of applying Conjugation to the originalType.
The chained Feature that is cross subset by the crossingFeature of this CrossSubsetting.
The end Feature that owns this CrossSubsetting relationship and is also its subsettingFeature.
Type asserted to be disjoint with the typeDisjoined.
The Element that is documented by this Documentation.
The Feature whose values are partly determined by values of the chainingFeature, as described in Feature::chainingFeature.
The Feature that is an inverse of the invertingFeature.
The Feature that is featured by the featuringType. It is the source of the TypeFeaturing.
The Namespace whose visible Memberships are imported by this NamespaceImport.
The Feature that is an inverse of the invertedFeature.
Whether this FeatureValue is a concrete specification of the bound or initial value of the featureWithValue, or just a default value that may be overridden.
Whether this FeatureValue specifies a bound value or an initial value for the featureWithValue.
Whether this Invariant is asserted to be false rather than true.
Whether this LibraryPackage contains a standard library model. This should only be set to true for LibraryPackages in the standard Kernel Model Libraries or in normative model libraries for a language built on KerML.
The natural or artifical language in which the body text is written.
The Expression whose result provides the lower bound of the MultiplicityRange. If no lowerBound Expression is given, then the lower bound shall have the same value as the upper bound, unless the upper bound is unbounded (*), in which case the lower bound shall be 0.
The type of this MetadataFeature, which must be a Metaclass.
The annotatingElement of this Annotation, when it is an ownedRelatedElement.
The Expression that provides the result for the owner of the ResultExpressionMembership.
The annotatedElement of this Annotation, when it is also the owningRelatedElement.
The annotatingElement of this Annotation, when it is the owningRelatedElement.
The Classifier that owns this Subclassification relationship, which must also be its subclassifier.
A featureOfType that is also the owningRelatedElement of this TypeFeaturing.
The Feature that is redefined by the redefiningFeature of this Redefinition.
The Feature that is redefining the redefinedFeature of this Redefinition.
The Element whose metadata is being accessed.
The Feature that is referenced by the referencingFeature of this ReferenceSubsetting.
The Feature that owns this ReferenceSubsetting relationship, which is also its subsettingFeature.
The Element that is represented by this TextualRepresentation.
The more specific Classifier in this Subclassification.
The more general Classifier in this Subclassification.
The Element or Elements on which the client Elements depend in some respect.
Type with interpretations partly determined by differencingType, as described in Type::differencingType.
Type asserted to be disjoint with the disjoiningType.
Type with interpretations partly determined by intersectingType, as described in Type::intersectingType.
Type with interpretations partly determined by unioningType, as described in Type::unioningType.
The Feature that has a type determined by this FeatureTyping.
The Expression whose result is the upper bound of the MultiplicityRange.
The Expressions that are steps in the calculation of the result of this Function.
The model-level evaluable Boolean-valued Expression used to filter the members of this Package, which are owned by the Package are via ElementFilterMemberships.
The Interactions that type this Flow. Interactions are both Associations and Behaviors, which can type Connectors and Steps, respectively.
Identification of the language of the body text and, optionally, the region and/or encoding. The format shall be a POSIX locale conformant to ISO/IEC 15897, with the format [language[_territory][.codeset][@modifier]].
The Feature that is identified as a parameter by this ParameterMembership.
The ownedFeature of the Flow that is a PayloadFeature (if any).
The type of values transferred, which is the type of the payloadFeature of the Flow.
The Predicate that types the Expression.
The Feature that provides the items carried by the Flow. It must be a feature of the source of the Flow.
The Feature that receives the values carried by the Flow. It must be a feature of the target of the Flow.
The features of the Association that identify the things that can be related by it. A concrete Association must have at least two associationEnds. When it has exactly two, the Association is called a binary Association.
The Namespace into which Memberships are imported by this Import, which must be the owningRelatedElement of the Import.
The effectively imported Element for this Import. For a MembershipImport, this is the memberElement of the importedMembership. For a NamespaceImport, it is the importedNamespace.
Whether to import memberships without regard to declared visibility.
Whether to recursively import Memberships from visible, owned sub-Namespaces.
The types of the associationEnds of the Association, which are the relatedElements of the Association considered as a Relationship.
The source relatedType for this Association. It is the first relatedType of the Association.
The target relatedTypes for this Association. This includes all the relatedTypes other than the sourceType.
The Steps that make up this Behavior.
The Feature that is subsetted by the subsettingFeature of this Subsetting.
The Feature that is a subset of the subsettedFeature of this Subsetting.
The Annotations that relate this AnnotatingElement to its annotatedElements. This includes the owningAnnotatingRelationship (if any) followed by all the ownedAnnotatingRelationshps.
The Associations that type the Connector.
The endFeatures of a Connector, which redefine the endFeatures of the associations of the Connector. The connectorEnds determine via ReferenceSubsetting Relationships which Features are related by the Connector.
The innermost Type that is a common direct or indirect featuringType of the relatedFeatures, such that, if it exists and was the featuringType of this Connector, the Connector would satisfy the checkConnectorTypeFeaturing constraint.
An operator symbol that names a corresponding Function from one of the standard packages from the Kernel Function Library .
The ownedRelationships of this AnnotatingElement that are Annotations, for which this AnnotatingElement is the annotatingElement.
The Feature that this FeatureMembership relates to its owningType, making it an ownedFeature of the owningType.
The owningRelationship of this AnnotatingRelationship, if it is an Annotation.
The Features that are related by this Connector considered as a Relationship and that restrict the links it identifies, given by the referenced Features of the connectorEnds of the Connector.
The source relatedFeature for this Connector. It is the first relatedFeature.
A Type with a superset of all instances of the specific Type, which might be the same set.
A Type with a subset of all instances of the general Type, which might be the same set.
The Expressions whose results are bound to features of the instantiatedType. The arguments are ordered consistent with the order of the features, though they may not be one-to-one with all the features.
The Type that is being instantiated.
The Element that becomes an ownedMember of the membershipOwningNamespace due to this OwningMembership.
The elementId of the ownedMemberElement.
The name of the ownedMemberElement.
The shortName of the ownedMemberElement.
The Element that becomes a member of the membershipOwningNamespace due to this Membership.
The elementId of the memberElement.
The name of the memberElement relative to the membershipOwningNamespace.
The short name of the memberElement relative to the membershipOwningNamespace.
The Namespace of which the memberElement becomes a member due to this Membership.
The ownedSpecializations of this Classifier that are Subclassifications, for which this Classifier is the subclassifier.
The Function that types this Expression.
The Behaviors that type this Step.
The second chainingFeature of the crossedFeature of the ownedCrossSubsetting of this Feature, if it has one. Semantically, the values of the crossFeature of an end Feature must include all values of the end Feature obtained when navigating from values of the other end Features of the same owningType. .
Indicates how values of this Feature are determined or used (as specified for the FeatureDirectionKind).
The Type that is related to this Feature by an EndFeatureMembership in which the Feature is an ownedMemberFeature.
The last of the chainingFeatures of this Feature, if it has any. Otherwise, this Feature itself.
Whether the Feature is a composite feature of its featuringType. If so, the values of the Feature cannot exist after its featuring instance no longer does and cannot be values of another composite feature that is not on the same featuring instance.
If isVariable is true, then whether the value of this Feature nevertheless does not change over all snapshots of its owningType.
Whether the values of this Feature can always be computed from the values of other Features.
Whether or not this Feature is an end Feature. An end Feature always has multiplicity 1, mapping each of its domain instances to a single co-domain instance. However, it may have a crossFeature, in which case values of the crossFeature must be the same as those found by navigation across instances of the owningType from values of other end Features to values of this Feature. If the owningType has n end Features, then the multiplicity, ordering, and uniqueness declared for the crossFeature of any one of these end Features constrains the cardinality, ordering, and uniqueness of the collection of values of that Feature reached by navigation when the values of the other n-1 end Features are held fixed.
Whether an order exists for the values of this Feature or not.
Whether the values of this Feature are contained in the space and time of instances of the domain of the Feature and represent the same thing as those instances.
Whether or not values for this Feature must have no duplicates or not.
Whether the value of this Feature might vary over time. That is, whether the Feature may have a different value for each snapshot of an owningType that is an Occurrence.
The one ownedSubsetting of this Feature, if any, that is a CrossSubsetting}, for which the Feature is the crossingFeature..
The ownedRelationships of this Feature that are FeatureChainings, for which the Feature will be the featureChained.
The ownedRelationships of this Feature that are FeatureInvertings and for which the Feature is the featureInverted.
The ownedSubsettings of this Feature that are Redefinitions, for which the Feature is the redefiningFeature.
The one ownedSubsetting of this Feature, if any, that is a ReferenceSubsetting, for which the Feature is the referencingFeature.
The ownedSpecializations of this Feature that are Subsettings, for which the Feature is the subsettingFeature.
The ownedRelationships of this Feature that are TypeFeaturings and for which the Feature is the featureOfType.
The ownedSpecializations of this Feature that are FeatureTypings, for which the Feature is the typedFeature.
The FeatureMembership that owns this Feature as an ownedMemberFeature, determining its owningType.
Whether this Relationship was generated by tooling to meet semantic rules, rather than being directly created by a modeler.
The relatedElements of this Relationship that are owned by the Relationship.
The relatedElement of this Relationship that owns the Relationship, if any.
The Elements that are related by this Relationship, derived as the union of the source and target Elements of the Relationship.
The features of this Type that have a non-null direction.
All features of this Type with isEnd = true.
The ownedMemberFeatures of the featureMemberships of this Type.
The FeatureMemberships for features of this Type, which include all ownedFeatureMemberships and those inheritedMemberships that are FeatureMemberships (but does not include any importedMemberships).
All the memberFeatures of the inheritedMemberships of this Type that are FeatureMemberships.
All Memberships inherited by this Type via Specialization or Conjugation. These are included in the derived union for the memberships of the Type.
All features related to this Type by FeatureMemberships that have direction in or inout.
Indicates whether instances of this Type must also be instances of at least one of its specialized Types.
Indicates whether this Type has an ownedConjugator.
Whether all things that meet the classification conditions of this Type must be classified by the Type.
An ownedMember of this Type that is a Multiplicity, which constraints the cardinality of the Type. If there is no such ownedMember, then the cardinality of this Type is constrained by all the Multiplicity constraints applicable to any direct supertypes.
All features related to this Type by FeatureMemberships that have direction out or inout.
A Conjugation owned by this Type for which the Type is the originalType.
The ownedRelationships of this Type that are Differencings, having this Type as their typeDifferenced.
The ownedRelationships of this Type that are Disjoinings, for which the Type is the typeDisjoined Type.
All endFeatures of this Type that are ownedFeatures.
The ownedMemberFeatures of the ownedFeatureMemberships of this Type.
The ownedMemberships of this Type that are FeatureMemberships, for which the Type is the owningType. Each such FeatureMembership identifies an ownedFeature of the Type.
The ownedRelationships of this Type that are Intersectings, have the Type as their typeIntersected.
The ownedRelationships of this Type that are Specializations, for which the Type is the specific Type.
The ownedRelationships of this Type that are Unionings, having the Type as their typeUnioned.
The set of all member Elements of this Namespace, which are the memberElements of all memberships of the Namespace.
All Memberships in this Namespace, including (at least) the union of ownedMemberships and importedMemberships.
The ownedRelationships of this Namespace that are Imports, for which the Namespace is the importOwningNamespace.
The owned members of this Namespace, which are the ownedMemberElements of the ownedMemberships of the Namespace. .
The ownedRelationships of this Namespace that are Memberships, for which the Namespace is the membershipOwningNamespace.
Various alternative identifiers for this Element. Generally, these will be set by tools.
Contributor or contributors to the resource. It is likely that the target resource will be a foaf:Person but that is not necessarily the case.
Creator or creators of the resource. It is likely that the target resource will be a foaf:Person but that is not necessarily the case.
A short string representation for the type, for example ‘Car’.
The declared name of this Element.
An optional alternative name for the Element that is intended to be shorter or in some way more succinct than its primary name. It may act as a modeler-specified identifier for the Element, though it is then the responsibility of the modeler to maintain the uniqueness of this identifier within a model or relative to some other context.
The resource that derives from another resource originated from or is significantly influenced by the referenced resource. For example a model element derives from a requirement.
Descriptive text about resource represented as rich text in XHTML content.
The Documentation owned by this Element.
This resource elaborates the referenced resource.
The globally unique identifier for this Element. This is intended to be set by tooling, and it must not change during the lifetime of the Element.
A generic link from a resource to an external web page.
A unique identifier for a resource. Typically read-only and assigned by the service provider when a resource is created. Not typically intended for end-user display.
The URI of a Resource Shape that describes the possible properties, occurrence, value types, allowed values and labels. This shape information is useful in displaying the subject resource as well as guiding clients in performing modifications. Instance shapes may be specific to the authenticated user associated with the request that retrieved the resource, the current state of the resource and other factors and thus should not be cached.
Whether all necessary implied Relationships have been included in the ownedRelationships of this Element. This property may be true, even if there are not actually any ownedRelationships with isImplied = true, meaning that no such Relationships are actually implied for this Element. However, if it is false, then ownedRelationships may not contain any implied Relationships. That is, either all required implied Relationships must be included, or none of them.
Whether this Element is contained in the ownership tree of a library model.
Timestamp of latest resource modification.
The name to be used for this Element during name resolution within its owningNamespace. This is derived using the effectiveName() operation. By default, it is the same as the declaredName, but this is overridden for certain kinds of Elements to compute a name even when the declaredName is null.
The ownedRelationships of this Element that are Annotations, for which this Element is the annotatedElement.
The Elements owned by this Element, derived as the ownedRelatedElements of the ownedRelationships of this Element.
The Relationships for which this Element is the owningRelatedElement .
The owner of this Element, derived as the owningRelatedElement of the owningRelationship of this Element, if any.
The owningRelationship of this Element, if that Relationship is a Membership.
The Namespace that owns this Element, which is the membershipOwningNamespace of the owningMembership of this Element, if any.
The Relationship for which this Element is an ownedRelatedElement , if any.
The full ownership-qualified name of this Element, represented in a form that is valid according to the KerML textual concrete syntax for qualified names (including use of unrestricted name notation and escaped characters, as necessary). The qualifiedName is null if this Element has no owningNamespace or if there is not a complete ownership chain of named Namespaces from a root Namespace to this Element. If the owningNamespace has other Elements with the same name as this one, then the qualifiedName is null for all such Elements other than the first.
The target is a refinement of the source. (e.g. a use case scenario might be a refinement of a textual requirement that describes the interaction).
The model element satisfies the requirement (e.g. The use case satisfies a functional requirement).
A link to the resource's OSLC Service Provider. There may be cases when the subject resource is available from a service provider that implements multiple domain specifications, which could result in multiple values for this property.
The short name to be used for this Element during name resolution within its owningNamespace. This is derived using the effectiveShortName() operation. By default, it is the same as the declaredShortName, but this is overridden for certain kinds of Elements to compute a shortName even when the declaredName is null.
{{Short name identifying a resource, often used as an abbreviated identifier for presentation to end-users. SHOULD include only content that is valid inside an XHTML element}}.
The resource URI a client can perform a get on to obtain the original non-OSLC AM formatted resource that was used to create this resource. The source resource is usually a binary or proprietary format that the service provider can consume and convert into an OSLC AM format. The service may use content negotiation with the Accept header to obtain the desired content type.
The TextualRepresentations that annotate this Element.
Title of the resource represented as rich text in XHTML content.
The model element has a trace to the requirement (e.g. An attribute or its value are traced to a requirement).