Journal ArticleDOI
Discrete event diagnosis using labeled Petri nets. An application to manufacturing systems
TLDR
The approach is based on the notion of basis markings and justifications and it can be applied both to bounded and unbounded Petri nets whose unobservable subnet is acyclic, and it is shown that the most burdensome part of the procedure may be moved off-line.About:
This article is published in Control Engineering Practice.The article was published on 2011-09-01. It has received 160 citations till now. The article focuses on the topics: Stochastic Petri net & Petri net.read more
Citations
More filters
Journal ArticleDOI
Overview of fault diagnosis methods for Discrete Event Systems
Janan Zaytoon,Stéphane Lafortune +1 more
TL;DR: The aim of this paper is to review the state-of-the art of methods and techniques for fault diagnosis of Discrete Event Systems based on models that include faulty behaviour.
Journal ArticleDOI
Verification of State-Based Opacity Using Petri Nets
TL;DR: It is shown that both current-state and initial-state opacity problems in bounded Petri nets can be efficiently solved by using a compact representation of the reachability graph, called basis reachabilitygraph (BRG), which is practically efficient since the exhaustive enumeration of the Reachability space can be avoided.
Journal ArticleDOI
A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets
TL;DR: This paper analyzes the diagnosability properties of labeled Petri nets based on the analysis of the reachability/coverability graph of a special Petri net, called Verifier Net, that is built from the PetriNet model of the given system.
Journal ArticleDOI
On the history of diagnosability and opacity in discrete event systems
TL;DR: Historical remarks on key projects and papers that led to the development of a theory of event diagnosis for discrete event systems modeled by finite-state automata or Petri nets in the 1990s are presented.
Journal ArticleDOI
Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem
TL;DR: The firing of implicit transitions can be abstracted so that the reachability set of theNet can be completely characterized by a subset of reachable markings called basis makings, and the generalized version of the marking reachability problem in a Petri net can be solved by a practically efficient algorithm based on the basis reachability graph.
References
More filters
Journal ArticleDOI
Petri nets: Properties, analysis and applications
TL;DR: The author proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis, and one section is devoted to marked graphs, the concurrent system model most amenable to analysis.
Book
Introduction to Discrete Event Systems
TL;DR: This edition includes recent research results pertaining to the diagnosis of discrete event systems, decentralized supervisory control, and interval-based timed automata and hybrid automata models.
Journal ArticleDOI
Diagnosability of discrete-event systems
TL;DR: The approach to failure diagnosis presented in this paper is applicable to systems that fall naturally in the class of DES's; moreover, for the purpose of diagnosis, most continuous variable dynamic systems can be viewed as DES's at a higher level of abstraction.