Name
Abstract | ||
|---|---|---|
Continuous Petri nets are an approximation of discrete Petri nets introduced to cope with the state explosion problem typical of discrete event systems. In this paper we start the problem of state estimation for timed continuous Petri nets with finite server semantics. Under the assumption that no observation is available, and thus the set of consistent markings only depends on the time elapsed, we study the observation based on the time-reachability analysis. I. INTRODUCTION State estimation is a fundamental issue in system theory. Reconstructing the state of a system from available mea- surements may be considered as a self-standing problem, or it can be seen as a pre-requisite for solving a problem of different nature, such as stabilization, state-feedback control, diagnosis, filtering, and others. Despite the fact that the notions of state estimation, observability and observer are well understood in time driven systems, in the area of discrete event and of hybrid systems there are relatively few works addressing these topics and several problems are still open. In the case of discrete event systems modeled by (discrete) Petri net models, there exist different frameworks for observ- ability. An approach for reconstructing the initial marking (assumed only partially known) from the observation of transition firings was presented (8) and later extended to the observation and control of timed nets (9). In other works it was assumed that some of the transitions of the net are not observable (5) or undistinguishable (7), thus complicating the observation problem. Benasser (4) has studied the possibility of defining the set of markings reached firing a "partially specified" step of transitions using logical formulas, without having to enumerate this set. Ramirez et al. (12) have discussed the problem of estimating the marking of a Petri net using a mix of transition and place observations. Ru and Hadjicostis (14) have presented an approach for the state estimation of discrete event systems modeled by labeled Petri nets. Recently, a particular hybrid model based on Petri nets has received some attention. This model is called continuous Petri net (contPN) (6), (15). It can be seen as a relaxation of Petri nets where the constraints that markings and transitions firings are integer are removed. There exist two interesting |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/CDC.2007.4435036 | CDC |
Keywords | Field | DocType |
Petri nets,discrete event systems,reachability analysis,state estimation,discrete Petri nets,discrete event systems,finite server semantics,state estimation,state explosion problem,time-reachability analysis,timed continuous Petri nets | Mathematical optimization,Petri net,Computer science,Theoretical computer science,Stochastic Petri net,Process architecture,Semantics,Distributed computing | Conference |
ISSN | Citations | PageRank |
0191-2216 | 2 | 0.38 |
References | Authors | |
11 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cristian Mahulea | 1 | 161 | 19.50 |
| Maria Paola Cabasino | 2 | 318 | 23.10 |
| Alessandro Giua | 3 | 1836 | 199.57 |
| Carla Seatzu | 4 | 700 | 67.51 |