Great research starts with great data.

Learn More
More >
Patent Analysis of

METHOD FOR AUTOMATICALLY PROCESSING A NUMBER OF LOG FILES OF AN AUTOMATION SYSTEM

Updated Time 15 March 2019

Patent Registration Data

Publication Number

US20170017693A1

Application Number

US15/301640

Application Date

24 March 2015

Publication Date

19 January 2017

Current Assignee

SIEMENS AKTIENGESELLSCHAFT

Original Assignee (Applicant)

SIEMENS AKTIENGESELLSCHAFT

International Classification

G06F17/30,G05B19/418

Cooperative Classification

G06F17/30501,G06F17/30144,G05B2219/31151,G05B19/41855,G05B2219/31368

Inventor

STORL, ALEXANDER,PAUER, STEFFEN,ROSHCHIN, MIKHAIL

Patent Images

This patent contains figures and images illustrating the invention and its embodiment.

METHOD FOR AUTOMATICALLY PROCESSING A NUMBER OF LOG FILES OF AN AUTOMATION SYSTEM METHOD FOR AUTOMATICALLY PROCESSING A NUMBER OF LOG FILES OF AN AUTOMATION SYSTEM METHOD FOR AUTOMATICALLY PROCESSING A NUMBER OF LOG FILES OF AN AUTOMATION SYSTEM
See all 3 images

Abstract

A method for automatically processing log files of different types of an automation system, said method determining a message part of a data set of the log file. All contents of the respective data sets of the log files are concatenated. The data sets of all the log files are summarized in a summary file. The data sets of all the log files are chronologically sorted in the summary file. The data sets are compressed in the summary file. The compressed data sets in the summary file are coded. The compressed data sets are assigned to groups with associated group codes. The group code of the assigned group is decoded. The decoded group code is output as the alphanumeric message part of the log file. The alphanumeric message part of the log file is stored in a memory.

Read more

Claims

1.-15. (canceled)

16. A method for automatically processing log files of different types of an automation system of a technical facility, said method comprising: concatenating all contents of a data set of a log file; summarizing data sets of all log files in a summary file; chronologically sorting the data sets of the log files in the summary file; compressing the data sets in the summary file; coding the compressed data sets in the summary file by a numeric, alphabetic or alphanumeric code; sorting and assigning the compressed data sets established on the basis of the numeric, alphabetic or alphanumeric code to groups with associated group codes; decoding the group code of the assigned one of the groups; outputting the decoded group code as an alphanumeric message part of the log file; and storing the alphanumeric message part of the log file in a memory.

17. The method of claim 16, wherein during compression of the data set, the data set is processed such that a data length and/or a data content of the data set is reduced.

18. The method of claim 17, further comprising automatically inserting spaces for special characters contained in the data set and for at least two or more consecutive spaces resulting therefrom, removing consecutive spaces extending beyond a single space from the data set.

19. The method of claim 16, further comprising resolving the concatenation of the contents of the data set and removing resultant separate alphanumeric contents with fewer than four characters.

20. The method of claim 19, further comprising analyzing and unifying the resultant separate alphanumeric contents, assigning a reference word to each of the separate alphanumeric content and assigning a numeric code to each reference word.

21. The method of claim 20, further comprising converting the summary file with the separate alphanumeric contents established on the basis of the reference word and/or the numeric code into a two-dimensional alphanumeric code matrix.

22. The method of claim 21, wherein the numeric codes of the two-dimensional alphanumeric code matrix are sorted chronologically and/or as a function of character length.

23. The method of claim 21, wherein similar ones of the numeric codes of the two-dimensional alphanumeric code matrix are grouped by using a similarity operation.

24. The method of claim 23, wherein the similarity operation is a Levenshtein distance.

25. The method of claim 24, wherein when the numeric code being considered has a Levenshtein distance of zero to one of the groups, said numeric code being considered is assigned to said one of the groups.

26. The method of claim 24, wherein when the numeric code being considered has a Levenshtein distance of one to one of the groups, and when the numeric code being considered differs by only one digit from the one of the groups, said numeric code being considered is assigned to said one of the groups.

