EP1402362A2 - Procede permettant de produire automatiquement une sequence fonctionnelle de processus, et vehicule correspondant - Google Patents

Procede permettant de produire automatiquement une sequence fonctionnelle de processus, et vehicule correspondant

Info

Publication number
EP1402362A2
EP1402362A2 EP01960118A EP01960118A EP1402362A2 EP 1402362 A2 EP1402362 A2 EP 1402362A2 EP 01960118 A EP01960118 A EP 01960118A EP 01960118 A EP01960118 A EP 01960118A EP 1402362 A2 EP1402362 A2 EP 1402362A2
Authority
EP
European Patent Office
Prior art keywords
processes
input value
calculation cycle
input
sequence
Prior art date
Legal status (The legal status 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 status listed.)
Withdrawn
Application number
EP01960118A
Other languages
German (de)
English (en)
Inventor
Lutz Berentroth
Stefan HÖLZL
Helmut Wellnhofer
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Continental Automotive GmbH
Original Assignee
Siemens AG
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 Siemens AG filed Critical Siemens AG
Publication of EP1402362A2 publication Critical patent/EP1402362A2/fr
Withdrawn legal-status Critical Current

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
    • G05B19/00—Programme-control systems
    • G05B19/02—Programme-control systems electric
    • G05B19/04—Programme control other than numerical control, i.e. in sequence controllers or logic controllers
    • G05B19/042—Programme control other than numerical control, i.e. in sequence controllers or logic controllers using digital processors
    • G05B19/0426—Programming the control sequence
    • 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/20—Pc systems
    • G05B2219/23—Pc programming
    • G05B2219/23293—Automated assembly of machine control software, reusable software components

