TemporalConstraints

Fully qualified class name: DDICDIModels::DDICDILibrary::Classes::Process::TemporalConstraints

Definition

Temporal constraints provide a mechanism for expressing concurrency control and synchronization

Examples

Allen’s Interval Algebra is a set of temporal constraints. So are the Split and SplitJoin ControlConstructs

Explanatory notes

Allen’s interval algebra is a calculus for temporal reasoning that was introduced in 1983. Reasoning with qualitative time in Allen’s full interval algebra is nondeterministic polynomial time (NP) complete. Research since 1995 identified maximal tractable subclasses of this algebra via exhaustive computer search and also other ad-hoc methods. In 2003, the full classification of complexity for satisfiability problems over constraints in Allen’s interval algebra was established algebraically.

Diagram

Inheritance
    ᐊ── Process::TemporalConstraints
      ᐊ── Process::AllenIntervalAlgebra
      ᐊ── Process::TemporalControlConstruct
Attributes

Name

Inherited from

Description

Data Type

Multiplicity

Default value

description

Process::ControlLogic

A description of the control logic in human-readable language.

String

0..1

displayLabel

Process::ControlLogic

A human-readable display label for the object. Supports the use of multiple languages. Repeat for labels with different content, for example, labels with differing length limitations.

LabelForDisplay

0..*

identifier

Process::ControlLogic

Identifier for objects requiring short- or long-lasting referencing and management.

Identifier

0..1

name

Process::ControlLogic

Human understandable name (linguistic signifier, word, phrase, or mnemonic). May follow ISO/IEC 11179-5 naming principles, and have context provided to specify usage.

ObjectName

0..*

workflow

Process::ControlLogic

Reference to the system or standard from which the workflow was taken.

ControlledVocabularyEntry

0..1

Associations

Direction

Association

Description

Multiplicity of TemporalConstraints

Package of Other Class

Other Class

Multiplicity of other class

Aggregation Kind

Inherited from

to

Activity hasInternal ControlLogic

An activity is embedded in the control construct which launches it.

0..*

- own package -

Activity

0..*

none

Process::ControlLogic

from

ControlLogic has InformationFlowDefinition

A control construct has zero or more information flow definitions each of which provides the control construct with zero or more input and output parameters used or produced in the step/sub-step with which it is associated.

0..*

- own package -

InformationFlowDefinition

0..*

shared

Process::ControlLogic

to

ControlLogic hasSubControlLogic ControlLogic

Control logic is a container of control logic which is in turn a container of control logic ad infinitum so that it is able to represent the structure of a program.

0..*

- own package -

ControlLogic

0..1

none

Process::ControlLogic

from

ControlLogic informs ProcessingAgent

Control logic informs a processing agent. The information may be deterministic or non-deterministic.

0..*

- own package -

ProcessingAgent

0..*

none

Process::ControlLogic

from

ControlLogic invokes Activity

Control logic invokes an activity deterministically (either conditionally or unconditionally) or non-derministically (based on temporal constraints or rule-based scheduling).

0..*

- own package -

Activity

1..*

none

Process::ControlLogic

Syntax representations / encodings

All syntax representations except the Canonical XMI are provided as reference points for specific implementations, or for use as defaults if sufficient in the form presented.

Fragment for the class TemporalConstraints (entire model as XMI)

 1<packagedElement xmlns:StandardProfile="http://www.eclipse.org/uml2/5.0.0/UML/Profile/Standard"
 2                 xmlns:uml="http://www.eclipse.org/uml2/5.0.0/UML"
 3                 xmlns:xmi="http://www.omg.org/spec/XMI/20131001"
 4                 xmi:id="DDICDIModels-DDICDILibrary-Classes-Process-TemporalConstraints"
 5                 xmi:uuid="http://ddialliance.org/Specification/DDI-CDI/1.0/XMI/#TemporalConstraints"
 6                 xmi:type="uml:Class">
 7   <ownedComment xmi:id="DDICDIModels-DDICDILibrary-Classes-Process-TemporalConstraints-ownedComment"
 8                 xmi:uuid="http://ddialliance.org/Specification/DDI-CDI/1.0/XMI/#TemporalConstraints-ownedComment"
 9                 xmi:type="uml:Comment">