27. The method of claim 24, wherein a new numeric code being considered is compared to non-grouped numeric codes of a same length or to non-grouped numeric codes having a greater length of a maximum of one character.

28. The method of claim 27, wherein when the numeric code being considered has a Levenshtein distance of one to another non-grouped numeric code, a new group is formed from the numeric code being considered and the non-grouped numeric code such that when the numeric code being considered and the non-grouped numeric code are of different lengths, the new group is assigned a shorter numeric code, and when the numeric code being considered and the non-grouped numeric code are of same length with at least one different digit, the new group is assigned the numeric code without the different digit.

29. The method of claim 24, wherein when the numeric code being considered is determined to have no Levenshtein distance to any other non-grouped numeric code that are less than two, the numeric code being considered is assigned to a new group.

30. A technical facility, comprising an automation system including log files of different types, said automation system configured to: concatenate all contents of a data set of a log file; summarize data sets of all log files in a summary file; chronologically sort the data sets of the log files in the summary file; compress the data sets in the summary file; code the compressed data sets in the summary file by a numeric, alphabetic or alphanumeric code; sort and assign the compressed data sets established on the basis of the numeric, alphabetic or alphanumeric code to groups with associated group codes; decode the group code of the assigned one of the groups; output the decoded group code as an alphanumeric message part of the log file; and store the alphanumeric message part of the log file in a memory.

31. An automation system of a technical facility, comprising: an operation and monitoring level; an automation level; a field level; and a communication system configured to connect the operation and monitoring level, the automation level and the field level to one another, at least one of the operation and monitoring level, the automation level and the field level being configured to: concatenate all contents of a data set of a log file; summarize data sets of all log files in a summary file; chronologically sort the data sets of the log files in the summary file; compress the data sets in the summary file; code the compressed data sets in the summary file by a numeric, alphabetic or alphanumeric code; sort and assign the compressed data sets established on the basis of the numeric, alphabetic or alphanumeric code to groups with associated group codes; decode the group code of the assigned one of the groups; output the decoded group code as an alphanumeric message part of the log file; and store the alphanumeric message part of the log file in a memory.

Read more

Claim Tree

  • 16
    16. A method for automatically processing log files of different types of an automation system of a technical facility, said method comprising:
    • concatenating all contents of a data set of a log file
    • summarizing data sets of all log files in a summary file
    • chronologically sorting the data sets of the log files in the summary file
    • compressing the data sets in the summary file
    • coding the compressed data sets in the summary file by a numeric, alphabetic or alphanumeric code
    • sorting and assigning the compressed data sets established on the basis of the numeric, alphabetic or alphanumeric code to groups with associated group codes
    • decoding the group code of the assigned one of the groups
    • outputting the decoded group code as an alphanumeric message part of the log file
    • and storing the alphanumeric message part of the log file in a memory.
    • 17. The method of claim 16, wherein
      • during compression of the data set, the data set is processed such that a data length and/or a data content of the data set is reduced.
    • 19. The method of claim 16, further comprising
      • resolving the concatenation of the contents of the data set and removing resultant separate alphanumeric contents with fewer than four characters.
  • 30
    30. A technical facility, comprising
    • an automation system including log files of different types, said automation system configured to: concatenate all contents of a data set of a log file
    • summarize data sets of all log files in a summary file
    • chronologically sort the data sets of the log files in the summary file
    • compress the data sets in the summary file
    • code the compressed data sets in the summary file by a numeric, alphabetic or alphanumeric code
    • sort and assign the compressed data sets established on the basis of the numeric, alphabetic or alphanumeric code to groups with associated group codes
    • decode the group code of the assigned one of the groups
    • output the decoded group code as an alphanumeric message part of the log file
    • and store the alphanumeric message part of the log file in a memory.
  • 31
    31. An automation system of a technical facility, comprising:
    • an operation and monitoring level
    • an automation level
    • a field level
    • and a communication system configured to connect the operation and monitoring level, the automation level and the field level to one another, at least one of the operation and monitoring level, the automation level and the field level being configured to: concatenate all contents of a data set of a log file
    • summarize data sets of all log files in a summary file
    • chronologically sort the data sets of the log files in the summary file
    • compress the data sets in the summary file
    • code the compressed data sets in the summary file by a numeric, alphabetic or alphanumeric code
    • sort and assign the compressed data sets established on the basis of the numeric, alphabetic or alphanumeric code to groups with associated group codes
    • decode the group code of the assigned one of the groups
    • output the decoded group code as an alphanumeric message part of the log file
    • and store the alphanumeric message part of the log file in a memory.