Definitions

  • ⁇ ⁇ 3 3 ⁇ 3 * * 1 ⁇ r + 3 1 1 1 1 3 ⁇ - 3 ⁇ - 3 " ⁇ HI li ⁇ 3 3 1 1 1 3
  • processes can be identified within a calculation cycle that have no interdependencies. Such independent processes can be processed in parallel in computing units with multitasking operating systems, in particular in multiprocessor systems.
  • An inconsistency in a sequence of processes can be determined, for example, as follows:
  • Step 1 Determination of a process that has no input with the attribute "Input value of the same calculation cycle" (based on the current set of processes).
  • Step 2 Remove this process from the set of
  • Step 3 Repeat steps 1 and 2 for the remaining set of processes. If the above process cannot reduce the number of processes until no process is left, an inconsistency has been found.
  • the present invention can be used, for example, to design operating system software for computers, complex application programs, sequence controls for industrial production and in particular for determining controls for Control units are used in motor vehicle technology, for example engine and transmission control units.
  • Fig. 1 is a tool for arranging or testing.
  • Fig. 2 the linking of processes within one
  • FIG. 3 the processes of a torque control of an engine control
  • FIG. 4 the representation of the linking of the processes of FIG. 3 in the form of a graph
  • FIGS. 10-13 the checking of a sequence of processes which have an inconsistency.
  • Figure 1 shows a tool for arranging and / or checking a sequence of processes to be processed.
  • This has a computing unit 1 with a microprocessor MP and a random access memory RAM.
  • a drive 2 for a storage medium 21, which is a writable CD (compact disk), and a keyboard 3 are provided with the computing unit 1 as input means.
  • Sequences of processes for the execution of tasks (tasks) of an operating system software or an application software and individual processes are stored on the storage medium 21. It is a library with existing processes that can be used to create new programs. c ⁇ O>>
  • An input I of the type PRE requires an input value that has already been made available within the same calculation cycle, that is to say has been generated beforehand.
  • the process whose output or output port 0 supplies the value for input I provided with the PRE attribute must therefore have been calculated in the order in advance.
  • Process P3 has an input I of the type PRE. This input I consumes a value that is provided by output 0 of process P2. The tool for arranging or checking a sequence of processes therefore recognizes that process P2 must be placed in the sequence before process P3.
  • the value provided only has to be generated later in the sequence, so that when the calculation cycle n is processed, an old input value calculated in the previous calculation cycle n-1 is available (this corresponds to a z _1 element in the Control technology).
  • the tool for arranging or checking will therefore arrange process P3, the output value of which is required by an input I of the POST type from process P1, after process P1 in the same calculation cycle n.
  • Inequalities can be created based on the assigned attributes for inputs I of processes P1-P3. In this way, a relationship is established between a process whose output port 0 provides a value and a process whose input port I consumes this provided value.
  • a process supplies an input value for an input I of the type PRE, this process is set smaller than the process with this input of the type PRE.
  • the process that is set as "smaller” in a relation must be carried out before the other process of the relation.
  • input I is of the POST type
  • the process that supplies the input value becomes larger than the process with it POST input set
  • the process supplying the input value can be set larger or smaller than the process receiving the input value, and the input of type ANY can finally be operated by a process arranged in the same or subsequent calculation cycle
  • the arrangement of the two processes in relation to one another is therefore arbitrary, resulting in as many inequalities as there are inputs with the attribute PRE or POST in the calculation cycle.
  • the first process in a calculation sequence or sequence is only a process that has no input of the type PRE has.
  • the last process in a sequence is only a process that has no POST input.
  • Processes P1 and P2 then come into question as the first processes in the sequence.
  • Process P3 may only be calculated after processes Pl and P2.
  • Processes Pl and P2 can be processed in any order or in parallel.
  • FIG. 3 shows a simplified task with a calculation sequence or sequence of processes P1-P8 for torque control of an operating system of an engine control unit of a motor vehicle.
  • a task typically has a sequence of 100 to 200 processes.
  • Some of the processes are taken from a library. Some processes have been redesigned for torque control.
  • the graphic of FIG. 3 is available to a developer who wants to find a valid sequence of processes, but it does not yet determine a process sequence.
  • Process Pl calculates the difference between the actual speed and the speed set by a driver for a user setting of a cruise control system (cruise control) and specifies this difference
  • Process P3 off.
  • Process P2 calculates a power request communicated by an accelerator pedal position and also outputs this to process P3.
  • Process P3 coordinates any existing requirements of processes P1 and P2 and calculates a torque request for processes P4 and P ⁇ .
  • Process P4 determines a slow torque change and issues a corresponding request to process P5.
  • Process P5 calculates a setpoint for a throttle valve position and outputs it to an actuator. co co h 0 M ⁇ > c ⁇ o C ⁇ o c ⁇ O C ⁇
  • the first processes in the sequence are only processes that do not require an input value calculated in the same calculation cycle. The first process must therefore not have an input assigned the PRE attribute. The last process in the sequence must not have an input assigned the POST attribute. All calculation sequences that meet these conditions and the inequalities set up are valid or executable sequences.
  • a graph is built using the processes as nodes and each inequality as the directed edge of the graph.
  • a directed edge is a reference from one process to another process. The directed edge is directed in each case from the process or node that was determined to be smaller in the corresponding inequality to the process or node that was determined to be larger in the same inequality.
  • FIG. 4 shows the implementation of the above inequalities in a graph.
  • all nodes (processes) are removed from the set of nodes (processes) to be checked, including the associated references E (edges), to which no references E (edges) of the graph show.
  • Recursive processing of the algorithm creates a new group of processes, which must be processed after the previous group of processes when the program is executed.
  • the processes remaining after each step are therefore examined in further successive steps for processes to which no reference E is set.
  • the processes found in each step are removed and assigned to successive groups of processes. These groups can include one or more processes.
  • the order of the processes within a group is arbitrary, since these processes are independent of each other. However, all processes in one group must be completed before a process in the next group is executed.
  • FIG. 5 shows the process P1 and P2 reduced
  • This subgraph must also have at least one node (process) to which no edge points. All nodes to which no edge points must be removed again. If there is no node (process) that fulfills this condition, an unresolvable loop and thus an inconsistency in the data flow is discovered. In a second step, process P3 is consequently removed and assigned to a second group of processes.
  • process 6 is now removed, to which no edge points.
  • Process 6 is assigned to a third group of processes.
  • processes P4 and P7 are removed and assigned to a fourth group of processes.
  • the order in which the processes have to be processed is found in the order of the steps or the groups of processes.
  • the processes that were separated in one step must be executed before the processes that were separated in the next step.
  • Figure 10 shows a graph containing an unresolvable loop. The graph does not represent the torque control of Figure 3.
  • FIG. 13 which represents the result of the third step, no process or node could be found to which no edge of the graph points. So there is no process that has no input with the PRE attribute. The remaining processes cannot be assigned to a group. There is a loop that needs to be resolved to get an executable task. The remaining processes are output on a display device or a printer.

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Automation & Control Theory (AREA)
  • Programmable Controllers (AREA)
  • Control By Computers (AREA)
  • Numerical Control (AREA)

Abstract

