WO2010025757A1 - Procédé de spécification d'une fonction de commande - Google Patents

Procédé de spécification d'une fonction de commande Download PDF

Info

Publication number
WO2010025757A1
WO2010025757A1 PCT/EP2008/007341 EP2008007341W WO2010025757A1 WO 2010025757 A1 WO2010025757 A1 WO 2010025757A1 EP 2008007341 W EP2008007341 W EP 2008007341W WO 2010025757 A1 WO2010025757 A1 WO 2010025757A1
Authority
WO
WIPO (PCT)
Prior art keywords
input
output
value
defining
machine
Prior art date
Application number
PCT/EP2008/007341
Other languages
German (de)
English (en)
Inventor
Judith Hartmann
Benjamin Hummel
Jörg NEIDIG
Original Assignee
Siemens Aktiengesellschaft
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 Aktiengesellschaft filed Critical Siemens Aktiengesellschaft
Priority to PCT/EP2008/007341 priority Critical patent/WO2010025757A1/fr
Publication of WO2010025757A1 publication Critical patent/WO2010025757A1/fr

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

Definitions

  • the invention relates to a method for specifying a control function for a system, in particular in the automation environment.
  • a design method for error-proof systems known in the industry is the so-called "safety matrix.”
  • the design tool allows the creation of programs in the so-called cause-effect representation, see FIG.
  • cause and effect matrix is very frequently used in plant engineering in order to present in a simple and clear manner when switching operations are carried out in a PLC system or in a safety system.
  • process events are assigned cause (cause) and effect events (effects). These are then linked together.
  • the connection between cause and effect are called intersections (actions), which show what effect an existing cause will have. From this data, a program logic can be developed to control or prevent events before they can cause damage to the process.
  • the user can logically link possible process events with possible system reactions.
  • SCR Software Cost Re-duction
  • SCR requirement method which is based on a tabular notation, is a formal method for specifying the requirements of embedded real-time systems.
  • SCR the required system behavior is described by means of a mathematical relationship between monitored variables and controlled variables. To precisely specify this relationship, SCR uses conditions, events, and tables.
  • Each SCR table (condition table, event table, and state transition table) specifies the required value of a variable as a mathematical function defined on the conditions and events.
  • the tables facilitate the industrial application of the SCR method.
  • these tables represent either (stateless) functions, i. H. a response to particular sequences of inputs / events is not representable, or they merely provide an alternative notation for state machine, i. the current and following state is explicitly modeled and specified in the table.
  • the object of the invention is to provide a method for specifying a control function, which does not have the disadvantages mentioned. Presentation of the invention
  • control function consists of at least one system reaction, by at least one first value for defining at least one input value and at least one second value for defining at least one Output value at the input value and output value are linked to a system reaction.
  • a regular expression is a character string used to describe sets or subsets of strings using specific syntactic rules
  • Regular expressions provide a kind of filter criterion z. For example, for text by the respective regular expression in the form of a pattern is compared with the text.
  • the notation technique proposed here relieves the user of the task of explicitly modeling the state space since the model is based on sequences of inputs and outputs, ie the level of abstraction is higher.
  • the extension allows the modeling of sequences of responses to event sequences, ie the table contains not only static but dynamic information about the event System.
  • the table according to the invention is thus a draft ⁇ tool that gives the developer the opportunity to implement specifications and informal requirements systematically in specific functions without the limitation of existing decision-throw tools to static relationships.
  • the control software functions modeled in this way can be subjected to systematic, complete and automated error checking in a method presented below.
  • the table according to the invention consists of several columns and rows.
  • the columns are defined by the interface of the system, i. that is, the columns are divided into an input part that includes exactly one column for each input channel, and an output part with a column for each output channel.
  • Each line contains the description of a system response through a series of output values at the output ports to a sequence of input values at the input ports.
  • there is an (extended) regular expression in each cell which describes the input or output messages at the corresponding channel at a given time.
  • the regular expressions in the input columns describe the message sequences at the input channels observed up to the current time t.
  • the regular expressions in the output columns describe the behavior demanded on the output channels from the next time t + 1.
  • Each requirement for the observable / measurable system behavior is thus described by a line which connects the observable input patterns on the input channels with required output patterns on the output channels. Any such combination of matching input and output sequences further limits the amount of syntactically correct combinations of input / output sequences over a given interface.
  • the overall specification of the system behavior results by combining the requirements specified in the different rows of the table.
  • the rows of the table are divided into several sections.
  • the different sections must all apply at the same time.
  • the developer can thereby model multiple requirements that must be met simultaneously.
  • the lines within a section represent alternative requests (e.g., alternative input situations).
  • only one line may apply in each section of the table, d. H. the regular expression defining the input values is true.
  • An alternative advantageous embodiment, on the other hand, applies in each section of the table exactly the first line in which the regular expression defining the input values is true.
  • They may be arranged according to their priority, i. H. in an input situation captured by the regular expressions of different lines of a section, only the response of the first matching line must be satisfied.
  • the system describing table can advantageously be transformed in a next step to a Büchi automaton.
  • the invention comprises a transformation of the prefix tables into a so-called Büchi automaton.
  • the Büchi automaton is a special form of the ⁇ -automat. This type of machine can be used to recognize both languages through infinite words. The construction of the machine, which accepts the same consequences as described by the table, is broken down into the construction of the machine for a single line as well as their combination.
  • the machine for one line accepts exactly the I / O pairs that do not violate the request of this line.
  • the construction comprises the following steps: a) Translation of the regular expression of each input cell into a finite automaton (ie the set of states that the automaton can assume is finite). b) formation of the cross product of the input machines.
  • a new automaton is generated whose states consist of all possible (ordered) tuples of the states of the individual automata.
  • a state is a final state, if and only if all individual states of the tuple are final states.
  • the Aplhabet of the machine is the (quantity) cross product of the alphabets of each machine, so are the inputs of this automaton tuples of characters.
  • the transitions are obtained by determining the subsequent states according to the individual automata for the individual states and the matching character from the input tuple.
  • the subsequent state in the new machine is thus the tuple of the successor states of the individual machines.
  • d) formation of the cross product of the output machines (see step b))
  • Unattainability of lines the identification of lines in the table according to the invention which are never active and can therefore be removed.
  • - determinism d. H.
  • the underlying automaton behaves deterministically, ie, by entering one of its possible inputs from a state in which it is located, it changes into a clearly determined subsequent state. Identification of unwanted nonde- terminism avoids the sub-specification of the table.
  • the proposed method can check the consistency of the tabular specification completely automatically, as a by-product also information on the degree of under specification and the code generation (generation of a machine according to the specification) are possible.
  • control design can advantageously be carried out modularly. For complex systems, such as automation systems, the design can then be divided into independent parties, each of which sets up the prefix tables separately according to the system described above.
  • each developer creates a table that is only one tool for systematically modeling the request.
  • the developer goes through the requirement sentence by sentence and formulates each request as a regular expression.
  • All created tables are checked, for example by a software tool, for completeness, accessibility, determinism and consistency, as already described above (verification). In this case, if it is a more complex system, the interaction of the individual components is taken into account, so also performed a verification for the entire system. If the verification fails, the user receives appropriate information, otherwise the control code is automatically generated from the tables.
  • the tables described here represent a significant extension of the "safety matrix" based on cause-effect tables, as described in the introduction.
  • the design tool goes well beyond the state of the art: the use of regular expressions within the tables,
  • the presented table technique further enables the specification of functionalities in a vivid, systematic and intuitive manner, combining the expressiveness and precision of a logical specification style with clarity a tabular notation method.
  • the presented method is particularly suitable for designing control functions for fail-safe systems.
  • FIG. 1 shows a schematic representation of a current-processing reactive system
  • FIG. 2 Schematic representation of a table according to the invention, FIG. 3a Input types for the example, FIG. 3b Output types for the example, FIG. 3c, first table
  • FIG. 7 shows the surface of the design tool Simatic Safety
  • Prefix tables are used to specify stream processing, reactive systems, ie a series of input messages is mapped to a series of output messages.
  • the stream-based system theory was introduced by Manfred Broy, Keil Stool: Specification and Development of Interactive Sys- tems: Focus on Streams, Interfaces, and Refinement).
  • Figure 1 shows such a system, described by its interfaces, ie by the set of incoming channels I and outgoing channels O, and by a stream processing function f which maps sequences of input messages to the input channels on sequences of output messages on the output channels
  • Prefix tables specify the measurable behavior of a system at its boundary, ie at the input / output channels. Analogous to the safety matrix, possible inputs linked to the input channels with associated reaction patterns at the output channels.
  • the user can log in or out of station S during station monitoring.
  • Station monitoring sends a corresponding signal to the station in the next cycle, unless the station is already logged on or off.
  • the station reports its current status (logged in / out) to the station monitoring at regular intervals.
  • the station monitoring confirms the receipt of the status message within 3 time-cycles.
  • the station monitor will request a status message from the station at the next time interval.
  • the developer determines the necessary output and input variables based on the requirements.
  • the user defines the possible inputs that the user can make in the system according to requirement catalog point 1.
  • Istatus defines the status states that the station can have at the time of input.
  • Ostation describes the actions the station can perform.
  • the developer translates the requirements step by step into a table, the structure being predetermined by the interfaces.
  • the developer realizes that the informal requirements still offer some scope for interpretation and that they must be refined and specified when translating into a table according to the invention in order to achieve the completeness of the description.
  • the relationship between the informal requirements and rows of the table is shown in the column "Description" explained.
  • Requirement 1 models the station monitoring response to a user input.
  • Requests 2 and 3 model the response to a status change of the station. Both sets of requirements must be fulfilled at the same time. They thus result in two separate sections of the table. supplemented table (FIG. 3c)
  • the initial state (stateO) is characterized in that it is the end point of an arrow that has no state as a starting point.
  • Final states (statel, state2, state ⁇ ) are indicated by double circles.
  • An input word is processed character by character, with the current state being indexed according to the transition whose label matches the read character.
  • a finite word is accepted if the last visited state is a final state.
  • An infinite word is accepted if at least one final state is visited infinitely often (Büchi acceptance criterion).
  • the automaton in Figure 4 accepts unspecified part inputs up to a fixed time, so here only finite words are considered.
  • the first section is not complete, for example, it does not define how the system should react when the user wants to log in (or log off) but already logged in (or logged out) ) or no status message has been received by the station at all. Furthermore, there is no definition of what should happen if there is no user input.
  • the complete machine is composed of the machines for the individual lines.
  • the consistency analysis described below shows, among other things, that the two sections are consistent in themselves, but have some conflicts among each other: If 5 clocks no status signal to port Is status , the second section asks for the output "report” Depending on the user input the first section, on the other hand, requires the output "on” or "off.” Another exemplary conflict situation results in the following input sequence
  • Section 2 requests that a confirmation be sent "ack" within the next 3 bars, whereas section 1 requests the signal to be “on” for the next 3 cycles in response to the multiple user request to register the station.
  • This machine lists both the inputs and the outputs produced at each edge, where the dot represents any character. For the input (e, e), the machine can thus output "on”, “e”, or "ack.” The state marked with a double circle is always reached when a specification violation occurs, in which case that no conflict occurs as long as no message (ie "e") is present at at least one input.
  • the automaton must answer "on" to the input (an, e) otherwise it will go into the forbidden state
  • a conflict can be recognized by the fact that the automaton is forced into the forbidden state, regardless of the output, ie there are none correct output and therefore implementation that meets the specification
  • the input (on, to) leads to a conflict because the machine can not answer correctly
  • the user would have to forward the user message to one, ie "to" Report, but also confirm the message of the station, so send "ack”.
  • the search for conflicts can be either entspre ⁇ sponding graph algorithms automate, or passing the projection of the total automaton on the inputs by and ver ⁇ like these machines with the machines of valid input as possible.

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Automation & Control Theory (AREA)
  • Stored Programmes (AREA)