See all 3 independent claims

Description

The invention relates to a method for automatically processing a plurality of log files of an automation system of a technical facility, such as a power plant.

Large technical facilities, such as steam-turbine and gas-turbine power plants, chemical plants, steel works and rolling mills are complex technical systems having a plurality of components (e.g. several hundred), such as sensors, actuators, drives etc., each of which may possibly acquire and provide a number of measured values per second for further processing and transmission.

To monitor and control components, such as turbines, evaporators, generators, sensors, drives and actuators of the technical facility, the data obtained from the components is processed, analyzed and interpreted. In this way it is possible to recognize deviations from a predetermined normal state as early as possible and if necessary prevent damage to or failure of the components, such as the turbine.

The quantity of data/measurement signals to be interpreted here and the complexity of possible dependencies between the data/measurement signals is usually far too great for an effective analysis of the data/measurement signals to be possible by one operator.

In such cases, for control and monitoring of the facility, the technical facility comprises an automation system that is generally subdivided into an operator control and monitoring level, an automation/process level and a field level, which are connected to one another via a communication unit, especially via one or more data bus systems.

The data, such as measurement signals, status signals of individual components such as sensors, actuators, drives, turbines, automation units etc., is usually collected together into log files that describe one or more events of one or more components and/or component groups that have occurred, and is transmitted to relevant components of the technical facility.

In practical automatic control and/or monitoring there is the problem of the increasing number of generated log files on occurrence of an event in the technical facility, for example on occurrence of a fault. Typical causes of this are e.g. defective sensors and/or defective parts of the facility, which deliver additional measured values and thus additional log files. This makes it difficult for the operating personnel to have an overview of and to record the generated log files. In addition it is difficult for the operating personnel correctly to assess the event that has occurred.

Over and above this a plurality of different types of log file are generated, of which the contents are not compatible and not comparable.

The object of the invention is based on providing a simple method for automatically processing a plurality of log files of an automation system of a technical facility.

This object is achieved in accordance with the features of the independent claims. Preferred forms of embodiment are especially able to be taken from the dependent claims.

The inventive method for automatic processing, especially pre-processing, of a number of generated, especially heterogeneous and/or incompatible, log files of an automation system of a technical facility comprises at least the following steps:

    • Determining at least one message part of each data set of a log file by:
    • Concatenating all contents of the respective data set of the log file,
    • Summarizing the data sets of all log files in a summary file,
    • Chronological sorting of the data sets of all log files in the summary file,
    • Compressing each data set in the summary file,
    • Coding the compressed data sets in the summary file by at least one or more numeric codes,
    • Sorting and/or assigning (especially grouping) of the compressed data sets to at least one group with an associated group code on the basis of the numeric code(s) established, and
    • Outputting the alphanumeric message part of the log file by decoding the group code of the assigned group and output of the decoded group code.

By means of the inventive method it is made possible for log files of different types, because of the unification of their contents by coding and grouping, to be comparable and compatible with each other. This enables the unified and grouped contents of the log files of different types to be easily and much more quickly further processed, especially used for a further automatic analysis.

One form of embodiment makes provision that, when the data sets are compressed, these are processed such that at least the data length and/or the data content of the respective data set will be reduced.

For example spaces are inserted automatically for each special character or non-numeric or non-alphabetic character contained in a data set, wherein for two or more consecutive spaces resulting therefrom, a number of consecutive spaces exceeding a single space is removed from the data set. Through this those characters in the message part (for example text part, notification part, status part) of the log file that do not describe the event in greater detail, for example “*”, “+”, “§”, “#” etc., are removed from this message part and thus the message part is extracted from the system part (for example system time, version, revision) of the log file. Thus the analysis of the log file is restricted to the content-relevant message part and is thus greatly simplified and accelerated.

