Abstract: The present invention relates to a computer-implemented method for an automatic synthesis of distributed embedded systems, wherein the tasks to be processed by the system are mapped to a hardware structure having a plurality of processing units such that predefined time limits of the tasks are met, comprising the steps of (a) assigning the tasks to the plurality of processing steps, with the following substeps: (aa) assigning a task to a processing unit; (bb) determining the outgoing event densities; (cc) comparing the output density towards the next task with a predefined threshold and assigning the next task to the same processing unit if the event density is below the threshold or assigning the next task to any other processing unit if the event density is smaller than the threshold; (dd) repeating steps (aa) to (cc) until all tasks are assigned to the processing units; (b) checking whether the costs of the given task assignment to the processing units satisfy a predefined solution criterion; (c) repeating

Abstract: The method of the invention for preprocessing data before providing the data to a user of the data for further processing the data at the user of the data, comprising the steps of (a) selecting, by the data provider, at least one part of the data from the entire data to be provided to the user for further processing, depending on at least one give criterion which the user fulfils; (b) hiding the selected data such that despite being hidden from the user, the selected data can be further processed and/or executed after the provision.

Abstract: The invention relates to a computer-assisted method and data processing system for simulating an embedded system, wherein a plurality of hardware components, respectively provided with a software, are connected via a data exchange network for data exchange, wherein in a simulation program every component is simulated as a processing unit managing an amount of processes, wherein with the simulation program, a start time is dynamically assigned to every processing unit, wherein the processing units are successively sorted dynamically according to their start times, wherein the processing unit with the next start time is respectively selected via a scheduler, wherein, due to the selection of a processing unit, the respective active process is simulated by execution of a program code derived from a corresponding basic block graph and as a result of the simulation, the time required for the execution and/or information about the effected function is/are determined.

Abstract: The invention provides a method for analysing the real-time capability of a system, in particular a computer system, where various tasks are provided, wherein the tasks are repeatedly performed and wherein an execution of a task is triggered by an activation of the task and this represents an event of the task, wherein a plurality of descriptive elements are provided to describe the time correlation of the events as event stream, wherein the event streams may detect the maximum time densities of the events and/or the minimum time densities of the events, and wherein at least a further descriptive element to which an amount of event streams is assigned and which describes the time correlation of an entirety of events which are captured by at least two event streams.

Abstract: The present invention relates to a computer-implemented method for an automatic synthesis of distributed embedded systems, wherein the tasks to be processed by the system are mapped to a hardware structure having a plurality of processing units such that predefined time limits of the tasks are met, comprising the steps of (a) assigning the tasks to the plurality of processing steps, with the following substeps: (aa) assigning a task to a processing unit; (bb) determining the outgoing event densities; (cc) comparing the output density towards the next task with a predefined threshold and assigning the next task to the same processing unit if the event density is below the threshold or assigning the next task to any other processing unit if the event density is smaller than the threshold; (dd) repeating steps (aa) to (cc) until all tasks are assigned to the processing units; (b) checking whether the costs of the given task assignment to the processing units satisfy a predefined solution criterion; (c) repeating

Abstract: A non-transitory computer readable medium for a real time analysis of a computer system performs a method of describing an occurrence pattern, for which a set of tasks is provided. The tasks are partially repeatedly requested by the system and processed or repeatedly generate events by requests to partial components of the system. An occurrence pattern of the events requesting the tasks or events generated by the task during the real-time analysis is represented by a description of event densities. The description includes a set of elements describing a portion of the occurrence pattern of the events. At least two elements for the description of the part of the occurrence pattern include a further set of elements providing a plurality of hierarchical levels. The further sets and thus the part of the occurrence pattern described by the further sets differ from each other.

Abstract: The invention relates to a method for the real-time analysis of a system, especially a technical system, which is to process tasks (?). A job that is defined by processing of a task (?) generates system expenses. In order to create a particularly quick and accurate method, an approximation of the method is cancelled when it is considered that an interval (I, I?, I?n?) cannot be processed in real time, the system expenses being taken into account instead of the approximate value for at least one job of a task (?).