Abstract

L'invention concerne un procédé de spécification d'une fonction de commande pour un système, la fonction de commande étant constituée d'au moins une réaction du système, par au moins une première valeur pour définir au moins une valeur d'entrée et au moins une deuxième valeur pour définir au moins une valeur de sortie, dans lequel la valeur d'entrée et la valeur de sortie sont liées pour donner une réaction du système. Un tableau généré selon le procédé de l'invention est constitué de plusieurs colonnes et lignes. Les colonnes sont établies par l'interface du système, c'est-à-dire que les colonnes sont subdivisées en une partie entrée qui comprend précisément une colonne pour chaque canal d'entrée et une partie sortie avec une colonne pour chaque canal de sortie. Chaque ligne contient la description d'une réaction du système par une suite de valeurs de sortie aux ports de sortie à une suite de valeurs d'entrée aux ports d'entrée. à cet effet, chaque cellule contient un élément régulier (étendu) qui décrit les informations d'entrée ou de sortie se trouvant à un moment au niveau du canal concerné. Les éléments réguliers dans les colonnes d'entrée décrivent les suites d'informations observées jusqu'à ce moment au niveau des canaux d'entrée. Les éléments réguliers dans les colonnes de sortie décrivent le comportement exigé comme réaction au niveau des canaux de sortie à partir du moment suivant t+1.
PCT/EP2008/007341 2008-09-08 2008-09-08 Procédé de spécification d'une fonction de commande WO2010025757A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/EP2008/007341 WO2010025757A1 (fr) 2008-09-08 2008-09-08 Procédé de spécification d'une fonction de commande

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/EP2008/007341 WO2010025757A1 (fr) 2008-09-08 2008-09-08 Procédé de spécification d'une fonction de commande

