- Print
- DarkLight
- PDF
Process - algorithm, process, or program that is implemented using a sequence or set of nodes.
Node - universal computational element (UCE) that represents the state of an object.
Node has such characteristics as queue, functions, logic, counters.
f
- request for the appropriate function node(i).
F
- each node receives an appropriate function that can be implemented by a human, API, code, or another node.
Cт
- counter, T-time for the oldest object in the queue.
Cn
- number of objects in the queue.
{Ci}
- custom counters.
Queue - queue of objects in a node.
Object - refers to a set of parameters that characterize an object. The information related to an object is processed in a node based on certain rules.
Functions - actions that need to be performed on the object from the queue in a node. Functions can be in the form of an API, program code, another process, etc.
Logic - tools for managing logic within a node. It can be system-level logic or user-defined logic.
System logic T - specifies the maximum time an object can stay in the node.
System logic N - specifies the maximum number of objects that can be in the queue in a node.
Counters - represent values without any associated actions (unlike logic). Counters can be system-level or user-defined.