Furthermore the concatenation of the contents of the respective data set is resolved, so that the contents are separated again. In particular the contents are divided into words in this case. The separated alphanumeric contents resulting from the resolution of the concatenation, especially words with fewer than four characters, are removed for reducing the characters/data to be further processed and thus for data compression. Words with fewer than four characters are able to be ignored for analysis, since these only represent “statistical noise” for subsequent similarity calculations and are thus not relevant.

One possible form of embodiment of the coding makes provision for the data sets, especially their separate alphanumeric contents, to be analyzed and unified such that each separate alphanumeric content is assigned a reference word and each reference word is assigned a numeric code. As an alternative to the numeric code an alphabetic code and/or an alphanumeric code can be used. The numeric code has the advantage of a simple and fast sorting and grouping of the data sets of the log files.

For further unification and compression of the data sets from different log files and simple and fast analysis of these data sets the summary file with the separate alphanumeric contents of all log files is converted on the basis of the reference words establishment and/or the numeric code(s) into a two-dimensional, especially alphanumeric, code matrix.

In an especially simple form of embodiment the numeric codes of the two-dimensional code matrix are sorted chronologically and/or on the basis of the respective character length. In this case similar numeric codes of the code matrix can be grouped by means of a similarity operation, especially the so-called Levenshtein distance, especially assigned to at least one group. In this case each group is described or represented by an associated group code.

Thus, for an established Levenshtein distance of zero for a new numeric code to be considered to one of the groups of this numeric code to be considered, said code can be assigned to a group since the numeric code to be considered is identical to the group, especially to the group code representing this group.

On the other hand, for a Levenshtein distance of one for a numeric code to be considered to one of the groups and for a difference at only one point of the numeric code to be considered from this one group of this numeric code to be considered, this numeric code to be considered will be assigned to this one group.

Over and above this each new numeric code to be considered can be compared to non-grouped numeric codes of the same length or with a greater length of maximum one character.

In the event of the Levenshtein distance of a new numeric code to be considered to another non-grouped numeric code being equal to one, a new group with a new group code is formed from the two numeric codes such that if the two numeric codes to be considered are of different lengths, the new group will be assigned the shorter numeric code as the new group code or if the two numeric codes with at least one character different of the new group are the same length, the numeric code without the different character is assigned as the new group code.

As an alternative or in addition, when a new numeric code to be considered that does not have a Levenshtein distance of equal to one to another non-grouped numeric code is identified, this numeric code to be considered can be assigned to a further new group. In this case this further new group is assigned this new numeric code to be considered as the new group code. Future new numeric codes to be considered, which on comparison with this new group code have a Levenshtein distance of one, are assigned to this new group.

Thus the two-dimensional code matrix established and the groups with group codes established for grouping of similar and/or identical numeric codes that describe an event can be expanded or supplemented continuously in the manner of an expert system by adding new numeric codes of new data sets of further/new log files.

Over and above this the method allows only a predetermined number of groups to be used when the method is started and no new groups to be generated. Through this a robust grouping of new numeric codes to be considered is initially made possible. The generation of new groups can then be allowed in ongoing operation.

The described method is characterized in that the originally non-compatible and non-comparable message parts of the different types of log file, by concatenating all components in the original state and subsequent compression of these by character reduction and coding of this reduced character string as well as grouping of a similar and/or identically coded character string, sorts and analyzes much faster compared to conventional analysis methods.

Preferably the method is used in an automation system of a technical facility, such as a power plant.

In a simple form of embodiment the inventive method is implemented in a component of an automation system of a technical facility, wherein the automation system comprises at least one operation and monitoring level, an automation/process level and a field level, which are connected to one another via a communication system.

The characteristics, features and advantages of this invention described above and also the manner in which these are achieved will become clearer and more easy to understand in conjunction with the following description of exemplary embodiments, which will be explained in greater detail in conjunction with the drawings, in which:

