State Estimation of Timed Automata Under Partial Observation
In this article, we consider partially observable timed automata endowed with a single clock. A time interval is associated with each transition specifying at which clock values it may occur. In addition, a resetting condition associated to a transition specifies how the clock value is updated upon its occurrence. This work deals with the estimation of the current state given a timed observation, i.e., a succession of pairs of an observable event and the time instant at which the event has occurred. The problem of state estimation for a timed automaton is reduced to the reachability analysis of an associated zone automaton, which provides a purely discrete event description of the behavior of the timed automaton. An algorithm is formulated to provide an approach for state estimation of a timed automaton based on the assumption that the clock is reset upon the occurrence of each observable transition.
Authors
- Dimitri Lefebvre (ORCID: https://orcid.org/0000-0001-7060-756X)
- Carla Seatzu (ORCID: https://orcid.org/0000-0003-2014-352X)
- Alessandro Giua (ORCID: https://orcid.org/0000-0002-3859-9472)
- Zhiwu Li (ORCID: https://orcid.org/0000-0003-1547-5503)
- Chao Gao (ORCID: https://orcid.org/0009-0006-0185-9206)
Institutions
- Université Le Havre Normandie (FR)
- Xidian University (CN)
- University of Cagliari (IT)
- Groupe de Recherche en Electrotechnique et Automatique du Havre (FR)
Publication Details
- Journal
- IEEE Transactions on Automatic Control
- Published
- 2024-11-06
- DOI
- https://doi.org/10.1109/tac.2024.3492955
- Citations
- 6
- Primary Topic
- Petri Nets in System Modeling
- Type
- article
- Field-Weighted Citation Impact
- 2.17
Funders
- National Natural Science Foundation of China