Search

Your search keyword '"Cabasino, Maria Paola"' showing total 93 results
Start Over Author "Cabasino, Maria Paola"
93 results on '"Cabasino, Maria Paola"'

3. Petri Nets with Time

Author

Bérard, Béatrice, Cabasino, Maria Paola, Di Febbraro, Angela, Giua, Alessandro, Seatzu, Carla, Seatzu, Carla, editor, Silva, Manuel, editor, and van Schuppen, Jan H., editor

Published
2013
Full Text
View/download PDF

4. Diagnosis of Petri Nets

Author

Cabasino, Maria Paola, Giua, Alessandro, Seatzu, Carla, Seatzu, Carla, editor, Silva, Manuel, editor, and van Schuppen, Jan H., editor

Published
2013
Full Text
View/download PDF

5. Introduction to Petri Nets

Author

Cabasino, Maria Paola, Giua, Alessandro, Seatzu, Carla, Seatzu, Carla, editor, Silva, Manuel, editor, and van Schuppen, Jan H., editor

Published
2013
Full Text
View/download PDF

50. Fault Diagnosis of Discrete-Event Systems Using Continuous Petri Nets.

Author

Mahulea, Cristian, Seatzu, Carla, Cabasino, Maria Paola, and Silva, Manuel

Subjects
DISCRETE systems, PETRI nets, DEBUGGING, LINEAR programming, COMPLEXITY (Philosophy), MATHEMATICAL optimization, LITERATURE reviews, SIMULATION methods & models, FLUIDIZATION, COMPUTATIONAL complexity
Abstract

When discrete-event systems are used to model systems with a large number of possible (reachable) states, many problems such as simulation, optimization, and control, may become computationally prohibitive because they require some enumeration of such states. A common way to effectively address this issue is fluidization. The goal of this paper is that of studying the effect of fluidization on fault diagnosis. In particular, we focus on the purely logic Petri net (PN) model that results in the untimed continuous PN model after fluidization. In accordance to most of the literature on discrete-event systems, we define three diagnosis states, namely N, U, and F, corresponding respectively to no fault, uncertain, and fault state. We prove that, given an observation, the resulting diagnosis state can be computed solving linear programming problems rather than integer programming problems as in the discrete case. The main advantage of fluidization is that it enables to deal with much more general PN structures. In particular, the unobservable subnet needs not be acyclic as in the discrete case. Moreover, the compact representation of the set of consistent markings using convex polytopes can be seen in some cases as an improvement in terms of computational complexity. [ABSTRACT FROM PUBLISHER]

Published
2012
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results