Abstract
Fault identification studies in the Discrete Event Systems literature are typically model-based and require knowledge of the structure of the system, including the nature (and behavior) of the possible faults. In this paper we consider this problem within the framework of Petri nets assuming knowledge of the nominal (fault-free) system model but removing the requirement that the nature (or behavior) of the faults is known. Specifically, we consider a setting where faults are unobservable and use sequences of observations to infer the structure and behavior of faults. The resulting method recognizes the structure of the faulty system using knowledge of the structure of the fault-free system, and the projection of the faulty system language on the set of non-faulty events, which are assumed to be observable. Two problem formulations can be given: (i) fault identification when the resulting faulty Petri net system is required to generate all observed sequences, while no constraint is imposed on sequences that are not observed; (ii) fault synthesis where the resulting faulty Petri net system is required to only generate all observed sequences, while all sequences that are not observed cannot actually occur. We show that a solution to the first problem can always be easily found, while the synthesis problem is not trivial at all and we solve it via an approach based on linear integer programming, which allows us to take into account physical constraints on the system in terms of possible and not possible interactions in the system.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
A preliminary and partial version of this paper was presented in Cabasino et al. (2008).
Note that a tradeoff should be made when choosing Γ i : a large value of Γ i makes the linearization less restrictive but results in higher computational complexity. We assume here that a tentative value of Γ i is initially taken, and it is then increased if the resulting set of linear constraints is infeasible.
References
Badouel E, Bernardinello L, Darondeau P (1995) Polynomial algorithms for the synthesis of bounded nets. In: Lecture notes in computer science, vol 915. pp 647–679
Badouel E, Darondeau P (1998) Theory of regions. In: Lecture notes in computer science, vol 1491. pp 529–586
Basile F, Chiacchio P, Coppola J, De Tommasi G (2011). Identification of Petri nets using timing information. In: 3rd international workshop on dependable control of discrete systems. Saarbrücken, Germany
Bemporad A, Morari M (1999) Control of systems integrating logic, dynamics and constraints. Automatica 35(3):407–429
Bergenthum R, Desel J, Lorenz R, Mauser S (2008). Synthesis of Petri nets from infinite partial languages. In: Proceedings 8th international conference on application of concurrency to system design. Xi’an
Cabasino MP, Darondeau P, Fanti MP, Seatzu C (2014) Model identification and synthesis of discrete-event systems. Contemporary issues in system science and engineering. IEEE/Wiley Press Book Series
Cabasino MP, Giua A, Hadjicostis CN, Seatzu C (2008). Fault model identification with Petri nets. In: Proceedings 9th IFAC work. on discrete event systems. Gotheborg
Cabasino MP, Giua A, Seatzu C (2007) Identification of Petri nets from knowledge of their language. Discret. Events Dyn Syst 17(4):447–474
Carmona J, Cortadella J, Kishinevsky A, Lavagno L, Kondratyev A, Yakovlev A (2008) A symbolic algorithm for the synthesis of bounded Petri nets. In: Proceedings international conference on application and theory of Petri nets and other models of concurrency. Xian
Corona D, Giua A, Seatzu C (2007) Marking estimation of Petri nets with silent transitions. IEEE Trans Autom Control 52(9):1695–1699
Cortadella J, Kishinevsky M, Lavagno L, Yakovlev A (1998) Deriving Petri nets from finite transition systems. IEEE Trans Comput 47(8):859–882
Dotoli M, Fanti MP, Mangini AM (2008) Real time identification of discrete event systems using Petri nets. Automatica 44(5):1209–1219
Dotoli M, Fanti MP, Mangini AM, Ukovich W (2009) Identification of DES unobservable behaviour by Petri nets. In: Proceedings 2nd IFAC workshop on dependable control of discrete systems. Bari
Ehrenfeucht A, Rozenberg G (1989) Partial (Set) 2-Structures - Part 1 and Part 2. Acta Informatica 27(4):315–368
Lorenz R, Juhás G, Mauser S (2007) How to synthesize nets from languages – a survey. In: Proceedings 2007 winter simulation conference. Washington
Lorenz R, Juhás G (2006) Towards synthesis of Petri nets from scenarios. In: Lecture notes in computer science, vol 4024. pp 302–321
Meda-Campaña ME, López-Mellado E (2002) Incremental synthesis of Petri net models for identification of discrete event systems. In Proceedings 41th IEEE conference on decision and control. Las Vegas
Meda-Campaña ME, López-Mellado E (2003). Required event sequences for identification of discrete event systems. In: Proceedings 42th IEEE conference on decision and control. Maui, pp 3778–3783
Murata T (1989) Petri nets: properties, analysis and applications. Proc IEEE 77(4):541–580
Acknowledgments
This work falls under the Cyprus Research Promotion Foundation (CRPF) Framework Programme for Research, Technological Development and Innovation 2009-2010 (CRPF’s FP 2009–2010), co-funded by the Republic of Cyprus and the European Regional Development Fund, and specifically under Grant TπE/OPIZO/0609(BE)/08. Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the authors and do not necessarily reflect the views of CRPF. This work has been partially supported by RAS project (L.R. n. 7/2007, Year 2010). M.P. Cabasino gratefully acknowledges Sardinia Regional Government for the financial support of her Post Doc fellowship (P.O.R. Sardegna F.S.E. Operational Programme of the Autonomous Region of Sardinia, European Social Fund 2007-2013 - Axis IV Human Resources, Objective l.3, Line of Activity l.3.1.).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Cabasino, M.P., Giua, A., Hadjicostis, C.N. et al. Fault model identification and synthesis in Petri nets. Discrete Event Dyn Syst 25, 419–440 (2015). https://doi.org/10.1007/s10626-014-0190-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10626-014-0190-x