Probabilistic state estimation for labeled continuous time Markov models with applications to attack detection

Dimitri Lefebvre
First
;
Carla Seatzu;Alessandro Giua
Last
2022-01-01

Abstract

This paper is about state estimation in a timed probabilistic setting. The main contribution is a general procedure to design an observer for computing the probabilities of the states for labeled continuous time Markov models as functions of time, based on a sequence of observations and their associated time stamps that have been collected thus far. Two notions of state consistency with respect to such a timed observation sequence are introduced and related necessary and sufficient conditions are derived. The method is then applied to the detection of cyber-attacks. The plant and the possible attacks are described in terms of a labeled continuous time Markov model that includes both observable and unobservable events, and where each attack corresponds to a particular subset of states. Consequently, attack detection is reformulated as a state estimation problem.
2022
2021
Inglese
32
1
65
88
24
Esperti anonimi
internazionale
scientifica
Finite state automata; Markov models; Observers; Cyber-attack detection
Lefebvre, DIMITRI JEAN EMMANUEL; Seatzu, Carla; Hadjicostis, Christoforos N.; Giua, Alessandro
1.1 Articolo in rivista
info:eu-repo/semantics/article
1 Contributo su Rivista::1.1 Articolo in rivista
262
4
partially_open
Files in This Item:
File Size Format  
22deds.pdf

Solo gestori archivio

Type: versione editoriale
Size 2.34 MB
Format Adobe PDF
2.34 MB Adobe PDF & nbsp; View / Open   Request a copy
22deds_up_draft.pdf

Open Access from 01/04/2023

Type: versione post-print
Size 705.04 kB
Format Adobe PDF
705.04 kB Adobe PDF View/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Questionnaire and social

Share on:
Impostazioni cookie