Publications (1)

Publication Number Publication Date
WO2010025757A1 true WO2010025757A1 (fr) 2010-03-11

Family

ID=40637006

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2008/007341 WO2010025757A1 (fr) 2008-09-08 2008-09-08 Procédé de spécification d'une fonction de commande

Country Status (1)

Country Link
WO (1) WO2010025757A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112415301A (zh) * 2020-10-27 2021-02-26 成都飞机工业（集团）有限责任公司 一种电子产品测试过程结构化描述方法

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
LEE D-T: "Evaluating real-time software specification languages", COMPUTER STANDARDS AND INTERFACES, ELSEVIER SEQUOIA. LAUSANNE, CH, vol. 24, no. 5, 1 November 2002 (2002-11-01), pages 395 - 409, XP004387758, ISSN: 0920-5489 *
STANLEY YOUNG ET AL: "Control of Discrete Event Systems Modeled with Deterministic Buchi Automata", PROCEEDINGS OF THE AMERICAN CONTROL CONFERENCE (ACC). CHICAGO, JUNE 24 19920624 NEW YORK, IEEE, US, 24 June 1992 (1992-06-24), pages 2814 - 2818, XP031431290, ISBN: 978-0-7803-0210-5 *
WAGNER F ED - INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS: "VFSM executable specification", PROCEEDINGS OF THE ANNUAL EUROPEAN CONFERENCE ON COMPUTER SYSTEMS AND SOFTWARE ENGINEERING (COMPEURO). THE HAGUE, MAY 4 - 8, 1992; [PROCEEDINGS OF THE ANNUAL EUROPEAN CONFERENCE ON COMPUTER SYSTEMS AND SOFTWARE ENGINEERING (COMPEURO)], LOS ALAMITOS,, vol. CONF. 6, 4 May 1992 (1992-05-04), pages 226 - 231, XP010028413, ISBN: 978-0-8186-2760-6 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112415301A (zh) * 2020-10-27 2021-02-26 成都飞机工业（集团）有限责任公司 一种电子产品测试过程结构化描述方法
CN112415301B (zh) * 2020-10-27 2022-07-15 成都飞机工业（集团）有限责任公司 一种电子产品测试过程结构化描述方法

