Properties
This code system defines the following properties for its concepts
Name | Code | URI | Type | Description |
Specializes | Specializes | | Coding | The child code is a more narrow version of the concept represented by the parent code. I.e. Every child concept is also a valid parent concept. Used to allow determination of subsumption. Must be transitive, irreflexive, antisymmetric. |
Generalizes | Generalizes | | Coding | Inverse of Specializes. Only included as a derived relationship. |
internalId | internalId | http://terminology.hl7.org/CodeSystem/utg-concept-properties#v3-internal-id | code | The internal identifier for the concept in the HL7 Access database repository. |
Status | status | http://hl7.org/fhir/concept-properties#status | code | Designation of a concept's state. Normally is not populated unless the state is retired. |
Concepts
This case-sensitive code system http://terminology.hl7.org/CodeSystem/v3-ActRelationshipCheckpoint
defines the following codes in a Is-A hierarchy:
Code | Display | Definition | internalId | Status |
B | beginning | Condition is tested every time before execution of the service (WHILE condition DO service). | 10351 | active |
E | end | Condition is tested at the end of a repeated service execution. The service is repeated only if the condition is true (DO service WHILE condition). | 10352 | active |
S | entry | Condition is tested once before the service is executed (IF condition THEN service). | 10350 | active |
T | through | Condition must be true throughout the execution and the service is interrupted (asynchronously) as soon as the condition turns false (asynchronous WHILE loop). The service must be interruptible. | 10353 | active |
X | exit | Condition is a loop checkpoint, i.e. it is a step of an activity plan and, if negative causes the containing loop to exit. | 10354 | active |
"
] ; #
fhir:url [ fhir:v "http://terminology.hl7.org/CodeSystem/v3-ActRelationshipCheckpoint"^^xsd:anyURI] ; #
fhir:identifier ( [
fhir:system [ fhir:v "urn:ietf:rfc:3986"^^xsd:anyURI ] ;
fhir:value [ fhir:v "urn:oid:2.16.840.1.113883.5.10" ]
] ) ; #
fhir:version [ fhir:v "3.0.0"] ; #
fhir:name [ fhir:v "ActRelationshipCheckpoint"] ; #
fhir:title [ fhir:v "ActRelationshipCheckpoint"] ; #
fhir:status [ fhir:v "active"] ; #
fhir:experimental [ fhir:v "false"^^xsd:boolean] ; #
fhir:date [ fhir:v "2019-03-20"^^xsd:date] ; #
fhir:publisher [ fhir:v "Health Level Seven International"] ; #
fhir:contact ( [
fhir:telecom ( [
fhir:system [ fhir:v "url" ] ;
fhir:value [ fhir:v "http://hl7.org" ]
] [
fhir:system [ fhir:v "email" ] ;
fhir:value [ fhir:v "hq@HL7.org" ]
] )
] ) ; #
fhir:description [ fhir:v "A code specifying when in the course of an Act a precondition for the Act is evaluated (e.g., before the Act starts for the first time, before every repetition, after each repetition but not before the first, or throughout the entire time of the Act.)\r\n\r\n*Discussion:* This attribute is part of the workflow control suite of attributes. An action plan is a composite Act with component Acts. In a sequential plan, each component has a sequenceNumber that specifies the ordering of the plan steps. Before each step is executed and has preconditions these conditions are tested and if the test is positive, the Act has clearance for execution. The repeatNumber may indicate that an Act may be repeatedly executed. The checkpointCode is specifies when the precondition is checked and is analogous to the various conditional statements and loop constructs in programming languages \"while-do\" vs. \"do-while\" or \"repeat-until\" vs. \"loop-exit\".\r\n\r\nFor all checkpointCodes, except \"end\", preconditions are being checked at the time when the preceding step of the plan has terminated and this step would be next in the sequence established by the sequenceNumber attribute.\r\n\r\nWhen the checkpointCode for a criterion of a repeatable Act is \"end\", the criterion is tested only at the end of each repetition of that Act. When the condition holds true, the next repetition is ready for execution.\r\n\r\nWhen the checkpointCode is \"entry\" the criterion is checked at the beginning of each repetition (if any) whereas \"beginning\" means the criterion is checked only once before the repetition \"loop\" starts.\r\n\r\nThe checkpointCode \"through\" is special in that it requires the condition to hold throughout the execution of the Act, even throughout a single execution. As soon as the condition turns false, the Act should receive an interrupt event (see interruptibleInd) and will eventually terminate.\r\n\r\nThe checkpointCode \"exit\" is only used on a special plan step that represents a loop exit step. This allows an action plan to exit due to a condition tested inside the execution of this plan. Such exit criteria are sequenced with the other plan components using the ActRelationship.sequenceNumber."] ; #
fhir:copyright [ fhir:v "This material derives from the HL7 Terminology THO. THO is copyright ©1989+ Health Level Seven International and is made available under the CC0 designation. For more licensing information see: https://terminology.hl7.org/license.html"] ; #
fhir:caseSensitive [ fhir:v "true"^^xsd:boolean] ; #
fhir:hierarchyMeaning [ fhir:v "is-a"] ; #
fhir:content [ fhir:v "complete"] ; #
fhir:property ( [
fhir:extension ( [
fhir:url [ fhir:v "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-symmetry"^^xsd:anyURI ] ;
fhir:value [ fhir:v "antisymmetric" ]
] [
fhir:url [ fhir:v "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-transitivity"^^xsd:anyURI ] ;
fhir:value [ fhir:v "transitive" ]
] [
fhir:url [ fhir:v "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-reflexivity"^^xsd:anyURI ] ;
fhir:value [ fhir:v "irreflexive" ]
] [
fhir:url [ fhir:v "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-isNavigable"^^xsd:anyURI ] ;
fhir:value [ fhir:v "true"^^xsd:boolean ]
] [
fhir:url [ fhir:v "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-relationshipKind"^^xsd:anyURI ] ;
fhir:value [ fhir:v "Specializes" ]
] [
fhir:url [ fhir:v "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-inverseName"^^xsd:anyURI ] ;
fhir:value [ fhir:v "Generalizes" ]
] ) ;
fhir:code [ fhir:v "Specializes" ] ;
fhir:description [ fhir:v "The child code is a more narrow version of the concept represented by the parent code. I.e. Every child concept is also a valid parent concept. Used to allow determination of subsumption. Must be transitive, irreflexive, antisymmetric." ] ;
fhir:type [ fhir:v "Coding" ]
] [
fhir:extension ( [
fhir:url [ fhir:v "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-symmetry"^^xsd:anyURI ] ;
fhir:value [ fhir:v "antisymmetric" ]
] [
fhir:url [ fhir:v "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-transitivity"^^xsd:anyURI ] ;
fhir:value [ fhir:v "transitive" ]
] [
fhir:url [ fhir:v "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-reflexivity"^^xsd:anyURI ] ;
fhir:value [ fhir:v "irreflexive" ]
] [
fhir:url [ fhir:v "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-isNavigable"^^xsd:anyURI ] ;
fhir:value [ fhir:v "true"^^xsd:boolean ]
] [
fhir:url [ fhir:v "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-relationshipKind"^^xsd:anyURI ] ;
fhir:value [ fhir:v "Generalizes" ]
] [
fhir:url [ fhir:v "http://terminology.hl7.org/StructureDefinition/ext-mif-relationship-inverseName"^^xsd:anyURI ] ;
fhir:value [ fhir:v "Specializes" ]
] ) ;
fhir:code [ fhir:v "Generalizes" ] ;
fhir:description [ fhir:v "Inverse of Specializes. Only included as a derived relationship." ] ;
fhir:type [ fhir:v "Coding" ]
] [
fhir:code [ fhir:v "internalId" ] ;
fhir:uri [ fhir:v "http://terminology.hl7.org/CodeSystem/utg-concept-properties#v3-internal-id"^^xsd:anyURI ] ;
fhir:description [ fhir:v "The internal identifier for the concept in the HL7 Access database repository." ] ;
fhir:type [ fhir:v "code" ]
] [
fhir:code [ fhir:v "status" ] ;
fhir:uri [ fhir:v "http://hl7.org/fhir/concept-properties#status"^^xsd:anyURI ] ;
fhir:description [ fhir:v "Designation of a concept's state. Normally is not populated unless the state is retired." ] ;
fhir:type [ fhir:v "code" ]
] ) ; #
fhir:concept ( [
fhir:code [ fhir:v "B" ] ;
fhir:display [ fhir:v "beginning" ] ;
fhir:definition [ fhir:v "Condition is tested every time before execution of the service (WHILE condition DO service)." ] ;
fhir:property ( [
fhir:code [ fhir:v "status" ] ;
fhir:value [ fhir:v "active" ]
] [
fhir:code [ fhir:v "internalId" ] ;
fhir:value [ fhir:v "10351" ]
] )
] [
fhir:code [ fhir:v "E" ] ;
fhir:display [ fhir:v "end" ] ;
fhir:definition [ fhir:v "Condition is tested at the end of a repeated service execution. The service is repeated only if the condition is true (DO service WHILE condition)." ] ;
fhir:property ( [
fhir:code [ fhir:v "status" ] ;
fhir:value [ fhir:v "active" ]
] [
fhir:code [ fhir:v "internalId" ] ;
fhir:value [ fhir:v "10352" ]
] )
] [
fhir:code [ fhir:v "S" ] ;
fhir:display [ fhir:v "entry" ] ;
fhir:definition [ fhir:v "Condition is tested once before the service is executed (IF condition THEN service)." ] ;
fhir:property ( [
fhir:code [ fhir:v "status" ] ;
fhir:value [ fhir:v "active" ]
] [
fhir:code [ fhir:v "internalId" ] ;
fhir:value [ fhir:v "10350" ]
] )
] [
fhir:code [ fhir:v "T" ] ;
fhir:display [ fhir:v "through" ] ;
fhir:definition [ fhir:v "Condition must be true throughout the execution and the service is interrupted (asynchronously) as soon as the condition turns false (asynchronous WHILE loop). The service must be interruptible." ] ;
fhir:property ( [
fhir:code [ fhir:v "status" ] ;
fhir:value [ fhir:v "active" ]
] [
fhir:code [ fhir:v "internalId" ] ;
fhir:value [ fhir:v "10353" ]
] )
] [
fhir:code [ fhir:v "X" ] ;
fhir:display [ fhir:v "exit" ] ;
fhir:definition [ fhir:v "Condition is a loop checkpoint, i.e. it is a step of an activity plan and, if negative causes the containing loop to exit." ] ;
fhir:property ( [
fhir:code [ fhir:v "status" ] ;
fhir:value [ fhir:v "active" ]
] [
fhir:code [ fhir:v "internalId" ] ;
fhir:value [ fhir:v "10354" ]
] )
] ) . #
# -------------------------------------------------------------------------------------