La présente invention a pour objet la détermination automatique d'une séquence fonctionnelle de processus qui permettent la détermination d'une valeur de sortie à partir d'au moins une valeur d'entrée. A cet effet, une pluralité de processus (P1 - P8), dont les entrées sont associées à au moins l'un des attributs: "Eingangswert des selben Berechnungszyklus" (valeur d'entrée du même cycle de calcul) (PRE), "Eingangswert des vorhergehenden Berechnungszyklus" (valeur d'entrée du cycle de calcul précédent) (POST), "Eingangswert aus beliebigem Berechnungszyklus" (valeur d'entrée d'un cycle quelconque) (ANY), est mise en place de sorte qu'en tant que premier processus d'un cycle de calcul est déterminé un processus qui ne présente aucune entrée dotée de l'attribut "Eingangswert des selben Berechnungszyklus" (PRE) et qui détermine, dans les étapes analogiques suivantes, une certaine quantité de séquences possibles.
EP01960118A 2000-07-18 2001-07-12 Procede permettant de produire automatiquement une sequence fonctionnelle de processus, et vehicule correspondant Withdrawn EP1402362A2 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
DE10034869 2000-07-18
DE10034869A DE10034869A1 (de) 2000-07-18 2000-07-18 Verfahren zum automatischen Gewinnen einer funktionsfähigen Reihenfolge von Prozessen und Werkzeug hierzu
PCT/DE2001/002612 WO2002006950A2 (fr) 2000-07-18 2001-07-12 Procede permettant de produire automatiquement une sequence fonctionnelle de processus, et vehicule correspondant

Publications (1)

Publication Number Publication Date
EP1402362A2 true EP1402362A2 (fr) 2004-03-31

Family

ID=7649299

Family Applications (1)

Application Number Title Priority Date Filing Date
EP01960118A Withdrawn EP1402362A2 (fr) 2000-07-18 2001-07-12 Procede permettant de produire automatiquement une sequence fonctionnelle de processus, et vehicule correspondant

Country Status (5)

Country Link
US (1) US7231261B2 (fr)
EP (1) EP1402362A2 (fr)
JP (1) JP2004521402A (fr)
DE (1) DE10034869A1 (fr)
WO (1) WO2002006950A2 (fr)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE10034869A1 (de) * 2000-07-18 2002-02-07 Siemens Ag Verfahren zum automatischen Gewinnen einer funktionsfähigen Reihenfolge von Prozessen und Werkzeug hierzu
DE10310422A1 (de) 2003-03-11 2004-09-23 Zf Friedrichshafen Ag Verfahren zur Vernetzung von Regelungs- und/oder Steuerungsfunktionen für ein Kraftfahrzeug
JP7054033B2 (ja) * 2020-03-31 2022-04-13 ダイキン工業株式会社 プロセス実行順序決定プログラム及びプロセス実行順序決定方法
US11346538B1 (en) * 2021-05-17 2022-05-31 Sikai Chen LED lighting module with electrical power and data connections

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4977529A (en) * 1973-02-23 1990-12-11 Westinghouse Electric Corp. Training simulator for a nuclear power plant
JPS5621242A (en) * 1979-07-28 1981-02-27 Fujitsu Ltd Pipeline control method for computer operation
EP0347162A3 (fr) * 1988-06-14 1990-09-12 Tektronix, Inc. Dispositif et méthodes pour la commande de processus de flux de données par des séquences d'instructions générées
US4975947A (en) * 1989-02-22 1990-12-04 Texas Instruments Incorporated System to share the DSP computation resources
US5077677A (en) * 1989-06-12 1991-12-31 Westinghouse Electric Corp. Probabilistic inference gate
US5182794A (en) * 1990-07-12 1993-01-26 Allen-Bradley Company, Inc. Recurrent neural networks teaching system
EP0746078B1 (fr) * 1995-05-31 2002-09-18 Kabushiki Kaisha Meidensha Procédé et appareil pour détecter l'opération islanding d'un générateur dispersé
EP1457897A3 (fr) * 1995-10-26 2005-04-20 Matsushita Electric Industrial Co., Ltd. Système de fichiers
US6453446B1 (en) * 1997-12-24 2002-09-17 Magma Design Automation, Inc. Timing closure methodology
EP0953898A3 (fr) * 1998-04-28 2003-03-26 Matsushita Electric Industrial Co., Ltd. Processeur de traitement d' instructions lues de mémoire a l'aide d'un compteur de programme et compilateur, assembleur, éditeur et débogueur pour un tel processeur
US7036106B1 (en) * 2000-02-17 2006-04-25 Tensilica, Inc. Automated processor generation system for designing a configurable processor and method for the same
DE10011890C2 (de) * 2000-03-03 2003-04-24 Jena Optronik Gmbh Verfahren zur Bestimmung der Zustandsgrössen eines sich bewegenden starren Körpers im Raum
DE10034869A1 (de) * 2000-07-18 2002-02-07 Siemens Ag Verfahren zum automatischen Gewinnen einer funktionsfähigen Reihenfolge von Prozessen und Werkzeug hierzu
US6757445B1 (en) * 2000-10-04 2004-06-29 Pixxures, Inc. Method and apparatus for producing digital orthophotos using sparse stereo configurations and external models

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
ANTONIO DIAZ-CALDERON: "A Composable Simulation Environment to Support the Design of Mechatronic Systems", CARNEGIE MELLON UNIVERSITY, June 2000 (2000-06-01), Pittsburgh, Pennsylvania, pages 1 - 226, Retrieved from the Internet <URL:http://www.cs.cmu.edu/~compsim/articles/adiaz-thesis.pdf> [retrieved on 20090618] *
MARK ALLEN WEISS: "Data structures & Algorithms in C++", February 1999, ADDISON WESLEY LONGMAN *

Also Published As

Publication number Publication date
WO2002006950A2 (fr) 2002-01-24
US20040205756A1 (en) 2004-10-14
WO2002006950A3 (fr) 2003-12-31
JP2004521402A (ja) 2004-07-15
DE10034869A1 (de) 2002-02-07
US7231261B2 (en) 2007-06-12

Similar Documents

Publication Publication Date Title
EP0689694B1 (fr) Procede de production automatique de groupes d&#39;instructions pouvant etre traites de maniere parallele a partir d&#39;un programme pour processeurs superscalaires
WO2007020231A2 (fr) Systeme d&#39;ebauchage de dispositifs techniques, assiste par ordinateur
EP3568757B1 (fr) Procédé de production de code source
WO2021058223A1 (fr) Procédé d&#39;application de fonctions de conduite automatisée de manière efficace et simulée
EP3629151A1 (fr) Procédé de changement de modèles pour la génération du code source
DE102009027627B3 (de) Simulation von Echtzeit-Software-Komponenten auf Basis der Logischen Ausführungszeit
EP0898745A1 (fr) Procede pour controler la fiabilite de fonctionnement d&#39;une unite de calcul
EP3320431A1 (fr) Procédé mis en oeuvre par ordinateur pour le traitement de variantes d&#39;objet de données
EP1682950A1 (fr) Procede et dispositif de stimulation de fonctions pour la commande de processus de fonctionnement
WO2002006950A2 (fr) Procede permettant de produire automatiquement une sequence fonctionnelle de processus, et vehicule correspondant
EP2592504B1 (fr) Procédé destiné à évaluer la consommation de ressources lors de la génération d&#39;un code de programme d&#39;appareils de commande
EP1944664B1 (fr) Procédé de diagnostic d&#39;erreurs dans un automate programmable
DE60026847T2 (de) Verfahren, einem objekt in einer datenbank eine identität zuzuweisen
DE102021201212A1 (de) Verfahren zum Steuern einer Mehrzahl an Fahrfunktionen in einem automatisierten oder autonomen Fahrzeug
EP4016360A1 (fr) Procédé, produit programme informatique et outil de modélisation destinés au développement basé sur un modèle de référence et lié aux composants d&#39;un système technique
EP1936452A1 (fr) Procédé et dispositif destinés au traitement dynamique d&#39;objets d&#39;un modèle de simulation
DE102020102996A1 (de) Verfahren für einen integrierten Entwurf zur Modellierung, Simulation und Test einer Echtzeit-Architektur innerhalb einer modellbasierten System- und Softwareentwicklung
EP0662226B1 (fr) Procede de traitement d&#39;un programme d&#39;application sur un systeme informatique parallele
DE10325513B4 (de) Verfahren und Vorrichtung zum Erstellen eines Verhaltensaspekts einer Schaltung zur formalen Verifikation
DE102017120013A1 (de) Verfahren zur Konfiguration eines zum Testen eines elektronischen Steuergeräts eingerichteten Testgeräts sowie Konfigurationssystem
DE102018217139B4 (de) Verfahren und Vorrichtung zum Konfigurieren einer Kennfunktion eines Steuergeräts eines Kraftfahrzeugs
DE102006034018A1 (de) Verfahren und Vorrichtung zur Produktionsplanung
WO2024110148A1 (fr) Procédé de fonctionnement d&#39;un système de technologie d&#39;informations, système de technologie d&#39;informations, et véhicule
EP2128727A1 (fr) Procédé et produit de programme d&#39;ordinateur pour créer un programme de commande à espace de stockage réduit
DE102022212058A1 (de) Verfahren zur Überprüfung von funktionalen Pfaden für ein eingebettetes System, Vorrichtung zur Datenverarbeitung, Computerprogramm und computerlesbarer Datenträger

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20030120

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): FR GB

17Q First examination report despatched

Effective date: 20071218

RAP1 Party data changed (applicant data changed or rights of an application transferred)

Owner name: CONTINENTAL AUTOMOTIVE GMBH

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20091103