Similar Documents

Publication Publication Date Title
EP0852759B1 (fr) Procede de conception pour systemes industriels et systemes de construction, et systeme de planification assiste par ordinateur a utiliser dans le cadre dudit procede
EP2330469B1 (fr) Procédé et environnement de développement destinés à produire un programme de commande complet exécutable
EP0966703B1 (fr) Procede d'analyse assistee par ordinateur de defaillances de capteurs et/ou d'actionneurs dans un systeme technique
EP2439691A1 (fr) Dispositif et procédé d'établissement mécanique d'un schéma de processus
DE102016102920A1 (de) Verfahren zur Konfiguration eines zum Testen eines elektronischen Steuergeräts eingerichteten Testgeräts
EP1005215B1 (fr) Procédé et système pour l'édition des données de configuration pour systèmes de télécommunication
EP0838054B1 (fr) Procede et dispositif de commande pour une commande graphique d'operations dans un systeme de gestion d'un reseau
EP2876512A1 (fr) Procédé pour générer automatiquement des connections entre composants d'un modèle d'un système technique
EP2433189B1 (fr) Procédé pour analyser des archives de messages et programme informatique correspondant pour générer un automate à états finis
EP1950635B1 (fr) Procédé destiné au fonctionnement d'un système d'automatisation
EP2126644B1 (fr) Procédé de transformation de schéma à contacts
WO2010025757A1 (fr) Procédé de spécification d'une fonction de commande
EP1506474A2 (fr) Procede de generation d'un programme d'automatisation
EP1183577B1 (fr) Procede de production d'un bloc de controle, et bloc de controle y relatif
EP3438774A1 (fr) Procédé permettant la mise à disposition de fonctions au sein d'un système d'automatisation industriel et système d'automatisation industriel
AT522186B1 (de) Computerimplementiertes Verfahren zur rechnergestützten Erzeugung eines ausführbaren Steuerungsprogramms zur Steuerung und/oder Regelung eines technischen Prozesses
EP1958101B1 (fr) Systeme et procede de verification automatique de resultats de conception
DE102004023634B4 (de) Verfahren zur Vollständigkeits- und Konsistenzprüfung einer Informationsbibliothek
EP1095321B1 (fr) Procede et dispositif pour etablir un projet de commande pour un processus entier
EP3575976A1 (fr) Procédé de détermination d'une topologie de connexion physique d'un appareil d'essai destiné à la mise au point d'appareil de commande
EP3987365B1 (fr) Routine d'apprentissage automatique pour une vérification de compatibilité
DE102005061386A1 (de) Verfahren zur Fehlerdiagnose
EP1376383A2 (fr) Mèthode de traitement de données d'entré et de sortie pour une analyse statistique et mèthode pour éliminer de données rédondantes
WO2015078601A1 (fr) Dispositif, procédé de génération automatique d'un modèle fem et régulateur
EP3745320A1 (fr) Procédé et dispositif de configuration optimale d'un appareil

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 08801917

Country of ref document: EP

Kind code of ref document: A1

DPE1 Request for preliminary examination filed after expiration of 19th month from priority date (pct application filed from 20040101)
NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 08801917

Country of ref document: EP

Kind code of ref document: A1