Alessandro Giua

Learn More
We consider in this paper first-order hybrid Petri Nets, a model that consists of continuous places holding fluid, discrete places containing a nonnegative integer number of tokens, and transitions, either discrete or continuous. We set up a linear algebraic formalism to study the first-order continuous behavior of this model and show how its control can be(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 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)
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)
HYPENS is an open source tool to simulate timed discrete, continuous and hybrid Petri nets. It has been developed in Matlab to allow designer and user to take advantage of several functions and structures already defined in Matlab, such as optimization routines, stochastic functions, matrices and arrays, etc. The tool can also be easily interfaced with(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)
In this paper we deal with the problem of identifying a Petri net system, given a finite language generated by it. First we consider the problem of identifying a free labeled Petri net system, i.e., all transition labels are distinct. The set of transitions and the number of places is assumed to be known, while the net structure and the initial marking are(More)
This paper addresses the problem of enforcing generalized mutual exclusion constraints on a Petri net plant. Firstly, we replace the classical partition of the event set into controllable and uncontrollable events from supervisory control theory, by associating a control and observation cost to each event. This leads naturally to formulate the supervisory(More)