FIG. 1 shows a schematic of an exemplary embodiment for an automation system for control and monitoring of a technical facility, and

FIG. 2 shows a schematic of an exemplary embodiment for a method for processing log files that are generated in the automation system.

Parts that correspond to one another are provided with the same reference characters in all figures.

FIG. 1 shows a schematic block diagram of an exemplary embodiment for an automation system 1 of a technical facility, such as a power plant or a chemical plant.

The automation system 1, in a process level AS (also called the automation level), comprises a number of automation devices 2, which are connected to one another and communicate with one another and with a control unit 4 in an operation and monitoring level BB. In addition the automation devices 2 are connected via a field bus 5 to field devices 6 at a field level FE and communicate with one another,

The data bus 3 can be an Ethernet bus or another suitable data transmission unit for example. The field bus 5 can be an Ethernet-based field bus 5 for example or can be embodied wired or wirelessly as another suitable data transmission unit. The data bus 3 and/or the field bus 5 can form a computer network in this case.

The automation devices 2 can be constructed both as freely-programmable and also as stored-program processors, especially as a processor unit, and in each case control, regulate and/or monitor a number of component groups 7 or subsystems of the individual parts of the technical facility. In particular the control, regulation and/or monitoring of the technical facility also includes an analysis and other processing of the data, such as measurement signals, control signals, input and output signals, intermediate signals, stored data, processing data.

The control units 4 can be data processing units, such as a personal computer or another suitable operation and monitoring unit, by means of which the technical facility is monitored and controlled.

The field devices 6 can for example be compact, freely-programmable or stored-program controls, especially a processor unit and/or at least one partly hard-wired or logical circuit arrangement, which control, regulate and/or monitor individual components 8 of parts of plants, such as measurement probes (sensors) and/or setting elements (actuators) and which are connected for the purposes of communication by means of the field bus 5 to the automation device 2 (also called control device).

During operation of a technical facility, such as a power plant, large volumes of data in the form of log files P1 to Pn, which comprise control commands, status messages and/or fault messages, which are triggered by control interventions in the control unit 4 or are displayed on screens or on other display units of the control unit 4, are moved via the data bus 3 and the field bus 5. In such cases, in particular during commissioning and during startup/shutdown of the facility, a plurality of control interventions are required that result in a correspondingly large number of responses to be considered. This leads to a not inconsiderable load on the operating personnel.

FIG. 2 shows a schematic of an exemplary embodiment for a method for processing, especially pre-processing, of log files P1 to Pn, which are generated in the automation system 1 and are transmitted via the data bus 3 and/or the field bus 5 and are exchanged between the units of the automation system, especially between the control units 4, the automation devices 2 and the field devices 6.

The log files P1 to Pn each comprise at least one acquisition time stamp and a text, especially a message, a notification, a status text, which describe at least one event. In addition the log files P1 to Pn can include as text a system time, a version/revision number and further information. In such cases for example a number of log files P1 to Pn can describe one event or a number of events. Various *log, *xml, *txt, *info and/or *dmp files are created and generated as log files P1 to Pn in an automation system 1 of a technical facility for example.

In at least one of the components of the automation system 1 a computer program product in particular is implemented, which is able to be loaded directly into a memory of a digital computer, such as a control unit 4, comprising program code sections that are suitable for executing steps of the method described below. As an alternative the computer program product can also be loaded into an automation unit 2.

As an alternative a computer-readable storage medium, e.g. any given memory, can be provided, which comprises instructions (e.g. in the form of program code) able to be executed by a control unit 4, which are suitable for the control unit 4 to carry out steps of the method described below.

