Abstract: An elementary method for implementing a software module defined by an elementary directed acyclic graph, including the following steps: copying the code of the initial sequence, adding a fork function at the end of the initial sequence, copying the code of a parallel sequence, adding a join flag function at the end of said parallel sequence, copying the code of the other parallel sequence, adding a join wait function at the end of the other parallel sequence.

Abstract: Disclosed is a method for controlling an engine control unit which includes at least two microprocessor cores, including steps of executing a parent subtask and at least one child subtask. The method includes the following steps: —determining the number of executables which remain to be executed in the last child subtask of the first period when the parent subtask of the second period starts; and—determining the number of executables already executed in the parent subtask of the second period when the last child subtask of the first period finishes.

Abstract: Disclosed is a method for detecting a disappearance of a task in an environment including at least one recurring parent task that triggers, in nominal mode, on each occurrence, at least one child task, including the following steps: evaluating a parent duration elapsed between the last occurrence and the penultimate occurrence of the parent task, evaluating a child duration elapsed between the last occurrence and the penultimate occurrence of the child task, comparing the parent duration and the child duration, it being concluded that an occurrence of the child task has disappeared if the child duration, preferably with a margin, is longer than the parent duration.

Abstract: Disclosed is a method for controlling an engine control unit which includes at least two microprocessor cores, including steps of executing a parent subtask and at least one child subtask. The method includes the following steps: —determining the number of executables which remain to be executed in the last child subtask of the first period when the parent subtask of the second period starts; and—determining the number of executables already executed in the parent subtask of the second period when the last child subtask of the first period finishes.

Abstract: Disclosed is a method for detecting a disappearance of a task in an environment including at least one recurring parent task that triggers, in nominal mode, on each occurrence, at least one child task, including the following steps: evaluating a parent duration elapsed between the last occurrence and the penultimate occurrence of the parent task, evaluating a child duration elapsed between the last occurrence and the penultimate occurrence of the child task, comparing the parent duration and the child duration, it being concluded that an occurrence of the child task has disappeared if the child duration, preferably with a margin, is longer than the parent duration.