Linear programming techniques for the identification of place/transition nets

Cabasino, Maria Paola; Giua, Alessandro; Seatzu, Carla

doi:10.1109/cdc.2008.4739039

Cited by 8 publications

(6 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [6], [7] methods based on Integer Linear Programming (ILP) are proposed; they allow obtaining accurate Petri nets from a set of transition sequences that can be fired from the initial marking. These methods require the a priori knowledge of the set of transitions and of the number of places, what makes difficult their application to identify real DES as black boxes, since the only available information after observation is the evolution of input and outputs signals exchanged between the control system and the plant.…”

Section: A Related Workmentioning

confidence: 99%

A Black-Box Identification Method for Automated Discrete-Event Systems

Estrada-Vargas

López-Mellado

Lesage

2017

IEEE Trans. Automat. Sci. Eng.

View full text Add to dashboard Cite

This paper deals with the identification of discrete event manufacturing systems that are automated using a programmable logic controller (PLC). The behavior of the closed loop system (PLC and Plant) is observed during its operation and is represented by a single long sequence of observed input/output (I/O) signals vectors. The proposed method follows a black-box and passive identification approach that allows addressing large and complex industrial DES and yields compact and expressive interpreted Petri net (IPN) models. It consists of two complementary stages; the first one obtains, from the I/O sequence, the reactive part of the model composed by observable places and transitions. The I/O sequence is also mapped into a sequence of the created transitions, from which the second stage builds the non observable part of the model including places that ensure the reproduction of the observed input output sequence. This method, based on polynomial-time algorithms on the size of the input data, has been implemented as a software tool that generates and draws the IPN model; it has been tested with input/output sequences obtained from real systems in operation. The tool is described and its application is illustrated through a case study. Note to practitioners-Automated modeling of controlled discrete manufacturing systems can be achieved by efficient identification algorithms that cope with large and complex plants performing concurrent and repetitive tasks a priori unknown. The black-box identification procedure processes an input/output sequence recorded during the system functioning for a long period of time, and then yields a comprehensive model of the closed-loop controlled system; this model approximates closely the actual behavior of the compound system controllerplant. A tool based on identification algorithms constitutes an excellent resource for computer-aided reverse engineering of controlled manufacturing systems. The method proposed herein allows processing sequences composed by thousands of I/O vectors in few seconds.

show abstract

Section: A Related Workmentioning

confidence: 99%

A Black-Box Identification Method for Automated Discrete-Event Systems

Estrada-Vargas

López-Mellado

Lesage

2017

IEEE Trans. Automat. Sci. Eng.

View full text Add to dashboard Cite

show abstract

“…Denition 7.4 [7] Given A ∈ R m×n and b ∈ R m , consider the linear constraint set: The set C(A, b) is called:…”

Section: Procedures To Determine K In the Case Of Diagnosability In K mentioning

confidence: 99%

“…Proposition 7.6 [7] If a CS is ideal and rational, then it has a feasible solution if and only if it has a feasible integer solution.…”

Section: Procedures To Determine K In the Case Of Diagnosability In K mentioning

confidence: 99%

A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets

Cabasino

Giua

Lafortune

et al. 2012

IEEE Trans. Automat. Contr.

140

View full text Add to dashboard Cite

In this paper we analyze the diagnosability properties of labeled Petri nets. We consider the standard notion of diagnosability of languages, requiring that every occurrence of an unobservable fault event be eventually detected, as well as the stronger notion of diagnosability in K steps, where the detection must occur within a xed bound of K event occurrences after the fault. We give necessary and sucient conditions for these two notions of diagnosability for both bounded and unbounded Petri nets and then present an algorithmic technique for testing the conditions based on linear programming. Our approach is novel and based on the analysis of the reachability/coverability graph of a special Petri net, called Verier Net, that is built from the Petri net model of the given system. In the case of systems that are diagnosable in K steps, we give a procedure to compute the bound K. To the best of our knowledge, this is the rst time that necessary and sucient conditions for diagnosability and diagnosability in K steps of labeled unbounded Petri nets are presented.

show abstract

“…The works in [1], [2] obtain a Petri net system from the knowledge of the language it generates, i.e. the set of transition sequences that can be fired from the initial marking.…”

Section: A Related Workmentioning

confidence: 99%

Identification of industrial automation systems: Building compact and expressive Petri Net models from observable behavior

Estrada-Vargas

Lesage

López-Mellado

2012

2012 American Control Conference (ACC)

View full text Add to dashboard Cite

Abstract-The paper deals with black-box identification of industrial automated discrete manufacturing systems. The problem of obtaining Petri net (PN) models from the observable behavior, expressed as a sequence of input-output vectors, is addressed. First the problem is stated: important issues to handle in systems automated by Programmable Logic Controllers that cannot be dealt by other methods are detailed. Then a novel method is presented; it focuses on building a compact and expressive representation of the observable part of the model which allows consequently the construction of a reduced complete Interpreted PN describing both observable and unobservable behavior.

show abstract

Linear programming techniques for the identification of place/transition nets

Cited by 8 publications

References 14 publications

A Black-Box Identification Method for Automated Discrete-Event Systems

A Black-Box Identification Method for Automated Discrete-Event Systems

A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets

Identification of industrial automation systems: Building compact and expressive Petri Net models from observable behavior

Contact Info

Product

Resources

About