The method implemented as a log file compressor 9 for automatic processing, especially pre-processing, of the plurality of generated, especially heterogeneous or incompatible log files P1 to Pn, comprises at least the following steps:

    • Determining at least one message part N1 to Nn of each data set D1 to Dn of a log file P1 to Pn by:
    • Concatenating all the contents of the respective data set D1 to Dn of the log file P1 to Pn,
    • Summarizing the data sets D1 to Dn of all log files P1 to Pn in a summary file SD,
    • Chronological sorting of the data sets D1 to Dn of all log files P1 to Pn in the summary file SD,
    • Compressing each data set D1 to Dn in the summary file SD,
    • Coding the compressed data sets kD1 to kDn in the summary file SD by at least one or more numeric code(s) Kx,
    • Sorting and/or assigning (especially grouping) of the compressed data sets kD1 to kDn, on the basis of the established numeric code(s) Kx, to at least one group Gy that has at least one associated group code KGy, and
    • Outputting the alphanumeric message part N1 to Nn of the log file P1 to Pn by decoding the group code KGy of the assigned group Gy and output of the decoded group code KGy.

The message part N1 to Nn of each data set D1 to Dn of the log files P1 to Pn comprises text messages, such as notifications, statuses, texts, information, warnings etc. for example. The respective data set D1 to Dn can take the form of a table or a database or another suitable form with field divisions for example.

The message part N1 to Nn of the respective log file P1 to Pn can be contained for example in one or more fields of the associated data set D1 to Dn. Further fields of the data set D1 to Dn contain log and/or system information, such as for example system time, version number, revision number etc.

The inventive method makes provision for the contents of the fields of the respective data set D1 to Dn of each log file P1 to Pn to be concatenated in a first step and subsequently for all concatenated data sets D1 to Dn of all log files P1 to Pn to be summarized in a summary file SD, especially an individual table or database. For example two log files P1 and P2 comprise the following contents or entries:

Log File P1:


28.03.2014
ABC
21.03.2014
ZDF

Log File P2:


27.03.2014
XYZ
01.01.2014
SAP

After concatenation and summarizing of the contents in the summary file SD, said file summarizes the contents as follows:


28.03.2014
ABC
27.03.2014
XYZ
21.03.2014
ZDF
01.01.2014
SAP

Within this especially tabular summary file SD the data sets D1 to Dn with the concatenated contents are sorted on the basis of a respective time stamp in each case, especially chronologically sorted, for example sorted in ascending or descending order.

The associated time stamp can especially involve an acquisition time stamp for the underlying message, which especially describes an event, such as “ambient temperature in permitted range”, “initial start activated”, “pump failed”, “turbine started” etc. in the technical facility. As an alternative or in addition the data sets D1 to Dn can be sorted on the basis of alternate or additional log parameters, such as location of acquisition, type of acquisition and/or acquisition period.

On subsequent compression of the data sets D1 to Dn with the concatenated contents these are processed such that at least the data length and/or the data contents of the respective data set D1 to Dn is/are reduced.

For example spaces are inserted automatically for special characters, such as for example “§”, “#”, “@”, etc., or non-numeric or non-alphabetic characters, “-”, “/”, etc. contained in a data set D1 to Dn. Subsequently, in the contents string of the respective data set D1 to Dn, for two or more consecutive spaces, these are automatically reduced to one space by deletion/removal of the number of consecutive spaces extending beyond one individual space. Through this each character that does not describe the event in greater detail is removed from the data set D1 to Dn, especially from the message part N1 to Nn (for example text part, notification part, status part) of the log file P1 to Pn. Thus the message part N1 to Nn is extracted in a simple manner from the system part (for example system time, version, revision) of the log file P1 to Pn, so that the further processing and analysis of the log file is restricted to the content-relevant message part N1 to Nn and is thus greatly simplified and accelerated.

In a further step the concatenation of the contents of the message part N1 to Nn is then resolved, through which the contents, especially words/phrases, are separated. In such cases the contents are then separated into words/phrases for example.

For further data compression of the data sets D1 to Dn, each of the separated words/phrases having fewer than four, especially fewer than three, characters is removed from the data set D1 to Dn for example. For example the word “is” or “yes” is deleted. This makes it possible, easily and effectively, to compare two or more different entries/contents with one another syntactically (without semantic meaning) and automatically.