10      <annotatedElement xmi:idref="DDICDIModels-DDICDILibrary-Classes-Process-TemporalConstraints"/>
11      <body>Definition
12============
13Temporal constraints provide a mechanism for expressing concurrency control and synchronization
14
15Examples
16==========
17Allen's Interval Algebra is a set of temporal constraints. So are the Split and SplitJoin ControlConstructs
18
19Explanatory notes
20===================
21Allen's interval algebra is a calculus for temporal reasoning that was introduced in 1983. Reasoning with qualitative time in Allen's full interval algebra is nondeterministic polynomial time (NP) complete. Research since 1995 identified maximal tractable subclasses of this algebra via exhaustive computer search and also other ad-hoc methods. In 2003, the full classification of complexity for satisfiability problems over constraints in Allen's interval algebra was established algebraically.</body>
22   </ownedComment>
23   <name>TemporalConstraints</name>
24   <generalization xmi:id="DDICDIModels-DDICDILibrary-Classes-Process-TemporalConstraints-generalization"
25                   xmi:uuid="http://ddialliance.org/Specification/DDI-CDI/1.0/XMI/#TemporalConstraints-generalization"
26                   xmi:type="uml:Generalization">
27      <general xmi:idref="DDICDIModels-DDICDILibrary-Classes-Process-NonDeterministicDeclarative"/>
28   </generalization>
29</packagedElement>

Fragment for the class TemporalConstraints (entire XML Schema)

 1<xs:element name="TemporalConstraints"
 2            type="TemporalConstraintsXsdType"
 3            xml:id="TemporalConstraints">
 4  <!-- based on the UML class DDICDIModels::DDICDILibrary::Classes::Process::TemporalConstraints -->
 5  <xs:annotation>
 6    <xs:documentation>Definition
 7          ============
 8          Temporal constraints provide a mechanism for expressing concurrency control and synchronization
 9          
10          Examples
11          ==========
12          Allen's Interval Algebra is a set of temporal constraints. So are the Split and SplitJoin ControlConstructs
13          
14          Explanatory notes
15          ===================
16          Allen's interval algebra is a calculus for temporal reasoning that was introduced in 1983. Reasoning with qualitative time in Allen's full interval algebra is nondeterministic polynomial time (NP) complete. Research since 1995 identified maximal tractable subclasses of this algebra via exhaustive computer search and also other ad-hoc methods. In 2003, the full classification of complexity for satisfiability problems over constraints in Allen's interval algebra was established algebraically.</xs:documentation>
17  </xs:annotation>
18</xs:element>
19<xs:complexType name="TemporalConstraintsXsdType"
20                xml:id="TemporalConstraintsXsdType">
21  <xs:annotation>
22    <xs:documentation>Definition
23          ============
24          Temporal constraints provide a mechanism for expressing concurrency control and synchronization
25          
26          Examples
27          ==========
28          Allen's Interval Algebra is a set of temporal constraints. So are the Split and SplitJoin ControlConstructs
29          
30          Explanatory notes
31          ===================
32          Allen's interval algebra is a calculus for temporal reasoning that was introduced in 1983. Reasoning with qualitative time in Allen's full interval algebra is nondeterministic polynomial time (NP) complete. Research since 1995 identified maximal tractable subclasses of this algebra via exhaustive computer search and also other ad-hoc methods. In 2003, the full classification of complexity for satisfiability problems over constraints in Allen's interval algebra was established algebraically.</xs:documentation>
33  </xs:annotation>
34  <xs:complexContent>
35    <xs:extension base="NonDeterministicDeclarativeXsdType">
36      
37    </xs:extension>
38  </xs:complexContent>
39</xs:complexType>

Fragment for the class TemporalConstraints (main ontology)

1# class TemporalConstraints
2# based on the UML class DDICDIModels::DDICDILibrary::Classes::Process::TemporalConstraints
3cdi:TemporalConstraints
4  a rdfs:Class, owl:Class, ucmis:Class;
5  rdfs:label "TemporalConstraints";
6  rdfs:comment "Definition\n============\nTemporal constraints provide a mechanism for expressing concurrency control and synchronization\n\nExamples\n==========\nAllen's Interval Algebra is a set of temporal constraints. So are the Split and SplitJoin ControlConstructs\n\nExplanatory notes\n===================\nAllen's interval algebra is a calculus for temporal reasoning that was introduced in 1983. Reasoning with qualitative time in Allen's full interval algebra is nondeterministic polynomial time (NP) complete. Research since 1995 identified maximal tractable subclasses of this algebra via exhaustive computer search and also other ad-hoc methods. In 2003, the full classification of complexity for satisfiability problems over constraints in Allen's interval algebra was established algebraically."@en;
7  rdfs:subClassOf cdi:NonDeterministicDeclarative;
8.

Fragment for the class TemporalConstraints (main JSON-LD)

 1{
 2  "@context": [
 3    "NonDeterministicDeclarative.jsonld",
 4    {
 5      "cdi": "http://ddialliance.org/Specification/DDI-CDI/1.0/RDF/",
 6      "xsd": "http://www.w3.org/2001/XMLSchema#",
 7      "TemporalConstraints": "cdi:TemporalConstraints",
 8      
 9      " comment ": "tag:json-should-support-trailing-commas" 
10    }
11  ],
12  "generatedBy": "This code was generated by the Eclipse Acceleo project UCMIS M2T on 2024-03-16 23:40:11.",
13  "basedOn": "based on the UML data type DDICDIModels::DDICDILibrary::Classes::Process::TemporalConstraints"
14}