Pre-defined ADOxx classes in Dynamic Library for a "Graph-based environment"
The following classes are made available by the ADOxx platform. Each of the classes is abstract and provides specific functionality to the implemenetation. The functionality is briefly introduced for each abstract class.
__ D-construct ___
Super class for „graph-based" pre-defined meta model.
__ D_container __
Container class provide the relation „is-inside", hence every object a drawn on the model having its x/y coordinates within the drawing area of any container b has the relation a Ris-inside b.
Aggregation inherits from __D_Container__, hence also provides the „is-inside" relation and enables a self-defined „drawing area". E.g. resizeable rectangel.
Swimmlane inherits form __D_Container__, hence also provides the „is-inside" relation but only enables either rows (x=0 to x= maximum) or colums (y= 0 to y= maxium) as possible „drawing area". E.g. three colums one for input, one for processing, one for output.
__ D_event ___
Event encapsolates all possible notes of a graph and distinguishes between "D_variable_assignment_object" and "D_end".
__ D_end __
The end concludes the graph and finishes state changes.
Variable assignment objects enable the change of the state. The state is stored in variables, hence each of the following concepts have the potential to change the status of variables within a graph:
Neutral element, start, subgraph, activity, decision, parallelity, merging.
Neutral elements do not participate in executing the graph but only display references or state the status.
Start is the starting node of the graph.
__ Subgraph ___
Subgraph substitutes a sub-graph in the graph to make complex graphs more readable. Technically the subgraph is a pointer to another graph.
Activity is a node in the graph that performs the typical actions the graph is designed for. Activities are transforming input into output.
Decisions split the graph in several alternative paths.
Parallelity starts a synchronized path of a graph.
Merging ends a synchronized path of a graph.
__ D_variable ___
Variables are objects that store a certain status of the graph. Hence different variables can be defined, describing different aspects of a graph.
__ D_random_generator __
Random generator creates random figures that can be assigned to variables. This is used for simulation.
Resources are properties of graph-nodes represented in an own class hierarchy. Hence descriptive properties need not only be defined as attributes of graph nodes but can be described as classes using class hierarchy from resources.
Graph-based Realisation and Mapping
The following sample graph represents an example model to be realized with ADOxx. A possible mapping of the abstract classes of above to this sample graph is shown in the following.
Possible Mapping of Graph Instances to ADOxx Dynmaic Meta Model
Inheritance/Dependencies of ADOxx Dynamic Metamodel
The following figure shows the inheritance of pre-defined abstract classes of the dynamic library and the implementation/inheritance with the tutorial library (available online at http://www.adoxx.org/live/adoxx-application-library-code-repository).
ADOxx Dynamic Meta Model