Abstract: The invention provides a method for analysing the real-time capability of a system, in particular a computer system, where various tasks are provided, wherein the tasks are repeatedly performed and wherein an execution of a task is triggered by an activation of the task and this represents an event of the task, wherein a plurality of descriptive elements are provided to describe the time correlation of the events as event stream, wherein the event streams may detect the maximum time densities of the events and/or the minimum time densities of the events, and wherein at least a further descriptive element to which an amount of event streams is assigned and which describes the time correlation of an entirety of events which are captured by at least two event streams.

Abstract: The invention relates to a computer-assisted method and data processing system for simulating an embedded system, wherein a plurality of hardware components, respectively provided with a software, are connected via a data exchange network for data exchange, wherein in a simulation program every component is simulated as a processing unit managing an amount of processes, wherein with the simulation program, a start time is dynamically assigned to every processing unit, wherein the processing units are successively sorted dynamically according to their start times, wherein the processing unit with the next start time is respectively selected via a scheduler, wherein, due to the selection of a processing unit, the respective active process is simulated by execution of a program code derived from a corresponding basic block graph and as a result of the simulation, the time required for the execution and/or information about the effected function is/are determined.

Abstract: The method of the invention for preprocessing data before providing the data to a user of the data for further processing the data at the user of the data, comprising the steps of (a) selecting, by the data provider, at least one part of the data from the entire data to be provided to the user for further processing, depending on at least one give criterion which the user fulfils; (b) hiding the selected data such that despite being hidden from the user, the selected data can be further processed and/or executed after the provision.

Abstract: The invention relates to a method for testing the real-time capacity of a system, especially a computer system, according to which a quantity of different tasks (?) is to be executed, system costs being incurred by the execution of each task (?). The aim of the invention is to provide an especially rapid and accurate method. To this end, in order to determine the total costs (Dbi(I)) for at least one time interval (I), the actual system costs (Dbi(I)) of the job of a first task are taken into account for said at least one first task, the actual system costs (Dbi(I)) of at least two jobs of the first task are taken into account for at least one first task, and other system costs are taken into account for at least one second task. The other system costs are determined by an approximation based on the actual system costs (Dbi(I)).

Abstract: The invention relates to a method for generating a simulation program which can be executed on a computer for the purpose of simulating the function and execution time of a program which is provided to be executed on a target computer, the method comprising the following steps of: a) providing a source code of the program, b) producing an optimized intermediate representation of the program's source code, c) determining execution times on the basis of the optimized intermediate representation of the program's source code, d) generating an object code, which can be executed on a host computer, on the basis of the optimized intermediate representation of the source code and then e) combining the execution times, the object code and a prescribed simulation library using a linker, such that a simulation program which can be executed on the host computer is produced.

Abstract: The invention relates to a method for the real-time analysis of a system, especially a technical system, which is to process tasks (?). A job that is defined by processing of a task (?) generates system expenses. In order to create a particularly quick and accurate method, an approximation of the method is cancelled when it is considered that an interval (I, I?, I?n?) cannot be processed in real time, the system expenses being taken into account instead of the approximate value for at least one job of a task (?).

Abstract: The invention relates to a method for testing the real-time capacity of a system, especially a computer system, according to which a quantity of different tasks (?) is to be executed, system costs being incurred by the execution of each task (?). The aim of the invention is to provide an especially rapid and accurate method. To this end, in order to determine the total costs (Dbi(I)) for at least one time interval (I), the actual system costs (Dbi(I)) of the job of a first task are taken into account for said at least one first task, the actual system costs (Dbi(I)) of at least two jobs of the first task are taken into account for at least one first task, and other system costs are taken into account for at least one second task. The other system costs are determined by an approximation based on the actual system costs (Dbi(I)).