There is also provision for the data sets D1 to Dn, especially their separate alphanumeric contents, such as the separated words/phrases with especially more than three characters, to be analyzed and unified such that each separate alphanumeric content is assigned a reference word Rx and each reference word Rx is assigned a numeric code Kx. Through this the memory requirement for archiving the data sets D1 to Dn is greatly reduced and their analysis is greatly accelerated.

For example the words and/or phrases of the message contents

“ambient-temperature in permitted range”,

“turbine-temperature in green range”,

“first-start activated”,

“pump failed”,

“turbine started”,

are converted into the following reference words Rx

“ambient-temperature is permitted”,

“turbine-temperature is permitted”,

“first-start activated”,

“pump failure”,

“turbine start”,

and/or are converted into the following numeric code Kx:

“123”,

“423”,

“56”,

“7”,

“8”,

In this case individual words are encoded by means of a single-digit numeric code Kx for example. Phrases with more than one word are encoded by means of a numeric code Kx having a number of digits corresponding to the number of words for example. Identical words and/or phrases are encoded with the same reference word Rx and with the same numeric code Kx. Words and/or phrases of different data sets D1 to Dn with partly matching characters and/or words are encoded with a numeric code Kx matching at least at these digits.

As an alternative to a numeric code KX an alphabetic code and/or an alphanumeric code can be used. The coding of the data sets D1 to Dn by means of the numeric code Kx has the advantage of a simple and fast sorting and grouping of the data sets D1 to Dn of the log files P1 to Pn.

For further unification and compression of the data sets D1 to Dn of the various log files P1 to Pn and simple and fast analysis of these data sets D1 to Dn, the tabular summary file SD with the separate alphanumeric contents of all log files P1 to Pn is converted on the basis of the established reference words RX and/or of the numeric code Kx into a two-dimensional, especially alphanumeric, code matrix KM.

In the two-dimensional code matrix KM the numeric codes Kx are then sorted chronologically, especially in ascending order of time and/or as a function of the respective character length. For example the numeric codes Kx “5632”, “543”, “64221”, “123” are sorted as follows:

“123”, “543”, ‘5632”, “64221”.

In addition, in a further step, similar numeric codes Kx of the code matrix KM can be grouped by means of a similarity operation, especially the so-called Levenshtein distance, especially assigned to at least one group Gy (cluster).

In this case each group Gy is described or represented by an associated group code KGy. The associated group code KGy in this case can be generated from at least the numeric code Kx of a first data set D1 to Dn that will be assigned to this group Gy. As an alternative the respective group code KGy of one or more groups Gy can be predetermined.

For example, for a Levenshtein distance to a group Gy established as zero for a new numeric code Kx to be considered, this numeric code Kx to be considered can be assigned to this group Gy, especially with the group code KGy representing this group Gy.

On the other hand, for a Levenshtein distance of one to a group Gy for a numeric code Kx to be considered and with a difference of the numeric code Kx to be considered at only one digit from this one group Gy, this numeric code Kx to be considered is assigned to this one group Gy. For example for a group Gy with an associated group code KGy of “12”, this group will be assigned the numeric codes Kx with the following digits “123”, “124”, “12” and/or “13”.

In order for example to improve and to accelerate search functions in a subsequent analysis and also in the grouping of the numeric codes Kx, the comparison of the new numeric code Kx to be considered with the already generated groups Gy will be started at the last group Gy set up or at the group Gy that has last been assigned a preceding numeric code Kx.

Especially the start for the grouping or assignment of a new numeric code Kx to be considered for the group Gy, which has been assigned a preceding numeric code Kx, accelerates the grouping algorithm, since usually neighboring numeric codes Kx, especially following on from each other but also preceding each other in time, which have previously been sorted chronologically, are assigned to one and the same event and thus are able to be assigned to one and the same group Gy.

Over and above this each newly generated and thus new numeric code to be considered can be compared with non-grouped numeric codes Kx of the same length or with a greater length of maximum one character.

