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 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 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: A method for producing a computer-assisted real-time system that includes at least one processing unit. Data exchange between the processing unit and the environment or one or more additional processing units is synchronous or asynchronous. At least one real clock is allocated to the processing unit to correlate data exchange.