Logic Controllers Dependability Verification Using a Plant Model

Machado, José; Denis, B.; Lesage, Jean-Jacques; Faure, Jean-Marc; Silva, Jaime C. L. Ferreira Da

doi:10.3182/20060926-3-pl-4904.00007

Cited by 35 publications

(29 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Une fois programmé, le contrôleur à tester est déconnecté de son atelier de programmation pour toute la durée du test. Le code est implanté dans l'API en langage Structured Text obtenu automatiquement à partir de la spécification Grafcet en suivant la méthode proposée dans (Machado et al, 2006). Cette solution nous permet, soit de générer un code conforme à la spécification, soit d'introduire artificiellement des erreurs de programmation.…”

Section: Réalisation D'un Test De Conformitéunclassified

Test exhaustif de contrôleurs logiques spécifiés en Grafcet Apports et limites d'une modélisation par machines de Mealy

Provost¹,

Roussel²,

Faure³

2009

ournal Européen des Systèmes Automatisés

Self Cite

View full text Add to dashboard Cite

RÉSUMÉ. Utilisés pour la commande des systèmes critiques, les contrôleurs logiques doivent faire l'objet de tests rigoureux pour garantir le respect du fonctionnement attendu. Dans ce but, nous proposons une méthode spécifique permettant un test de conformité exhaustif vis-à-vis de spécifications en Grafcet. Cette méthode s'appuie sur les travaux de la communauté informatique relatifs au test à partir de machines de Mealy. La mise en oeuvre sur des systèmes réels a mis en évidence certaines limites de telles approches pour le test de contrôleurs logiques.ABSTRACT. Logic controllers can be used for control of critical systems; in this case, they must be rigorously tested to ensure that they behave as specified. To meet this objective, this paper proposes a specific method to obtain an exhaustive conformance test for specifications given in SFC. This method relies on results of the computer science community on test of Mealy machines. Implementation on real systems has revealed some limitations of such approaches in the case of logic controllers, however.MOTS-CLÉS : Test de conformité, Test piloté par le modèle, Grafcet, Machine de Mealy, Contrô-leurs logiques.

show abstract

Section: Réalisation D'un Test De Conformitéunclassified

Test exhaustif de contrôleurs logiques spécifiés en Grafcet Apports et limites d'une modélisation par machines de Mealy

Provost¹,

Roussel²,

Faure³

2009

ournal Européen des Systèmes Automatisés

Self Cite

View full text Add to dashboard Cite

show abstract

“…The first step is the formalization of requirements within an algebraic description. Requirements expressed with a state model can directly be translated into recurrent Boolean equations, thanks to the algorithm proposed by Machado et al (2006). Generic formalization of some requirements (change of operation modes, emergency management...) are also proposed for helping the designer to formalize "standard" requirements given in textual form (examples are given in Section 5.2).…”

Section: Overview Of Our Methodsmentioning

confidence: 99%

Algebraic synthesis of logical controllers despite inconsistencies in specifications

Roussel

Lesage

2012

IFAC Proceedings Volumes

View full text Add to dashboard Cite

This paper deals with the problem of consistency of the requirements which are the starting point of controller synthesis methods for Discrete Event Systems (DES). In previous papers, an algebraic synthesis method for logical systems has been proposed. This method includes a theorem allowing the proof of consistency of the set of specifications. In this paper, we show that if inconsistencies are detected, the conditions of these inconsistencies can be given to the designer. It is therefore possible for the designer to propose priority rules between the involved requirements allowing the correction of incoherent specifications. Both the mathematical and the methodological aspects of this work are presented. In an illustrative purpose, the case study of a hydraulic press is developed.

show abstract

“…Some of them ( [2] and [19] for example) start from a model in SFC 2 language [7]; however this language is an implementation and not a specification language (the interested reader is referred to [16] for further details on the semantic differences between Grafcet and SFC); this explains why these approaches were not selected for this work. On the opposite, [11] presents a method to translate an untimed Grafcet specification into three sets of algebraic equations:…”

Section: Controller Modelmentioning

confidence: 99%

Coupling timed plant and controller models with urgent transitions without introducing deadlocks

Perin

Faure

2012

Proceedings of 2012 IEEE 17th International Conference on Emerging Technologies &Amp; Factory Automation (ETFA 2012)

Self Cite

View full text Add to dashboard Cite

This paper focuses on timed models which represent closed-loop systems composed of a plant and a logic controller. Both the plant and controller models are described in a formalism where urgent transitions are possible, to avoid non-realistic evolutions, and without deadlock when they are separated.It is first shown that deadlocks may occur in the plant model as soon as both models are coupled. To solve this issue, shared variables which model the changes of the inputs of the controller are defined and introduced in some actions of the plant model as well as in some guards of the controller model; the aim of these variables is to authorize evolutions of the controller only when at least one input has changed. This solution removes the previously pinpointed deadlocks and guarantees the reactivity of the controller.

show abstract

Logic Controllers Dependability Verification Using a Plant Model

Cited by 35 publications

References 10 publications

Test exhaustif de contrôleurs logiques spécifiés en Grafcet Apports et limites d'une modélisation par machines de Mealy

Test exhaustif de contrôleurs logiques spécifiés en Grafcet Apports et limites d'une modélisation par machines de Mealy

Algebraic synthesis of logical controllers despite inconsistencies in specifications

Coupling timed plant and controller models with urgent transitions without introducing deadlocks

Contact Info

Product

Resources

About