computing process

IRI: https://spec.industrialontologies.org/ontology/construct/ComputingProcess

Defined In: https://spec.industrialontologies.org/ontology/core/Core/

SubClass Of: planned process

Class Hierarchy

owl:Thing › bfo:entity › bfo:occurrent › bfo:process › planned process › computing process

Direct subclasses:

• data preparation process
• outlier detection

Definition

planned process in which an algorithm or an encoded algorithm is realized by an agent

Semi-Formal Definition:

every instance of ‘computing process’ is defined as exactly an instance of ‘planned process’ that ‘concretizes at some time’ an ‘encoded algorithm’ or ‘algorithm’ y which ‘generically depends on at some time’ some ‘agent’ which ‘participates in at some time’ the ‘computing process’ and the ‘computing process’ either ‘achieves at some time’ some ‘objective specification’ that is ‘continuant part of at all times y or it ‘has specified output’ some ‘information content entity’

Explanatory Notes

1. The inputs and specified outputs of ‘computing process’ are strictly limited to information content entities.
2. While it is true that algorithms can result in an action by an agent that concretizes it (e.g. controller changes the pressure of a valve), the intermediate step is still an information content entity (e.g. action specification) that is ‘concretized’ in a separate process that results in the action.

Examples

• execution of a neural network implemented in tensorflow to classify a set of images on a specific cluster; running of the MPC algorithm to control pressure during the production process

Adapted From

• https://en.wikipedia.org/wiki/Process_(computing) and https://en.wikipedia.org/wiki/Execution_(computing)

Formal Axioms

First-Order Logic Definition

ComputingProcess(x) ↔ PlannedProcess(x) ∧ ∃y∃a(Agent(y) ∧ (Algorithm(a) ∨ EncodedAlgorithm(a)) ∧ hasParticipantAtSomeTIme(x,y) ∧ genericallyDependsOnAtSomeTime(a,y) ∧ concretizesAtSomeTime(x,a) ∧ (∃o(ObjectiveSpecification(o) ∧ continuantPartOfAtAllTimes(o,a) ∧ achievesAtSomeTIme(x,o)) ∨ 
∃i(InformationContentEntity(i) ∧ hasSpecifiedOutput(x,i))))

First-Order Logic Axioms

ComputingProcess(x) → ∀y((hasInput(x,y) ∨ hasSpecifiedOutput(x,y)) → InformationContentEntity(y))

Semi-Formal Natural Language Axioms

if x is a ‘computing process’ then whenever x ‘has input’ or ‘has specified output’ y that y must be an ‘information content entity’

Description Logic

constr:ComputingProcess ≡ constr:PlannedProcess ⊓ (∃ constr:achievesAtSomeTime .(constr:ObjectiveSpecification ⊓ ∃ bfo:continuant_part_of_at_all_times .(constr:Algorithm ⊔ constr:EncodedAlgorithm)) ⊔ ∃ constr:hasSpecifiedOutput .constr:InformationContentEntity) ⊓ ∃ bfo:has_participant_at_some_time .constr:Agent ⊓ ∃ bfo:concretizes_at_some_time .((constr:Algorithm ⊔ constr:EncodedAlgorithm) ⊓ ∃ bfo:generically_depends_on_at_some_time .constr:Agent)

constr:ComputingProcess ⊑ constr:PlannedProcess

constr:ComputingProcess ⊑ ∀ constr:hasInput .constr:InformationContentEntity

constr:ComputingProcess ⊑ ∀ constr:hasSpecifiedOutput .constr:InformationContentEntity

EquivalentTo: constr:PlannedProcess and (constr:achievesAtSomeTime some (constr:ObjectiveSpecification and bfo:continuant_part_of_at_all_times some (constr:Algorithm or constr:EncodedAlgorithm)) or constr:hasSpecifiedOutput some constr:InformationContentEntity) and bfo:has_participant_at_some_time some constr:Agent and bfo:concretizes_at_some_time some ((constr:Algorithm or constr:EncodedAlgorithm) and bfo:generically_depends_on_at_some_time some constr:Agent)

SubClassOf: constr:PlannedProcess

SubClassOf: constr:hasInput only constr:InformationContentEntity

SubClassOf: constr:hasSpecifiedOutput only constr:InformationContentEntity