WO2002019044A2 - Dispositif et procede pour la surveillance, la commande et la regulation integrees de deroulements de procedes techniques complexes - Google Patents

Dispositif et procede pour la surveillance, la commande et la regulation integrees de deroulements de procedes techniques complexes Download PDF

Info

Publication number
WO2002019044A2
WO2002019044A2 PCT/EP2001/009842 EP0109842W WO0219044A2 WO 2002019044 A2 WO2002019044 A2 WO 2002019044A2 EP 0109842 W EP0109842 W EP 0109842W WO 0219044 A2 WO0219044 A2 WO 0219044A2
Authority
WO
WIPO (PCT)
Prior art keywords
data
central
objects
services
information
Prior art date
Application number
PCT/EP2001/009842
Other languages
German (de)
English (en)
Other versions
WO2002019044A3 (fr
Inventor
Markus Gillich
Roland Dirks
Original Assignee
Markus Gillich
Roland Dirks
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Markus Gillich, Roland Dirks filed Critical Markus Gillich
Priority to EP01967297A priority Critical patent/EP1314070A2/fr
Publication of WO2002019044A2 publication Critical patent/WO2002019044A2/fr
Publication of WO2002019044A3 publication Critical patent/WO2002019044A3/fr

Links

Classifications

    • G—PHYSICS
    • G05—CONTROLLING; REGULATING
    • G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B15/00—Systems controlled by a computer
    • G05B15/02—Systems controlled by a computer electric
    • G—PHYSICS
    • G05—CONTROLLING; REGULATING
    • G05B—CONTROL OR REGULATING SYSTEMS IN GENERAL; FUNCTIONAL ELEMENTS OF SUCH SYSTEMS; MONITORING OR TESTING ARRANGEMENTS FOR SUCH SYSTEMS OR ELEMENTS
    • G05B2219/00—Program-control systems
    • G05B2219/30—Nc systems
    • G05B2219/34—Director, elements to supervisory
    • G05B2219/34246—OOC object oriented control

Definitions

  • the present invention relates to a device and a method for modeling, integrated monitoring, control, regulation and data storage of preferably multi-part devices and complex technical processes.
  • the invention also relates to the use of the devices mentioned for complex technical processes.
  • control system can be supplied with additional information (for example, documentation) via further local or global data (for example, via the Internet) "hooked" into the model structure.
  • additional information for example, documentation
  • global data for example, via the Internet
  • models formed in this way can be used an Internet connection can be operated from anywhere in the world.
  • a corresponding prior art is, for example, the publication with the number DE 19834456.
  • the disadvantages of the prior art described lie essentially in the largely centralized structures. Due to the supposedly simpler and clear administration, security and manageability compared to completely decentralized systems, the model formed is usually formed on only one or a few data processing systems and with the tasks of visualization, operation, observation, data storage, information transfer and sometimes also with control and control tasks for the entire complex automation system. All essential functions are only offered at one or a few nodes, but are not provided at a decentralized point on the automation system itself. The scalability of the model and the services used on it is severely restricted by the technical performance limits of the central system. The disadvantages of the central nodes continue to be that fast and powerful and therefore very expensive data processing systems with a high storage capacity are required.
  • the object of the present invention is to achieve the performance features of the known prior art on distributed data processing systems, while avoiding the disadvantages mentioned above.
  • the invention is intended to offer additional performance features which exceed the current state of the art and, above all, relate to the automation and organization of distributed technical systems in large numbers.
  • the invention relates to a device for integrated monitoring, control, regulation, analysis and data storage of complex technical processes based on individual measurement
  • a device which has at least one central kernel, each with an integrated access control, separate control for the management of tasks, threads, memory, network capacities and a hierarchically structured object tree management with integrated function for program-controlled or manual collection and distribution of data elements, Administration and communication of services and other central kernels including associated data structures (MetaOS nodes).
  • the device can have spatially and / or thematically related physical or logical devices or further central kernels as clients or server services of the MetaOS node, which can simultaneously communicate with the object tree management of the central kernel if required, and at least one service of the device can have external interfaces for operating and monitoring the distributed Have data processing system.
  • the device can furthermore be designed such that a local central kernel is expanded during operation by any data services and further central kernels as required, and any data services and further central kernels are removed as required.
  • Other external central kernels and the services of a central kernel have object trees assigned and standardized, hierarchically structured object trees which are assigned to the respective prophetic individual devices.
  • the object trees of the services or their parts are assigned to the object tree management of the central kernel at any point (mounted) and via an optional program-controlled projection procedure based on sequences, priorities, filters and operators to a resulting object tree with elements that are combined from objects of several services , merged (synchronized) and saved.
  • Each element of the object trees of services and central kernels can consist of any data object and optionally any number of metadata objects assigned to the data object and a hierarchically structured tree of header data objects can be assigned to each data and metadata object. All object tree elements of all data services, central kernel and header data objects of the distributed data processing system always have an identical one Basic structure on.
  • Objects, metadata objects and header data objects of an element of the central kernel can continue to be projected into the element in any combination with the basic projection method from the services of the central kernel and from further central kernels.
  • the header data objects of each data and metadata object of a central kernel can contain timing information for synchronization, information about resources the local location (CPU, memory, network capacities), log and error information, information on user management and authentication, security, transport, popularity and priority properties and status of the data object, as well as complete information on the type and current status of the operator control and monitoring devices and
  • the same information types of the header data objects from any central kernel can also be projected onto a common header data object by mounting and program-controlled synchronization.
  • Data, metadata or header data objects from object trees which are mounted by different data services and other central kernels in the same location in the object directory of the central kernel, can be synchronized with the central kernel using projection priorities and syntactic, semantic, logical and numerical program-controlled filters and operators get saved.
  • any objects, elements and substructures can be one Central kernel with any objects, elements and substructures of other local data services, user interfaces or central kernels and with any objects, elements and structures of your own central kernel with the help of a common command language for all brushes and communication processes between objects, elements and structures mounted, filtered, with operators linked and synchronized.
  • data, metadata and header data objects of hierarchically higher-level as well as subordinate tree elements can be mounted and synchronized by specifying relative mount marks.
  • An index of synchronized object directories, data objects and metadata objects is also created in each central kernel of the data processing system.
  • the invention also relates to methods for integrated monitoring, control, regulation, analysis and data storage of preferably multi-part complex technical processes by any participant in the distributed data processing device, wherein individual information, information lists and hierarchically organized information structures from data, status and function interfaces of the individual measurement , Analysis, storage, regulating, operating and monitoring devices and from central kernels can be encapsulated by program-controlled information projection as required in the respective object trees of the assigned services.
  • any services mounting the central kernel and further central kernel can read, observe and analyze about the information projected and stored in the central kernel from all devices assigned to the central kernel and the global and regional directory, and can describe and thus describe the opposite process with information operate, observe and regulate.
  • each data object and metadata object of a data service or central kernel can encapsulate time-variable information from the technical devices by program-controlled synchronization
  • the program-controlled synchronization of object structures and objects can be controlled by schedulers in the data services, which take their timing information from the header data objects of the object trees.
  • a logically linked hierarchy of central kernels can be formed from distributed object holdings, so that each central kernel of the hierarchy is given access to a resulting, uniformly global, a different regional and a locally private object tree from decentralized services and elements, in that each node forms a mounting scheme, so that each node synchronizes local data services into a local private and a local public directory, mounts and synchronizes a fixed global directory of the hierarchically higher directory to the root element of its own central core, and public local object holdings to the public object holdings of the parent Mounts and synchronizes nodes in the local global directory and mounts public regional object holdings of the subordinate nodes to its own regional object tree.
  • each central kernel synchronizes databases of the virtual center and databases of other central kernels and simulates temporarily inactive failed central kernels with these synchronized databases for the period of the failure.
  • each central kernel in the network mounts and synchronizes all directories of all other central kernels from a logically connected group of central kernels Group in a range directory defined for the entire group and thus forms a “symbiosis”.
  • timing information for synchronization information about resources of the local location (CPU, memory, network capacities), log and error information stored decentrally in the header objects of services , Information on user administration and authentication, security, transport, popularity and priority properties and status of the data objects, as well as information on the type and status of the operating and monitoring devices as well as description information on the objects and summarized information on hierarchically lower-level object structures in their own private directories , regional area directories and uniform global directories for all central kernels are always synchronized Changes to data objects, metadata objects and header data objects in the object trees v on Data services and central kernels can be noted in the header data objects of the respective elements and the change note can be successively transmitted to hierarchically higher-level object hierarchies and hierarchically subordinate object hierarchies can regularly request changes in hierarchically higher elements, so that object and element changes in all global, regional and private ones Object tree directories are noticed.
  • the invention also relates to a device for operating and monitoring, which is formally characterized in that a group of two- or three-dimensional, interactive components of a graphical user interface a- .. a m lying in a two- or three-dimensional area, again consisting of Sets br..bm- of two- or three-dimensional interactive graphical user interfaces generated in local and decentralized locations, in the Each user interface of the set b contains an associated set of cL.cn graphical basic elements that is specific to you and optionally a set of freely definable additional graphical elements and the design of at least one of the basic elements of each set c is such that at least one additional graphical user interface is of the set type a or b or at least one user interface of at least one element of the set of user interfaces b can be completely mapped in a sub-area of c, and the elements of sets a and b serve as external operating and observation interfaces of the elements of one or more data services in the distributed data processing system by synchronizing and
  • the directory structures, data objects, metadata objects and header data objects and indices that are exchanged between the object trees can be encrypted and, if requested, the transmission channels can also be encrypted during the transmission.
  • the invention serves to convert a dynamically changing multitude of different distributed technical devices, events, and assigned documents and applications into a structured, technically organizational unit (the distributed one)
  • Data processing system to merge efficiently and to organize, administrate and program-controlled this unit safely, efficiently and dynamically, as well as to optimize it technically and organizationally, as well as manually.
  • the invention maps all basic requirements for distributed real technical devices in a virtually centralized model of any distributed logically related information by means of a single basic method and is used for modeling, administration, operation and monitoring of the control and regulation techniques of these devices including the optimized organization, communication and distribution of documents necessary for the optimal functioning of the real device.
  • the invention is used in particular for the safe, uniform influencing and control of distributed technical processes, for example a large amount of globally distributed automation systems (for example distributed industrial systems, wind farms, thermal and electrical solar cells, combined heat and power plants, biogas plants, coal-fired power plants, oil-fired power plants, gas turbine plants, nuclear power plants, fuel cell plants, hydropower plants and other energy supply plants, also in mixed operation, for mobile radio stations, networked operating and monitoring devices, pipeline networks, power networks, building automation in urban areas and administration of technical infrastructures etc.) or complex industrial plants with the help of the Internet.
  • the managed and controlled processes of the real devices and the associated documents can be of any complexity, installed on data processing devices, distributed on different computers and dynamically changing in number.
  • Any number of authorized users can influence the real processes and documents different rights of equipped users and automated services, at any time and from any place.
  • Data transfer, graphical user interfaces and management of all services and information are summarized in a standardized, secure, platform and location-independent, resource-saving, analysis, mapping, networking, operating and organizational method.
  • the structured control of a large number of real processes along with the associated documents is improved with the help of meta-object-based knowledge management, distribution and search methods, expanded with the necessary additional communication channels and linked with already thematically related internet-compatible applications to more organized application categories.
  • the invention Due to the low core complexity and simplicity of the invention, due to high modularization and scalability, the very low resource consumption of the invention at the process level and a complete decentralization of all basic functions of the distributed data processing system, which are required for the modeling, control and management of the technical devices, as well as the safe operation on insecure networks, the invention is suitable not only for the control and management of any complex distributed industrial processes, but also for the networked, efficient and elegant management of a large number of widely distributed small technical applications.
  • the invention provides a secure, robust, resource-saving, efficient design solution for a device and a method for secure, virtually centralized modeling, operation and observation, organization, as well as for the exchange and handling of a large number of distributed, complex internet-based information and processes based on real
  • the system according to the invention consisting of central kernels with central control, assigned services and access control is called "MetaOS" in the following.
  • the information to be processed is essentially based on rapidly changing technical process and status information of any structure, but can also contain database and directory information etc., technical and organizational documents, but also any new and existing Internet-based applications and administration information.
  • MetaOS primary network represents a distributed data processing device with the focus on decentralized technical process control and monitoring. This surrounds all contained data objects by means of a single operating, visualization and administration principle. Bundling processes can be done on any number of technical, logical and administrative levels and enable location-independent uniform access to all basic functions of the distributed system.
  • the MetaOS primary network should easily provide information provided by FTP and web servers, which can also include time-varying process data of a technical device , into the virtual device. The entirety of the data objects that are transmitted by such servers exclusively via standard FTP and HTTP commands is stored in the hereinafter referred to as the "MetaOS secondary network".
  • the task of the secondary network is to integrate databases of small technical applications, for example widely distributed systems in building automation, into the primary network.
  • the virtual device should be able to be used from the smallest process controls with HTTP and FTP servers to the management levels of complex, distributed industrial and administrative processes. It should be easy to insert into existing infrastructures and be able to Get to grips with sudden increases in structured and unstructured information from a variety of self-sufficient, unrelated sources and evaluate them in a useful way.
  • MetaOS networks made up of primary and secondary networks form a unifying, compact intermediate layer that can be latched into almost any operating system groups that serve to control and administer technical devices. These can be specialized small operating systems for process controls, but also complex server operating systems. MetaOS fits indiscriminately into existing heterogeneous computer landscapes. MetaOS networks should enable uniform modeling, mapping, management, optimization, networking, mixing and user-specific expansion of any existing local and internet-based services and documents from process levels to management and administration levels.
  • MetaOS nodes With the help of a number of differently grouped, distributed object trees with a common command language, which will be called MetaOS nodes (Fig. 1), different data services and applications of local, technical and non-technical sub-processes are mapped to a common data structure (Fig. 2) or generated own services.
  • the common data structure of a MetaOS node is a virtual, dynamically generated, hierarchically organized, variable object tree (Fig. 6) with an integrated meta and header object concept (Fig. 12, 13, 16).
  • Data objects of a MetaOS node are virtually formed from the various information from the services of one or more MetaOS nodes (FIGS. 5, 7, 8, 11, 12). The type of information supplied is arbitrary.
  • data services from the process world e.g.
  • data services and the central kernel can contain their own program-controlled control and regulation instructions and process and change the data objects supplied in the virtual object tree.
  • FIG. 4.5 Due to the possibility of partial or complete location-dependent “covering” (hereinafter referred to as “mounting”) identical and similar subsets of virtually formed structures of the various MetaOS nodes (FIG. 4.5), for example, different data service structures can be formed in such a way that larger ones Physical, technical and organizational relationships of distributed, changing real technical devices depending on the location of the user (operator, administrator, etc.) are virtually structured and meaningfully merged, displayed and interact with each other (Fig. 52-55) a fluctuating information network that is dependent on time and location and can be used to efficiently manage large quantities of technical systems.
  • the integration of a decentralized, integrated cache and routing method in the information network replicates and distributes information s the information network automatically in regions in which you are in demand and thus increases the performance of the entire virtual device (Fig. 26).
  • the meta-object concept is particularly efficient on weak networks with low transmission capacity on which large documents in connection with process data are to be shared.
  • the dynamic meta and header object concept is intended to simplify and optimize organizational and administrative forms Optimization of the data transmission, simplified information extraction from the real and virtual devices and thus ultimately the optimization of the functioning of the technical devices. Further improvements are achieved by manually "hooking" suitable additional information sources, by linking related information by means of filtered synchronization in the MetaOS network and by using the cache and routing functions.
  • Arbitrary search requests to the meta objects and data objects of the networked virtual device generate structured subsets of information of the total data set. Search results are distributed, evaluated, condensed and processed in areas with high demand and can in turn be inserted at any point in the hierarchical virtual information structures of MetaOS nodes.
  • the "network knowledge" thus obtained from superordinate data can be used to optimize the local real processes .
  • the representation of data objects is carried out by a n-dimensional group formed from decentralized components and using the virtual data objects, in some basic properties more uniform but generally only similar, hierarchical graphical user interfaces that can be arbitrarily layered and projected.
  • Each user interface represents the associated subset of information from MetaOS nodes on a unified directory.
  • the graphical objects of the user interfaces can be related to each other and enable the simple visual merging of the most diverse distributed technical, organizational and syntactically / semantically similar information on thematically related information objects on different organizational levels.
  • the structure and arrangement of the user interfaces are intended to manage and structure data references, complex data hierarchies and time significantly improve successive operating sequences.
  • the possibility of largely distributing the computing load for the construction and operation of the user interfaces to the computers that present the user interfaces (FIG. 7, 8) is intended to ensure the operation of MetaOS nodes even on very poorly performing data service servers.
  • the basic components of the distributed data processing system are essentially known from various areas of technology and information technology, the efficient and user-friendly way of integrated interaction, the simple possibility of linking all basic components and the application to technical devices enable the high performance and user-friendliness of the MetaOS network and thus exceed the current state of the art.
  • MetaOS network Fig. 52, 53, 54, 55, 56
  • the secondary network Fig. 30 component 334, 3308
  • Fig. 32 component 352, 353, 354 Individual MetaOS nodes that in addition to the control and administration of the technical device by coupling with the real technical device, any general and specialized tasks in the network can be automatically integrated into the MetaOS structure by means of autoconfiguration (see also Fig. 18 .relative synchronization of objects via different Central kernel) or any inhomogeneous network.
  • Any MetaOS node can at least one special service is assigned to the visualization service (Fig. 1 component 7, (Fig. 5 component 73, Fig. 8 component 116).
  • Visualization services take over the graphic representation of data objects in the network.
  • the identical basic structure of all nodes and services in the network which allows all network users to perform all the tasks required in the network, allows the network or its parts to be optimized with regard to robustness, ease of use, security, simple navigation and administration.
  • an electronic individual system of a technical device becomes the primary or assigned to the secondary network (FIG. 30), objects, meta objects, header objects, elements, data services, MetaOS nodes, MetaOS networks (primary and secondary networks) and
  • MetaOS network Visualization services in a MetaOS network are created with the help of uniform object, .metaobject, header structures,
  • MetaOS networks made up of different elements appear to users as a single, uniform structure in which all services can be used.
  • the complexity of the network is hidden.
  • the linking strategy of the MetaOS nodes fulfills all basic requirements for efficiency and robustness.
  • a MetaOS node for modeling, integrated monitoring, control, regulation, analysis and data storage of complex technical process sequences consists of a compact central kernel, each with an integrated rudimentary access control, separate control for the management of tasks, threads, memory, network capacities and one hierarchical structured object tree management with integrated function for program-controlled or manual collection and distribution of data elements, administration and communication of services and central kernels including associated data structures and a collection of any specialized data services (components 4-10), which physically or logically related devices or other central kernels as client or server services of the MetaOS node and communicate with the object tree management of the central kernel at the same time if required.
  • At least one service of a MetaOS node can have external interfaces for operating and monitoring the distributed data processing system.
  • a local central kernel is expanded during operation by any data services and further central kernels, and any data services and further central kernels are removed if necessary. All data services assigned to the central kernel appear to the central kernel like other central kernels in the MetaOS network (FIG. 10 component 125). Users, systems, applications and other MetaOS nodes can communicate with the data services via the central kernel, onto which the data objects of the data services are projected. The central kernel and data services have a common command language. Boot processes of a MetaOS node, as well as the administration of tasks, threads, memory areas and network usage of the node are managed by a separate control entity (FIG. 6 component 89). The data services of the MetaOS node take over communication with any external logical or technical services (e.g.
  • MetaOS node in the form of gateways, regulate access control to external services or provide the central kernel with its own services available (eg process controls of technical sub-areas of the technical system) (Fig. 11 component 138-140,142).
  • the data services of a MetaOS node are above that In addition, services for secure user authentication (FIG. 1 component 6), access rights (FIG. 1 component 5), network administration and user communication are available.
  • a MetaOS node can run completely on a single computer or data services can be distributed over several computers (Fig. 7,8).
  • Each data service of a MetaOS node is divided into two parts.
  • the first part of the service for example, accesses externally generated data objects and converts or encapsulates them into a format valid for MetaOS nodes or vice versa (FIG. 10).
  • the second part forms a client and / or server structure for the central kernel of the MetaOS node (FIG. 10, component 126).
  • the second part appears to the central kernel as another central kernel with which it can communicate (FIG. 10 component 125).
  • a data service provides the central kernel with, for example, simple values or files, in the most general case with complex time-variant data objects and metadata objects and / or receives them.
  • Data services and the central kernel provide data elements, which can also contain time-variant process data and multimedia files, in the form of a standardized, hierarchically organized object tree assigned to the respective proprietary individual devices (a breakdown of the interface information into simple elementary objects for the central kernel).
  • Individual information, information lists and hierarchically organized information structures from data, status, and function interfaces of the individual measuring, analysis, storage, control, operating and monitoring devices are encapsulated for this purpose by program-controlled information projection as required in the respective object trees of the assigned services.
  • Each In the most general case, elements of these object trees are additionally assigned an arbitrarily definable set of time-variant meta and a hierarchically structured tree of header data objects (FIG. 12).
  • the header objects contain decentralized timing information for synchronization, information about resources of the local location (CPU, memory, network capacities), log and error information, information about user management and authentication, security, transport, popularity and priority properties and the state of the data objects, as well as Information about the type and condition of the operating and monitoring devices as well as description information about the objects and summarized information about hierarchically lower-lying object structures etc. are synchronized.
  • object trees or their subsets with the elements of the data services are simply assigned to, or projected onto, a central, virtual, hierarchically organized object tree, the roule element of which forms the central kernel (FIG. 14).
  • this process is program-controlled with the help of filter lemens and operators.
  • This process which defines the mapping logic of the data services on the central object tree, is called "mount" in the following.
  • objects can be inserted into the virtual hierarchical object tree of the central kernel that refer to form the positions of other objects in the form of symbolic links in the virtual object tree.
  • the objects themselves store the positions of the references in the header data objects assigned to them. If the position of a target object in the virtual file tree changes, the target positions of the references are adjusted by the central kernel
  • the symbolic links refer back to the target object.
  • Time variant data that are to be read from data services or written to data services are stored in the virtual object tree by means of refresh cycles manually controlled by the user or alternatively program-controlled by a scheduler (Fig. 19 ) which gets its data from the header data objects of the object trees updated.
  • a scheduler Fig. 19
  • the object trees of several data services are merged with one another by virtue of virtual transparent "superimposition", ie by projection according to different priorities and optionally using syntactic, semantic, logical and numerical program-controlled filters and operators, ie different data objects from different data services same position in the respective local object trees in the central object tree in the elements of a directory, and different objects of the same elements in the same
  • Object tree can be merged into one element and saved.
  • the merging of objects, metadata objects and Header data objects of an element of the central kernel are made in any combination with the basic projection method from the services of the central kernel and from other central kernels.
  • the information of the header data objects of each data and metadata object of a central kernel are, for example, mounted and synchronized from different specialized data services and further central kernels into a common header object structure of the element.
  • Access to identical objects seen from the central Kemel in different data services is regulated via priorities assigned to the data services.
  • a MetaOS node From several different data services of a MetaOS node, a standardized, ordered data structure is mapped on the central kernel, which is made available in full or in part by the visualization services in the MetaOS network.
  • the procedure applies in addition to the described read operations from the data services, in the same way for write operations and execution operations of program code on the data services, taking into account any write, read and execution rights.
  • various object trees can also be synchronized using syntactic / semantic operators (e.g. using placeholders in the object names (Fig.
  • MetaOS primary network is an arbitrary combination of any number of MetaOS nodes in which the central kernel and associated data services communicate with one another directly or via other MetaOS node chains (proxy chains) (FIG. 4). Networking and communication in the primary network follow the same principles as networking and communication between data services and the central kernel.
  • each central kernel can communicate with all other central kernels in the MetaOS primary network, with simultaneous communication with several others Nodes and local data services is allowed (Fig. 3,4).
  • each MetaOS node can mount and synchronize any data objects at any location from the central kernel of every other MetaOS node (Fig. 11). In this way, data objects from external data services can be taken over or data objects of any MetaOS nodes can be easily structured and merged.
  • a primary network is formed by a logically linked hierarchical network of central kernels from an initially individual central kernel as a virtual center with further central kernels distributed object holdings is mounted, so that each central kernel of the hierarchy has access to a resulting, uniform network-wide global directory (virtual centralization), a different regional directory of logically related elements and a local directory formed from the decentralized services and elements
  • Node forms a mounting scheme with other nodes, so that each node synchronizes local data services into a local private and, if desired, a local public area directory of logically related elements, mounts and synchronizes a defined global directory of a hierarchically higher central kernel to the root element of its own central kernel and public local Range directories are mounted and synchronized to the public range directories of the parent node in the local global directory and public region all area directories of subordinate nodes are mounted to their own regional object directory.
  • MetaOS nodes A targeted manual establishment of redundant connections between MetaOS nodes is very difficult with very large networks in terms of workload, structural clarity and maintainability.
  • the possibility is integrated in every MetaOS node to "symbiose" with other nodes in the network, (cooperating groups) whose stability and speed exceed the individual nodes.
  • a “symbiosis” is a group of MetaOS nodes that form the smallest functional subset in the MetaOS network with options for central administration, authentication, user and resource management under the constraints of high performance and robustness.
  • “symbioses” do not necessarily consist of geographically neighboring groups of MetaOS nodes, but of logically related MetaOS nodes and can be arranged scattered over the MetaOS network and impress stable areas of distributed, logically related elements on the MetaOS network. The elements of resource management, performance and robustness are considered below.
  • Each central kernel of a MetaOS node from a logically connected group of further central kernels mounts and synchronizes all directories of all other central kernels in the group in a range directory defined for the entire group and thus forms a symbiosis (Fig. 28, 29).
  • a uniform view of all the data in the symbiosis is created on every node of the symbiosis. Moving data objects and directories from one node of the symbiosis to another, or copying processes remain completely transparent to the user of the symbiosis. There are no changes in the arrangement of the data objects on the area object tree of the symbiosis and there is no need to change mount points in order to access shifted data objects.
  • Individual nodes of a symbiosis can be maintained very easily in that data records are temporarily relocated to neighboring nodes during maintenance and are still available to the user in the same place.
  • the directories with the data objects available locally on the respective nodes are marked separately in the header objects in order to facilitate an overview of the original data objects on the nodes. If data objects of the symbiosis are requested from an external node or a user on an account of the symbiosis, the symbiosis node first looks in its own databases and in the cache of the central kernel.
  • the local data objects are synchronized with those of the target computer, and a copy of the data objects as well as source references and information about the expiry periods of the data objects and metadata objects are stored in the cache of the central core , Requested data records are replicated within a symbiosis, and the performance of a symbiosis regarding inquiries increases. This is especially true for frequent searches on databases. If the target computer or its data objects are temporarily not or only poorly accessible, for example due to high processor load, the other nodes of the symbiosis are requested for copies of the data records in the cache (FIG. 31).
  • a symbiosis of MetaOS nodes thus fulfills basic requirements for a distributed object directory with dynamic objects.
  • the mount and synchronization options of the individual MetaOS nodes are used to obtain the information.
  • Other nodes in the network that do not belong to the symbiosis, but which mount a node of a symbiosis (eg hierarchically higher nodes), automatically receive all other addresses of the symbiotic members. Should the mounted symbiosis node fail, another node of the symbiosis will be automatically replaced instead.
  • the described structure of a symbiosis enables a very user-friendly access to data objects of a symbiosis, with a relatively simple and clear mounting scheme, with massive use of redundancies and only local short-term additional load on the network by generating local data copies in the symbiosis.
  • the described method can be used to create robust areas in global mount hierarchies.
  • a secondary MetaOS network consists of a number of FTP and web servers that are assigned to the primary network.
  • the elements of the secondary network are unable to communicate with MetaOS nodes and other primary network elements in the language of the primary network.
  • the metadata objects of any data objects of the primary network can, however, be adjusted by means of additional data files on the FTP and web servers so that MetaOS nodes of the primary network are able to visualize data objects from the secondary network without conversion via an FTP or HTTP-capable data service. to read and write back to the secondary network.
  • secondary network elements as well as primary network elements, have their own visualization service, which is transmitted to the user via the network (see chapter »How the graphical user interfaces work «), and metadata objects on the primary and secondary network can be managed in a structurally identical manner Elements of the primary and secondary network are shown in an identical manner.
  • the data elements of the secondary network can also be independently visualized and edited due to the own user interface.
  • MetaOS networks Use of large MetaOS networks with several thousand MetaOS nodes and a large number of users from anywhere in the world Network to ensure some special properties.
  • Each node of the primary network as well as the secondary network can be the carrier of at least one of its own user interfaces.
  • This is designed as a data service and is treated by the central kernel like another central kernel, i.e. it has its own virtual object tree and communicates with the central kernel using the uniform command language.
  • the user interface is transmitted to the users when required and can represent any subsets of all local and locally mounted data objects by mounting and synchronizing data objects from the central kernel.
  • each element can save all the information it needs to display it in its header data.
  • the user interface is therefore an integral part of a MetaOS node. The user is therefore generally provided with all the data objects relevant to this node or the associated symbiosis at each node without a complex database query.
  • User interfaces only consist of a few freely definable design elements, e.g. to to visually identify different technical areas.
  • MetaOS networks can be communicated with
  • Adjacent nodes can be queried via the user interface of a MetaOS node.
  • All basic mount, synchronization and filter mechanisms of the central kernel can also be applied to the data stocks of the user interfaces.
  • the user interfaces allow the view of one or more data objects including metadata objects in various standard views and in views freely definable by the user or by header data.
  • Zoom function Selecting an object switches to the view of the corresponding sub-hierarchy " or to a default view of an object itself.
  • Meta object explorer The meta object explorer extends the object overview with the tabular view. Preview and editing of freely definable and selectable meta object groups.
  • ⁇ Object view The meta object explorer extends the object overview with the tabular view. Preview and editing of freely definable and selectable meta object groups.
  • the content of a data object is displayed without its metadata objects.
  • the object view contains the possibility of displaying data objects within a "browser".
  • a "browser” is understood to mean a functional unit which. Data at least the
  • Descriptive language HTML 3.2 or a comparable one can interpret and display language or an extended version or XML 1.0, master a script language such as Javascript 1.0, Phyton or a comparable language, master a programming language according to at least the Java 1.0 specification or a comparable language, master the display of frames and an interface comparable to the Contains Netscape LiveConnetct standards or a comparable standard, and can manage extension modules in the browser.
  • the "Object manager” view (Fig. 40) is the most important view for the efficient use of large MetaOS networks.
  • the »Object manager « view contains the
  • objects appear on the desktop that present the content of the selected object (e.g. contents of files and directories). Individual desktop objects can temporarily enlarge the entire graphic
  • a desktop object can therefore display the object overview, meta object explorer, object view and object manager views as standard views in addition to the freely defined views.
  • object overview it is possible to nest any number of object managers into each other as often as required and thus to present a graphical presentation of parts of the object trees (Fig. 43, 44).
  • Fig. 43, 44 By temporarily increasing the size, any number of object managers can be stacked on top of one another. It can be on this
  • a user interface is characterized in that a group of two- or three-dimensional, interactive components of a graphical user interface ai ..
  • a m which are located in a two- or three-dimensional area, consist again from sets br..b m ' of two- or three-dimensional interactive graphical user interfaces generated at local and decentralized locations, in which each user interface of set b contains an associated set of basic graphic elements as well as optionally a set of freely definable ones contains additional graphic elements and the design of at least one of the basic elements of each set c is such that at least one further graphical user interface of the type of sets a or b or at least one user interface of at least one
  • Elements of the set of user interfaces b can be completely mapped in a sub-area of c, and the elements of sets a and b serve as external control and monitoring interfaces of the elements of one or more data services in the distributed data processing system by synchronizing data through the interfaces from the data service , distributed and presented.
  • the opened desktop objects are automatically arranged in the desktop and can be accessed via the object bar can be temporarily minimized (as in a conventional user interface).
  • the automatic arrangement and the possibility to minimize extensive slaughtered data structures in the object bar facilitate navigation in the data objects.
  • the command language is the flexible, uniform basis for everything that happens within a MetaOS network. Based on their simple, efficient structure, communication is based on the object trees of a MetaOS central kernel with the data services in the same way as with the graphical user interfaces and, furthermore, the communication of the central kernel in the MetaOS network including the self-conf ⁇ guring configuration of symbioses and global directory trees and the communication of elements and objects.
  • any objects, elements and substructures of a central kernel with any objects, elements and substructures of other local data services, user interfaces or central kernels and with any objects, elements and structures of its own central kernel are mounted, filtered, linked with operators and synchronized and distributed and that data, metadata and header data objects of hierarchically higher as well as subordinate tree elements are mounted, synchronized and distributed by specifying relative mount marks
  • the access language, user communication and administration are also added to the command language of all services in the network.
  • the power of the command language can be explained by the fact that all elements available in the MetaOS network are mapped onto simple structurally identical object trees with objects and meta objects, which in turn have the same structure. All internal and externally connected services that are important for distributed networks can be mapped onto such object trees as a common basis and interconnected as required. This creates a uniform object environment, on the efficient manipulation and organization of which a command language can be very easily optimized in addition to a few other basic functions. All elements that cannot be directly mapped to the command language "non-essential", such as user management,
  • Knowledge management methods and special forms of communication with external services are transported (tunneled) via the meta objects assigned to the objects and are only interpreted in the specialized data services.
  • MetaOS nodes can thus be adapted to different requirements.
  • decentrally implemented users, rights and authentication strategies which are assigned to the individual elements in the object trees by mount and
  • Synchronization processes using filters in global and regional directory trees are structured and virtually centralized, making them easily accessible from any location.
  • a MetaOS node in the basic state consisting only of the central kernel and optionally the graphical user interface, has no fixed user administration and is designed as a local single-user system. Every user who logs on to a node is classified as a default user and has full access to all data available in the MetaOS node. Possible access restrictions only exist on mounted external data services whose access restrictions are passed on to the central Kemel via metadata objects. After dialing in, the only user known to a MetaOS node, the default user, can assign a password that is stored encrypted on the central kernel. After assigning a password for the default user, other users have only access to data objects from special public default directories released by the central kernel (eg a global directory and a regional directory) after logging on with any name.
  • special public default directories released by the central kernel eg a global directory and a regional directory
  • MetaOS network This also allows users who are not logged in and authenticated to navigate in MetaOS networks. If the public directory is blocked by the default user, access to the node is completely blocked for other users. Every user logged on to a MetaOS node with any name is entered by the central kernel in a constantly updated user list, which is in the object trees of the central kernel itself is saved. All user lists of a MetaOS network can be virtually centralized using a corresponding global mounting scheme and made accessible to every node.
  • the default user can integrate access management suitable for several users into the basic structure of a MetaOS node.
  • the default user administered in the central kernel takes on the task of the administrator.
  • User management is first integrated by generating one or more special data services (this method is essentially used for the network related to the primary network, hereinafter referred to as "gatekeeper") or by supplementing data objects on data services and secondary network elements with special key files
  • Gatekeeper files with meta-object entries that enable individual data and objects for specified users.
  • the gatekeeper services which manage freely definable access control lists in the form of metadata objects in your object structure and decide on access, are then mounted by the central kernel and fully synchronized with the data stocks there in the header data of the elements. It does not matter whether the central kernel mounts a gatekeeper from its own node, from administration nodes of its symbiosis or from any node in the network. Each element can be assigned its own user management. With a global mounting scheme, the user administration can then be virtually centralized.
  • a gatekeeper not only manages the user management of a single MetaOS node, but also manages access to several mounted MetaOS nodes on which no user management is installed is (indirect user management). eg special access options for ensure specified locations. Outsourcing the access management of a MetaOS node to gatekeeper services with subsequent synchronization of the administration data to the individual elements thus enables differentiated, arbitrarily simple or complex management of the access options of MetaOS nodes in a MetaOS network.
  • the user authentication process is as follows. If a user (not the default user of the central kernel) logs on to the MetaOS node, the central kernel first checks whether there is a synchronized gatekeeper service for the user in the central kernel. If this is the case, when attempting to access the data stocks, the header object entries of the respective gatekeeper are always checked first, or the key files on the data services and secondary network elements. Only objects in the central kernel that have a corresponding user ID in a gatekeeper assigned to the user or in the key files are made available to the user. The authentication takes place with the help of the metadata objects of the gatekeeper, which takes over the authentication of the user as representative for the services to be used in the central kernel and any authentication method, eg Kerberos version 5 with a central server for authentication.
  • any authentication method eg Kerberos version 5 with a central server for authentication.
  • Results of a search query are saved anywhere in the virtual object tree of the respective local central core and, depending on the type of search query, completely or in the form of subsets of the searched structural data, metadata objects and / or data objects and optionally displayed in any view available for the respective object , Search results are not only viewed as collected data objects, but are also displayed in a time-varying form after being specified in the search query and after evaluating the expiry date of the search results or by specifying refresh cycles.
  • a search query within a MetaOS node is carried out by setting one or more mount points (possibly in combination with scripts) anywhere in the central kernel, specifying various filter criteria directly in the central kernel or for different data services (for data structures, metadata objects and data objects) for central kernel and Data services, the specification of the search area (e.g. object directories, number of maximum objects of a type to be synchronized, time limits etc.) and the display requests as well as the specification of the services or central kernel to be searched. All information for the search process is assigned to an element in the central kernel (called a mount point) as metadata objects and thus becomes part of the object itself. In this way, search queries are retained in the object tree over the long term and can change Conditions can be easily adjusted and refined.
  • a complete search process is started by starting a full synchronization process (synchronizing the specified
  • Object directory including all subdirectories).
  • the data objects specified by the filter criteria are synchronized and, if necessary, displayed. Other data objects are ignored.
  • mount points for an object can be assigned in the form of a mount list or mount scripts
  • data objects searched for can be extracted from several object directories, collected in one directory and synchronized into a result directory by "stacking". Since search results are seamlessly inserted into the virtual object directory and graphically displayed as object trees using the mount and synchronization principle, searches can also be carried out successively by manually navigating in the object tree and results that are not of interest can be deleted manually from the tree.
  • Search results in the object tree can be refreshed either by manually navigating and re-synchronizing the partial search results or by completely re-synchronizing changed data.
  • the search result is further restricted by further specifying search queries.
  • Further associated data objects can be added to search results by further insertion of mount points or scripts. This can be, for example, the superordinate object directories of the data objects found or other related data from the search results (see Knowledge Management in MetaOS networks).
  • a search query in other nodes, for example in the local node assigned symbiosis or in the entire MetaOS network is carried out in the same way as in the local object directory.
  • search results are returned to the request location.
  • each data record in the data services and in the central kernel is provided with a unique search mark during the search process. If a search is repeated, only unmarked data objects are taken into account and synchronized. In the event of changes in parts of the marked data records or when expiry dates expire, the corresponding search marks are deleted. This ensures that updated areas of records are considered for repeated searches. Search results, like any other part of the central object tree of a MetaOS node, can in turn be fully or partially mounted by other nodes in the network and distributed in this way (e.g.
  • MetaOS networks largely corresponds to the process of searching for information.
  • the difference is that found elements from all services assigned to the central kernel as well as devices assigned to the global and regional directory in the MetaOS network are not synchronized with the local central kernel, but are described with user-defined data (Fig. 25).
  • Fig. 25 user-defined data
  • any actions can be carried out (for example, writing mount scripts in an external central kernel) and any control processes can be implemented through program-related synchronization and distribution of information.
  • search long-term, cyclically repeating program-controlled distribution processes are also possible.
  • information search and distribution in a mount point can be used together (eg within mount scripts). For example, a larger number of distributed machine components can be activated with the aid of a programmed distribution process, and the result of the activation can then be verified by a search process. In this way, users can be granted defined control options via machine components in the entire network via the global object tree or in defined areas (regional object tree) of the MetaOS network using the search and distribution processes.
  • the basic mechanisms of mounting, synchronizing, distributing, filtering and projecting dynamic data objects, metadata objects and header data object structures in MetaOS nodes with the help of scripts on a virtual global object tree enable the support of various forms of communication distributed over the network in addition to the mechanisms described so far in any powerful form.
  • Means of communication can be distributed over a MetaOS network and used from anywhere in the network.
  • Static news groups can be mounted, for example, in the form of a data service in the object structure of each MetaOS node (for example, in the form of hierarchical object structures as well as a metadata element for news texts and information type). The same rules apply to news groups as to all other objects in the object trees.
  • Decentralized newsgroups can be fully or partially mounted and synchronized by other nodes in the network, equipped with user administration and authentication procedures, centrally managed in the form of virtually centralized object directories and used anywhere in the network.
  • a news network can be set up so that an administrator can set up, manage and monitor all news groups in a network, while on-site technical service staff can only see and edit small sections of the entire news network at specified points in the network, which the administrator can access local MetaOS node was mounted. Since the news system is fully integrated into the object list, the general options for information search and distribution also apply to the news groups.
  • news groups can be attached to directories and files and any other objects.
  • directories and files attached to news groups can be viewed in a news system, for example as (if necessary dynamic) attachments, which can significantly improve the quality of a news discussion.
  • Hierarchically arranged and provided with user administration dynamic chats, instant messaging services, as well as technical coordination processes of technical plant groups can be integrated in MetaOS nodes and made available in defined areas of the network or globally.
  • the main difference to a new system is that information in such services has to be refreshed in a cyclically fast sequence.
  • the physically decentralized system is combined to form a logical, virtual, global unit, which can be used in a unified manner from each decentralized location by means of a user interface that can be constructed from various decentralized components.
  • the system enables secure, standardized control and management of large quantities of globally distributed automation systems (e.g. distributed wind farms, mobile radio networks, electricity networks, pipeline networks, building automation, management of technical city infrastructures etc.) and is also suitable for efficient and elegant management due to its low complexity and simplicity a big one
  • the invention forms a unifying structuring framework for object transfers and object caching with universal application options for successive location-independent bundling and structuring of various data services, documents and applications and forms of communication for distributed and concentrated technical devices within a single modular information structure on the Internet. All services going beyond the basic functionality, including important system services, are included in decentralized data services are therefore flexibly adaptable to different network requirements, can also be virtually centralized and can be used completely transparently throughout the network.
  • MetaOS nodes Only a single protocol is used for communication within MetaOS nodes, in the MetaOS network (primary and secondary network) with its various services, in symbioses and for structuring directory services. Any network configurations can be created very easily.
  • Communication options and the mapping to a common data structure maximize the number of possible degrees of freedom for optimal adaptation to the real device and minimize the complexity of the overall device.
  • the complexity of the overall device adapts to the complexity of the technical devices.
  • Each MetaOS node in the network can, if necessary, fulfill all tasks in the network and make services available to external nodes.
  • the search functions and information distribution functions are special forms of the basic functions of a MetaOS network
  • the search results are completely transparently integrated into a MetaOS network and you can navigate and work in them just like in normal object trees.
  • Almost any communication requirements such as news services, chats, instant messaging services etc. can be made possible with the basic mechanisms of a Meta-OS network at any point in the network and can be equipped with any user rights and authentication.
  • Any objects in an object tree can be attached to one another as required and their functions can complement one another.
  • Virtual generated models and devices of complex distributed technical process and organizational structures are simply successively formed by the step-by-step networking / coverage of MetaOS objects or sub-objects, since model data can be stored and updated decentrally (if necessary, but also centrally) (in contrast for publication DE 19834456A).
  • the organization of the sub-models (a networked group of MetaOS nodes) to superordinate models (e.g. the entire MetaOS network) is based on the widely distributed interaction (mounting and synchronization) of the many components of the model.
  • Central virtual models can be derived from the decentralized model by searching and collecting the model data if necessary.
  • a central model can be distributed across a MetaOS network.
  • MetaOS object model can be operated independently of one another on different process and master computers.
  • Several MetaOS nodes can be used on one hardware. It is possible to add MetaOS nodes and services for technical and organizational processes dynamically to a model (in contrast to the publication DE 19834456A).
  • MetaOS networks are based on long-known internet technologies and can therefore be used universally.
  • the invention is due to the decentralized essentially self-sufficient and equal structures and the distribution of information on the one hand via MetaOS proxy chains and on the other hand the possibility of direct access very robust against disruptions in individual process and control computers (in contrast to the publication DE 19834456A).
  • Metadata objects of any complexity assigned to the process model elements enable optimized management, organization and distribution of a large number of different distributed services in the MetaOS network. From simple yet not optimal organizational principles, improved principles can gradually crystallize and stabilize (addition and change of the mount lists over longer periods).
  • the user interface can be used independently of operating system-specific window managers on various operating systems and enables simultaneous work with MetaOS nodes from different parts of the network.
  • each MetaOS node has its own user interface, any part of the network can be accessed regardless of the networking of the MetaOS nodes.
  • MetaOS nodes The combination of the basic properties of MetaOS nodes, the meta-object concept and the graphical user interface to form an integrated overall concept enables a significantly improved cross-platform work with distributed complex technical process structures and extends technical models to include the organizational cooperation of operators, service personnel, controllers, etc.
  • the distributed data structure and the replication of data records ensures an improved distribution of the data transfer on the network and reduces the data traffic to a necessary minimum. Models can therefore be operated on very weak networks and are always up-to-date even at a decentralized location.
  • MetaOS network The distribution of frequently requested information in the entire network, over several MetaOS nodes with similar information (regarding syntax / semantics and metadata objects) in network areas with high demand increases the performance of the MetaOS network.
  • the decentralized data model can easily be changed from any decentralized location.
  • the structure of the overall virtual model can change dynamically in a decentralized manner without the intervention of a central administrator.
  • Various decentralized virtual devices can be seamlessly combined and combined to form overall structures.
  • Sub-models still work if a higher-level administration fails, and data copies can still be accessed if their source has failed.
  • each computer part can hold a part of the model, there is a very close interlocking of the model with reality, and the virtual model is highly up-to-date. Since each computer node holds the part of the virtual model that the computer controls and monitors in reality, the component model and the entire history of a component model (values, status, documents, statistics, etc.) are retained when a component is repaired or exchanged with computer systems. A machine passport accompanying the runtime can thus be created from each real sub-device.
  • the level of complexity in navigation is reduced by using only a few basic graphic structural elements.
  • Individual nodes which regulate a technical system, for example, can access all current process information of the entire network for local process control
  • the meta-object principle enables the search for special information to form current structured information topologies of any data records.
  • the networkable Kemel cluster allows in combination with the virtual ones
  • Information objects a common decentralized process and information management of any technical data objects and Documents on the real device. This happens within a single, platform-independent structure.
  • MetaOS nodes Due to the multi-core approach in the form of data services and the use of the existing system services for process control, MetaOS nodes are flexible, compact, fast, robust and economical. The required development work and the computing load by MetaOS nodes is very low.
  • MetaOS nodes enable parallel acquisition and distribution of various data services in the form of multifunction gateways.
  • the way it functions as a gateway enables resource and computing power-saving implementation of complex service objects, since existing data services can be used predominantly. This leads to a very simple overall system with little complexity.
  • Object trees can be used to protect existing software investments.
  • a common command language for the communication of all object services allows any Loka-I and remote linking of all objects and can be mapped directly or indirectly to many other protocols (e.g. HTTP, FTP, Telnet, Mail, TCP / IP direct etc.).
  • HTTP HyperText Transfer Protocol
  • Telnet Telnet
  • Mail Telnet
  • TCP Transmission Control Protocol
  • MetaOS node Individual components of a MetaOS node can be easily adapted and expanded.
  • Distributed services eg administration services
  • Distributed services in the network can be grouped into hierarchical groups and act as a directory service.
  • Missing object properties of an information object on a MetaOS node are automatically searched for in other mounted objects. Object properties can thus be distributed over several objects and, if necessary, put together like a puzzle. In this way, data objects can largely be left on the sources.
  • MetaOS nodes When searching in MetaOS nodes, not only addresses can be returned, but completely decentralized applications and databases can be immediately synchronized and started as a response. The way data records are displayed can be defined locally.
  • Services can be distributed across multiple computers.
  • the outsourcing of access authorization and authentication Data services enable access-dependent user management and authentication in MetaOS networks. Any user management and authentication modules can be used in different network areas.
  • Nodes with administrative functions can be operated in secure locations and still be fully integrated in the MetaOS network.
  • symbioses increases the conductivity of node groups with regard to computing load and data transfers through load balancing and the robustness of MetaOS subnets, since each node can act as a server for all data objects of the symbiosis.
  • Each node in the symbiosis holds the same object tree, consisting of all data objects in the symbiosis.
  • Symbiosis enable the user to move data objects transparently to the symbiosis nodes.
  • MetaOS nodes combine the advantages of pure Java clients, with the possibilities of browser plugins and ActiveX X components, freely definable HTML and XML masks, existing Java and web applications and allow the real ones for each group and component Device an optimal representation.
  • the performance of the user interfaces automatically increases with the performance of the imaging technologies used in the browser components.
  • the visualization service that generates the graphical user interfaces is itself part of the MetaOS node and all work tools, i.e.
  • the visualization service itself and all other required components can be fetched directly from the Internet from the object tree of the MetaOS node, which results in a greatly simplified application and administration of the overall system.
  • the use of special, permanently installed clients is also possible.
  • GUI Due to the reusability of most GUI components, the possibility of nesting the partial views that can be represented from different aspects (the elements of the virtual database) enables the creation of low-resource user interfaces that are very efficient even on weak network connections.
  • the basic elements of the GUI are e.g. Also usable on mobile networks, as a user interface for thin clients in low-performance public networks and for applications under difficult conditions in which heat development in the computer systems plays a role.
  • each information object can be displayed in addition to many other display and editing functions in the form of its own window manager with desktop, taskbar and windows, but also as a complete, independent browser, the GUI combines the advantages of classic window managers with modern browser technologies.
  • the dynamic nesting technique used which arranges components of the interaction objects in the different hierarchy levels along the different directions of the display area, manages relationships and hierarchies of data elements of the real device and of external information components with one another much better than completely freely movable window techniques. In addition, it is easier for the user to keep an overview of the real and virtual devices.
  • Data objects in the virtual device and data records embedded therein can be selectively processed in the browser using freely definable graphic control elements.
  • An alternative text or graphic-based navigation in the hierarchical elements of the virtual information systems dynamically forms order groups during navigation, forms global and local temporal navigation sequences for all elements and thus significantly facilitates navigation compared to other techniques.
  • Cross-platform office packages e.g. Star-Office 5.x
  • Star-Office 5.x offer the possibility of extended data type visualization and simultaneous further processing by integrated office and groupware components on a variety of operating systems.
  • technical data objects can be inserted very easily into business-relevant documents. This method also saves switching between applications and saves a great deal of time when it comes to gathering and processing information.
  • the visualization service makes it easy to query, edit and search for and restructure data objects on web and FTP servers.
  • the secondary network is ideally suited for the integration of small technical modules into the overall network. It allows the client-side networking of highly organized small-scale applications of a technical, commercial and documentary nature with other secondary networks (e.g. based on FTP services and web servers) as well as the optically seamless client-side integration into the primary network in a comprehensive organizational principle with minimal use of resources (running on the server side only the FTP or the web server).
  • substructures of web. or FTP servers can be virtually superimposed by internal mounting and in this way data objects with different properties can be formed.
  • the FTP or web servers serve as outsourced decentralized databases (the contents of which can of course also contain dynamic process values), the meta object sets of which can be queried cyclically from the primary network.
  • the secondary network enables the controlled dynamic expansion of the entire database with the simplest Systematic means. Technical and economic difficulties in the installation and maintenance of classic databases are eliminated.
  • the server systems are hardly loaded due to the predominant use of the client's computing capacity.
  • All central kernels can communicate bidirectionally with all central kernels in the network, with several connections being held simultaneously.
  • Drawing 5 Allocation of spatially or thematically related data services to central structures of technical devices
  • WKA 1 central kernel WKA 1 86 Spatially and / or logically related services for WKA 1
  • FIG. 7 Distributed MetaOS node of logically related data
  • Control system 1 Control system 2 with OPC server 104
  • OPC service 105 Measuring system with IEEE 488 interface 106
  • NFS server 107 Control system 1
  • Drawing 8 Distributed MetaOS node of logically related data using the example of a wind turbine 108 wind turbine
  • Type-converted object tree area 126 Proprietary interface area
  • Data service 4 can synchronize the entire tree of the central kernel
  • Drawing 13 Structure of a data object or metadata object
  • Drawing 14 Layering of information of a data element on the central kernel
  • meta objects from data service 3 157 meta objects from data service 3 158 objects and meta objects from data service 2
  • Meta objects of different hierarchy levels and the optional link at the destination are Meta objects of different hierarchy levels and the optional link at the destination.
  • Drawing 17 Use of the synchronization for the analysis (feeding) of data.
  • Drawing 18 Auto configuration through synchronization of information from hierarchically higher central kernels
  • Drawing 19 Schedulinq of data and metadata objects (synchronization) in the central kernel 195 Element 1 with timing information
  • Scheduler initiates the synchronization of objects based on timing information
  • timing information designed as a data object
  • Drawing 20 Synchronization example of data services with priority-controlled overlay of data stocks on a graphical quantity scheme.
  • Sub-database 1 data service 3 Sub-database 2 data service 3
  • Figure 22 Property stratification (mounting) (meta objects and header objects) in the central kernel
  • Drawing 23 Example for the use of operators during the projection layering of syntactically similar element trees.
  • Figure 24 Access to objects in the MetaOS node Access to element Karl, property y2. Element is cached in the central kernel
  • Drawing 25 Mirroring and distribution of data objects Writing the property x to elements Artist in various data services
  • Drawing 28 Formation of a symbiosis (additive layering) node 2 and node 3 mount directories corresponding to node 1
  • Root central kernel WKA 2 320 Root central kernel WKA 3
  • Secondary network node eg Http or FTP server
  • User interface secondary network 354
  • Symiink secondary network starts user interface secondary network
  • FIG. 33 Coupling data stocks secondary network in primary network central kernel 355 OPC service
  • secondary network service 360 secondary network nodes e.g. web or FTP server
  • Drawing 34 Visualization via a data service (e.g. as a Java client)
  • a data service e.g. as a Java client
  • Figure 36 Object tree explorer 378 Explorer basic operating bar
  • Figure 37 Object tree explorer with metadata objects
  • Drawing 38 predefined object view (symbol view)
  • Drawing 40 Object view Object Manager 392 Explorer basic control bar 393 Object 1 (visible)
  • Drawing 45 decoupling a subset of the virtual MetaOS node file tree
  • Figure 46 Graphical separation of the central kernel in the partial data of the data services
  • Drawing 48 Object manager in three-dimensional space
  • Drawing 49 Object manager in three-dimensional representation
  • Drawing 50 A number of abstracted object managers in three-dimensional representation
  • Drawing 51 Three-dimensional object manager with wind power attachments
  • Drawing 53 Mounting scheme for a decentralized globally uniform object tree
  • Top hierarchy consisting of a symbiosis of three nodes 505 nodes with static data 506 hierarchy level 1
  • Hierarchy 3 consists of a symbiosis of two nodes
  • top hierarchies can be simulated after synchronization of lower hierarchies and do not necessarily have to exist
  • Drawing 54 Example of a logical link with wind turbines and solar modules
  • 554 known global environment for all nodes including nodes 1 and 2 (virtual center).
  • MetaOS node A collection of spatially or thematically related services, called a MetaOS node (Fig. 1), is held together by a compact central kernel with an integrated command processor, which defines the communication within a node, structures and organizes the services centrally, caches object data and a rudimentary one Provides access control (Fig. 6). All communication of the services is coordinated via the central kernel.
  • All central kernels can communicate bidirectionally with all central kernels in the network, with several connections being held simultaneously (FIG. 3).
  • MetaOS node Services of the MetaOS node run on different, decentralized underlying physical or logical machines, for example on a QNX real-time computer, a Linux computer and a Java virtual machine (FIG. 7).
  • FIG. 8 shows an example of a distributed MetaOS node using the example of a wind turbine.
  • FIG. 5 shows an assignment example of data services to central kernels in wind power plants
  • MetaOS node In contrast to classic microkernel-based kemel clusters of operating systems, which only have to provide resources for their own hardware in the form of interfaces, a MetaOS node also ensures the provision of more organized logical resources of their own and third-party hardware and operating systems. A service of a Meta-OS object therefore does not differentiate between hardware and software resources (Fig. 9).
  • NFS Network file systems
  • WebNFS WebNFS
  • Samba Samba etc.
  • Directory protocols and network services Jini, LDAP
  • Each service of a MetaOS node is divided into two parts. Part of the service accesses data objects and services located outside of MetaOS nodes (or forms a server for external clients), the other part forms a server structure for the central kernel. In the simplest case this is a simple value, in the most general case dynamically changing object structures (FIG. 10).
  • the various data services of a node are attached (mounted) at any point to a virtual hierarchical object structure (element / cluster tree) of the central kernel.
  • the structure of the mounted services looks exactly like the own virtual object tree (Fig. 11).
  • a wide variety of data structures are combined into one Structure integrated on the central kernel (Fig. 2)
  • Fig. 21 illustrates the attachment of data services in the central kernel of a wind turbine. Multiple central kernels will continue to be in a forest of all
  • Object trees can also be mounted using "syntactic / semantic logic" or other logical object folders, so that syntactically / semantically similar object folders are each merged into a single object folder (FIG. 23).
  • Object trees can also be synchronized by relative mount specifications across one or more hierarchies (Fig. 16). 17 illustrates the possible uses when analyzing data.
  • configuration data from individual central kernels can also be passed on across several hierarchy levels, thus configuring additional nodes. If configuration data is available in several nodes, this is aggregated by the projection mechanism.
  • the synchronization sequences of the elements and data objects in the central kernel are determined by a scheduler in the central kernel, which works with the timing information from the headers. (Fig. 19)
  • Each data set represents a (sub) data tree of the data services
  • One or more databases can be attached to each MetaOS node that store data objects from other object services or write data objects to data services.
  • the central kernel When writing to an element of a central kernel, the central kernel also tries to write to all other mounted elements (FIG. 29).
  • Node 4 also receives node addresses and further information from the metadata of nodes 1 and 3 as loose mount nodes to improve structural stability.
  • a MetaOS node communicates with a user via visualization services.
  • Visualization services are themselves components of MetaOS nodes and communicate with the command processor like the other nodes of the object.
  • a MetaOS node can manage several visualization services on different machines. Each visualization service can generate several user interfaces.
  • Meta-OS nodes with different visualization services on one on one node operation via Telnet, FTP or IMAP mail client (Fig. 34) (361-365).
  • Meta-OS node with a visualization service and web server on two machines. It is operated via a web browser and pagereload. The computing power of the client is not used.
  • the visualization service is provided with its own window manager that is scalable in terms of performance, the graphic resources of which are provided by the web browser (FIG. 35).
  • Embodiment 3 In order to increase the speed of the user interface, a Meta-OS node can be mapped with a modular visualization service as a JavaApplet / JavaBean / ActiveX component, for example in a web browser.
  • the user interface is generated entirely on the client side and implemented in the web browser by HTML / XML elements (Fig. 34 366-368).
  • Fig. 44 shows wind turbines e) decoupling subsets d1) decoupling subsets while maintaining the reference point (2 * object manager one nested) (Fig. 45)
  • mapping of a four-dimensional structure onto a 3-dimensional space results in groups of different structures. If you consider e.g. navigation through the virtual information object (time) as a fourth dimension, one step back from every open window can change larger three-dimensional structural representations (e.g. closing entire subtrees in three-dimensional space).
  • the corresponding visualization service is automatically sent to the client with the required resources.
  • the visualization service also contains a structure description of a scalable browser manager and a browser in the browser.
  • the minimum requirements for the visualization service in example 3 are for the programming language Java Javal .0 / Live Connect / Javascript 1.0 / HTML 3.2 with frame extensions, (important for mobile devices). Since the visualization service only transmits minimal graphic structures, it is very compact and can be transported quickly via cables. By default, nodes are linked in a logical tree shape to form a basic structure (Fig. 52)
  • the detailed linking logic shows the hierarchical mounting diagram in FIG. 53 for the construction of a decentralized, globally uniform object tree, whereby individual nodes can themselves represent symbioses.
  • the mounting scheme creates a uniform global data tree in each node, as well as a regional data area, starting with the local data stocks in which the local data stocks are synchronized with the local data stocks of the lower hierarchies. After the synchronization, higher hierarchy levels can be simulated by lower hierarchy levels and do not have to exist in real life, i.e. They can fail temporarily without endangering the structure of the network.
  • Fig. 54 shows an example game application of the network with decentralized energy systems, in which the virtual center manages the structural data for the network, the uppermost hierarchy the rough structure of the entire network, and structural data supplementing the lower hierarchies.
  • the lower hierarchies synchronize the structural data of the higher hierarchies and combine them with the local structural data
  • Fig. 55 illustrates the basic knowledge of each individual node about the entire network after entering the network and the learning process via the network by navigation.
  • the node When entering the network, the node first learns the structure of the local environment and the structure of the virtual center through synchronization processes. Due to the overlapping of the synchronized, known environments, individual nodes can fail without the basic structure of the network being impaired.
  • Fig. 56 illustrates the simultaneous bidirectional Communication options of a node with the known environment
  • Figure 57 illustrates the distribution of indexes across the network and describes how changes in the network are propagated across the network.
  • changes in the object trees are reported event-oriented, hierarchically lower levels independently ask for changes in higher hierarchy levels by fetching change flags through relative synchronization.

Landscapes

  • Engineering & Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Automation & Control Theory (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

L'invention concerne un dispositif servant à la surveillance, la commande et la régulation intégrées de déroulements de procédés techniques complexes. Le dispositif selon l'invention comprend au moins un noyau central pourvu d'un contrôle d'accès intégré, d'un contrôle distinct pour la gestion de tâches, unités d'exécution, mémoires, capacités de réseau, ainsi qu'une gestion arborescente d'objets à structure hiérarchique pourvue de fonctions pour la collecte et la répartition manuelles ou commandées par programme d'éléments de données, la gestion et la communication de services et de noyaux centraux, accompagnés des structures de données correspondantes.
PCT/EP2001/009842 2000-08-28 2001-08-27 Dispositif et procede pour la surveillance, la commande et la regulation integrees de deroulements de procedes techniques complexes WO2002019044A2 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP01967297A EP1314070A2 (fr) 2000-08-28 2001-08-27 Dispositif et procede pour la surveillance, la commande et la regulation integrees de deroulements de procedes techniques complexes

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE10042180.6 2000-08-28
DE10042180 2000-08-28

Publications (2)

Publication Number Publication Date
WO2002019044A2 true WO2002019044A2 (fr) 2002-03-07
WO2002019044A3 WO2002019044A3 (fr) 2002-05-16

Family

ID=7654029

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2001/009842 WO2002019044A2 (fr) 2000-08-28 2001-08-27 Dispositif et procede pour la surveillance, la commande et la regulation integrees de deroulements de procedes techniques complexes

Country Status (2)

Country Link
EP (1) EP1314070A2 (fr)
WO (1) WO2002019044A2 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE102006055948B4 (de) * 2006-11-24 2011-11-24 Continental Automotive Gmbh Verfahren zum Abarbeiten von Programmanweisungen
AT510888A1 (de) * 2011-01-05 2012-07-15 Progress Maschinen & Automation Ag Produktionsanlage mit zeitindexierter historischer anzeige
CN111753743A (zh) * 2020-06-28 2020-10-09 武汉虹信技术服务有限责任公司 一种基于网闸的人脸识别方法及系统
WO2023220931A1 (fr) * 2022-05-17 2023-11-23 Applied Materials, Inc. Analyse de procédures de traitement cyclique à cycles multiples

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5453933A (en) * 1993-09-08 1995-09-26 Hurco Companies, Inc. CNC control system
DE19513230A1 (de) * 1995-04-07 1996-10-10 Siemens Ag Programmiergerät
WO1998015877A1 (fr) * 1996-10-07 1998-04-16 Honeywell Inc. Module universel de station operatrice pour systeme de commande de processus reparti
DE19741959A1 (de) * 1997-09-23 1999-04-01 Siemens Ag System zur Verarbeitung von Ereignissen in technischen Prozessen mit einem verteilten Datenverarbeitungssystem
US5978578A (en) * 1997-01-30 1999-11-02 Azarya; Arnon Openbus system for control automation networks
DE19834456A1 (de) * 1998-07-30 2000-02-03 Siemens Ag Informations-, Bedien- und/oder Beobachtungssystem mit modellbasierter Benutzeroberfläche und Verfahren zum modellbasierten Bedienen und/oder Beobachten

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5453933A (en) * 1993-09-08 1995-09-26 Hurco Companies, Inc. CNC control system
DE19513230A1 (de) * 1995-04-07 1996-10-10 Siemens Ag Programmiergerät
WO1998015877A1 (fr) * 1996-10-07 1998-04-16 Honeywell Inc. Module universel de station operatrice pour systeme de commande de processus reparti
US5978578A (en) * 1997-01-30 1999-11-02 Azarya; Arnon Openbus system for control automation networks
DE19741959A1 (de) * 1997-09-23 1999-04-01 Siemens Ag System zur Verarbeitung von Ereignissen in technischen Prozessen mit einem verteilten Datenverarbeitungssystem
DE19834456A1 (de) * 1998-07-30 2000-02-03 Siemens Ag Informations-, Bedien- und/oder Beobachtungssystem mit modellbasierter Benutzeroberfläche und Verfahren zum modellbasierten Bedienen und/oder Beobachten

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE102006055948B4 (de) * 2006-11-24 2011-11-24 Continental Automotive Gmbh Verfahren zum Abarbeiten von Programmanweisungen
AT510888A1 (de) * 2011-01-05 2012-07-15 Progress Maschinen & Automation Ag Produktionsanlage mit zeitindexierter historischer anzeige
US9383747B2 (en) 2011-01-05 2016-07-05 Progress Maschinen & Automation Ag Production installation with time-indexed historical display
CN111753743A (zh) * 2020-06-28 2020-10-09 武汉虹信技术服务有限责任公司 一种基于网闸的人脸识别方法及系统
WO2023220931A1 (fr) * 2022-05-17 2023-11-23 Applied Materials, Inc. Analyse de procédures de traitement cyclique à cycles multiples

Also Published As

Publication number Publication date
WO2002019044A3 (fr) 2002-05-16
EP1314070A2 (fr) 2003-05-28

Similar Documents

Publication Publication Date Title
DE69819211T2 (de) Verteilte interfacearchitektur einer programmierbaren industriellen steuerung
EP1258812B1 (fr) Base de données virtuelle de structures de données hétérogènes
DE60317925T2 (de) Steuerung von netzwerkverkehr in einer peer-to-peer umgebung
DE10049503B4 (de) Zugriff und Aktualisierung einer Konfigiurationsdatenbank von verteilten Physischen Orten innerhalb eines Prozessteuersystems
DE602004010872T9 (de) Systeme und Verfahren zur Dateisicherung
DE10049569B4 (de) Zugriff und Aktualisierung einer Konfigurationsdatenbank von verteilten physischen Orten innerhalb eines Prozeßsteuerungssystems
DE60127795T2 (de) System und Verfahren zur Metrik- und Statusdarstellung
DE60224849T2 (de) Verfahren und einrichtung zur verwaltung des baumdatenaustauschs
DE602005001883T2 (de) Überlagerte Daten, Selbstorganisierte überlagerte Metadaten, und Mehrfachsendung auf Anwendungsebene
DE68928433T2 (de) Verwaltungssystem für verbundene einheiten in einem verteilten rechnersystem
DE69911681T2 (de) Verfahren zum Verfolgen von Konfigurationsänderungen in Netzwerken von Rechnersystemen durch historische Überwachung des Konfigurationsstatus der Vorrichtungen im Netzwerk
DE69936818T2 (de) Protokoll zum Austausch von Konfigurationsdaten in einem Computernetzwerk
DE69126666T2 (de) Netzwerkverwaltungssystem mit modellbasierter intelligenz
EP1560094A1 (fr) Mise à disposition de services dans un réseau de calculateurs
DE69215976T2 (de) Verfahren und Gerät für Netzrechnersystemgruppenverwaltung
DE112018004345T5 (de) Gebäudemanagementsystem mit datenaufnahme in intelligente entitäten und schnittstelle von intelligenten entitäten mit unternehmensanwendungen
EP2081415A1 (fr) Installation d'éclairage d'urgence commandée par microcontrôleur et procédé de communication approprié
WO2020200877A1 (fr) Génération et distribution de structures de données de configuration pour des systèmes de commande
EP1442340B1 (fr) Chargement de donnees dans un systeme d'automatisation
EP1653308B1 (fr) Procédé et dispositif pour enregistrer et mettre à disposition des informations
WO2002067141A2 (fr) Systeme et procede pour generer et memoriser des pages web tout en optimisant l'encombrement en memoire
WO2002019044A2 (fr) Dispositif et procede pour la surveillance, la commande et la regulation integrees de deroulements de procedes techniques complexes
DE19813883B4 (de) Verfahren, Computerprogrammprodukt und Dokumentenmanagementsystem zum Zugriff auf Internet-Informationen für geschlossene Benutzergruppen
DE19943453A1 (de) System und Verfahren zur Unterstützung der Gruppeninteraktion (GIA) in hypermedialen Informationsräumen
DE112010004086T5 (de) System, Programm und Verfahren zum Bilden von Konfigurationsinformationen über Komponenten von Systemen, die Komponenten enthalten, die für das Erfassen von Konfigurationsinformationen eingeschränkt ist

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): CA CN JP RU US

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR

121 Ep: the epo has been informed by wipo that ep was designated in this application
AK Designated states

Kind code of ref document: A3

Designated state(s): CA CN JP RU US

AL Designated countries for regional patents

Kind code of ref document: A3

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
WWE Wipo information: entry into national phase

Ref document number: 2001967297

Country of ref document: EP

WWP Wipo information: published in national office

Ref document number: 2001967297

Country of ref document: EP

NENP Non-entry into the national phase

Ref country code: JP

WWW Wipo information: withdrawn in national office

Ref document number: 2001967297

Country of ref document: EP