In the event of the Levenshtein distance to another non-grouped numeric code Kx of a new numeric code Kx to be considered being equal to one, a new group Gy+1 with a new group code KGy+1 is formed from the two numeric codes Kx such that

    • If the two numeric codes Kx to be considered are of a different length, the new group Gy+1 is assigned the shorter numeric code Kx as the new group code KGy+1 (for example Kx=“123” and “12” leads to a new group Gy with a new group code KGy+1 of “12”) or
    • If the two numeric codes Kx are the same length with at least one different digit, the new group Gy+1 will be assigned the numeric code Kx without the different digit as the new group code KGy+1 (for example Kx=“133” and “134” leads to a new group Gy with a new group code KGy+1 of “13”).

In addition or as an alternative, when a new numeric code Kx to be considered that does not have a Levenshtein distance that is equal to one to another non-grouped numeric code Kx is identified, this numeric code Kx to be considered will be assigned to a further new group Gy+1. In this case this further new group Gy+1 will be assigned this new numeric code Kx to be considered as group code KGy+1. Future new numeric codes Kx to be considered, which, when compared to this new group code KGy+1, have a Levenshtein distance of one, will be assigned to this new group Gy+1.

The two-dimensional code matrix KM thus represents a dynamic expert system in which the established groups Gy, Gy+1 with group codes KGy, KGy+1 for grouping similar and/or identical codes Kx that describe an event, can be expanded or supplemented in an ongoing manner by addition of new numeric codes Kx of new data sets D1 to Dn of further/new log files P1 to Pn.

For further processing of the content of the numeric code Kx and/or group codes KGy, KGy+1, these are decoded and output as alphanumeric message part N1 to Nn of the log file P1 to Pn and can be stored for example in a memory 10.

As an alternative or in addition these numeric codes Kx and group codes KGy, KGy+1 decoded and representing the alphanumeric message part N1 to Nn can be supplied to the control unit 4 for further analysis and assessment of the event(s).

Over and above this the method allows only a predetermined number of groups Gy to be used when the method is started and no new groups Gy+1 to be generated. Through this a robust grouping of new numeric codes Kx to be considered is initially made possible. The generation of new groups Gy+1 can then be allowed in ongoing operation.

Although the invention has been illustrated and described in greater detail by preferred exemplary embodiments, the invention is not restricted by the disclosed examples and other variations can be derived herefrom by the person skilled in the art, without departing from the scope of protection of the invention. In particular the log file compressor 9 can be implemented at a suitable location in a component of the automation system 1.

Read more
PatSnap Solutions

Great research starts with great data.

Use the most comprehensive innovation intelligence platform to maximise ROI on research.

Learn More

Patent Valuation

34.0/100 Score

Market Attractiveness

It shows from an IP point of view how many competitors are active and innovations are made in the different technical fields of the company. On a company level, the market attractiveness is often also an indicator of how diversified a company is. Here we look into the commercial relevance of the market.

40.0/100 Score

Market Coverage

It shows the sizes of the market that is covered with the IP and in how many countries the IP guarantees protection. It reflects a market size that is potentially addressable with the invented technology/formulation with a legal protection which also includes a freedom to operate. Here we look into the size of the impacted market.

37.0/100 Score

Technology Quality

It shows the degree of innovation that can be derived from a company’s IP. Here we look into ease of detection, ability to design around and significance of the patented feature to the product/service.

94.0/100 Score

Assignee Score

It takes the R&D behavior of the company itself into account that results in IP. During the invention phase, larger companies are considered to assign a higher R&D budget on a certain technology field, these companies have a better influence on their market, on what is marketable and what might lead to a standard.

13.0/100 Score

Legal Score

It shows the legal strength of IP in terms of its degree of protecting effect. Here we look into claim scope, claim breadth, claim quality, stability and priority.

PatSnap Solutions

PatSnap solutions are used by R&D teams, legal and IP professionals, those in business intelligence and strategic planning roles and by research staff at academic institutions globally.

PatSnap Solutions
Search & Analyze
The widest range of IP search tools makes getting the right answers—and asking the right questions—easier than ever. One click analysis extracts meaningful information on competitors and technology trends from IP data.
Business Intelligence
Gain powerful insights into future technology changes, market shifts and competitor strategies.
Workflow
Manage IP-related processes across multiple teams and departments with integrated collaboration and workflow tools.
Contact Sales