Learn More
— In this paper we present an efficient approach for the fault detection of discrete event systems using Petri nets. We assume that some of the transitions of the net are unobservable, including all those transitions that model faulty behaviors. We prove that the set of all possible firing sequences corresponding to a given observation can be described as(More)
This paper surveys recent research on the application of Petri net models to the analysis and synthesis of controllers for discrete event systems. Petri nets have been used extensively in applications such as automated manufacturing, and there exists a large body of tools for qualitative and quantitative analysis of Petri nets. The goal of Petri net(More)
In this paper we discuss the problem of estimating the marking of a Place/Transition net based on event observation. We assume that the net structure is known while the initial marking is totally or partially unknown. We give algorithms to compute a marking estimate that is a lower bound of the actual marking. The special structure of Petri nets allows us(More)
This paper addresses the optimal control problem of timed continuous Petri nets under infinite servers semantics. In particular, our goal is to find a control input optimizing a certain cost function that permits the evolution from an initial marking (state) to a desired steady-state. The solution we propose is based on a particular discrete-time(More)
Recently a study has been presented for suboptimal supervisory control of Petri nets via monitor (control) places, in the presence of uncontrollable transitions. To enforce a generalized mutual exclusion constraint (GMEC) suboptimally on a plant Petri net with uncontrollable transitions, a set of monitor places has been provided to choose from. There are(More)
— In this paper we deal with the problem of estimating the marking of a labeled Petri net system based on the observation of transitions labels. In particular, we assume that a certain number of transitions are labeled with the empty string ε, while a different label taken from a given alphabet is assigned to all the other transitions. Transitions labeled(More)
—This paper deals with optimal control of switched piecewise affine autonomous systems, where the objective is to minimize a performance index over an infinite time horizon. We assume that the switching sequence has a finite length, and that the decision variables are the switching instants and the sequence of operating modes. We present two different(More)