Error- and Tamper-Tolerant State Estimation for Discrete Event Systems under Cost Constraints

This paper deals with the state estimation problem in discrete-event systems modeled with nondeterministic finite automata, partially observed via a sensor measuring unit whose measurements (reported observed symbols) may be vitiated by a malicious attacker. The attacks considered in this paper incl...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on automatic control Vol. 68; no. 11; pp. 1 - 8
Main Authors Li, Yuting, Hadjicostis, Christoforos N., Wu, Naiqi, Li, Zhiwu
Format Journal Article
LanguageEnglish
Published New York IEEE 01.11.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text
ISSN0018-9286
1558-2523
DOI10.1109/TAC.2023.3239590

Cover

Abstract This paper deals with the state estimation problem in discrete-event systems modeled with nondeterministic finite automata, partially observed via a sensor measuring unit whose measurements (reported observed symbols) may be vitiated by a malicious attacker. The attacks considered in this paper include arbitrary deletions, insertions, or substitutions of observed symbols by taking into account a bounded number of attacks or, more generally, a total cost constraint (assuming that each deletion, insertion, or substitution bears a positive cost to the attacker). We provide a characterization of the sequences of symbols that match the received sequence of possibly corrupted symbols, and subsequently use them to recursively perform tamper-tolerant state estimation subject to cost constraints. Each step of the recursive state estimation procedure has complexity of <inline-formula><tex-math notation="LaTeX">O(|X||\Sigma |C)</tex-math></inline-formula>, where <inline-formula><tex-math notation="LaTeX">|X|</tex-math></inline-formula> (<inline-formula><tex-math notation="LaTeX">|\Sigma |</tex-math></inline-formula>) is the number of states (events) of the given finite automaton and <inline-formula><tex-math notation="LaTeX">C</tex-math></inline-formula> is the maximum total cost that is allowed for all deletions, insertions, and substitutions.
AbstractList This paper deals with the state estimation problem in discrete-event systems modeled with nondeterministic finite automata, partially observed via a sensor measuring unit whose measurements (reported observed symbols) may be vitiated by a malicious attacker. The attacks considered in this paper include arbitrary deletions, insertions, or substitutions of observed symbols by taking into account a bounded number of attacks or, more generally, a total cost constraint (assuming that each deletion, insertion, or substitution bears a positive cost to the attacker). We provide a characterization of the sequences of symbols that match the received sequence of possibly corrupted symbols, and subsequently use them to recursively perform tamper-tolerant state estimation subject to cost constraints. Each step of the recursive state estimation procedure has complexity of <inline-formula><tex-math notation="LaTeX">O(|X||\Sigma |C)</tex-math></inline-formula>, where <inline-formula><tex-math notation="LaTeX">|X|</tex-math></inline-formula> (<inline-formula><tex-math notation="LaTeX">|\Sigma |</tex-math></inline-formula>) is the number of states (events) of the given finite automaton and <inline-formula><tex-math notation="LaTeX">C</tex-math></inline-formula> is the maximum total cost that is allowed for all deletions, insertions, and substitutions.
This article deals with the state estimation problem in discrete-event systems modeled with nondeterministic finite automata, partially observed via a sensor measuring unit whose measurements (reported observed symbols) may be vitiated by a malicious attacker. The attacks considered in this article include arbitrary deletions, insertions, or substitutions of observed symbols by taking into account a bounded number of attacks or, more generally, a total cost constraint (assuming that each deletion, insertion, or substitution bears a positive cost to the attacker). We provide a characterization of the sequences of symbols that match the received sequence of possibly corrupted symbols, and subsequently use them to recursively perform tamper-tolerant state estimation subject to cost constraints. Each step of the recursive state estimation procedure has complexity of [Formula Omitted], where [Formula Omitted] ([Formula Omitted]) is the number of states (events) of the given finite automaton and [Formula Omitted] is the maximum total cost that is allowed for all deletions, insertions, and substitutions.
Author Hadjicostis, Christoforos N.
Li, Yuting
Wu, Naiqi
Li, Zhiwu
Author_xml – sequence: 1
  givenname: Yuting
  orcidid: 0000-0001-9748-0247
  surname: Li
  fullname: Li, Yuting
  organization: Institute of Systems Engineering, Macau University of Science and Technology, Taipa, Macau, SAR China
– sequence: 2
  givenname: Christoforos N.
  orcidid: 0000-0002-1706-708X
  surname: Hadjicostis
  fullname: Hadjicostis, Christoforos N.
  organization: Department of Electrical and Computer Engineering, University of Cyprus, Nicosia, Cyprus
– sequence: 3
  givenname: Naiqi
  orcidid: 0000-0001-6782-458X
  surname: Wu
  fullname: Wu, Naiqi
  organization: Institute of Systems Engineering, Macau University of Science and Technology, Taipa, Macau, SAR China
– sequence: 4
  givenname: Zhiwu
  orcidid: 0000-0001-9748-0247
  surname: Li
  fullname: Li, Zhiwu
  organization: Institute of Systems Engineering, Macau University of Science and Technology, Taipa, Macau, SAR China
BookMark eNp9kMtLAzEQxoNUsK3ePXhY8Lw1j002OZZaH1Dw4HqUkGYnsKVNapIK_e_dtR7Eg5cZZvi-efwmaOSDB4SuCZ4RgtVdM1_MKKZsxihTXOEzNCacy5JyykZojDGRpaJSXKBJSpu-FFVFxuh9GWOIZWF8WzRmt4dYNmEL0fhcvGaToVim3O1M7oIvXIjFfZdshKH_CYPmmDLsUnHwLcRiEVLug085ms7ndInOndkmuPrJU_T2sGwWT-Xq5fF5MV-VllaMlTUnQta0Vra2lFlmeX-ebGVbMVtTpwwHzqB2lbSCOiccsYI5ZdeqArFeOzZFt6e5-xg-DpCy3oRD9P1KTaWkvKaiJr0Kn1Q2hpQiOL2P_WvxqAnWA0TdQ9QDRP0DsbeIPxbb5W8Yw4fb_4w3J2MHAL_2YFZJKtkXQzGAnw
CODEN IETAA9
CitedBy_id crossref_primary_10_1016_j_automatica_2024_111971
crossref_primary_10_1109_JAS_2024_124680
crossref_primary_10_1109_TASE_2024_3416821
crossref_primary_10_3389_fphy_2023_1185103
Cites_doi 10.1109/CDC.2017.8264281
10.1109/ACC.2010.5530533
10.1007/s13235-018-0285-3
10.1016/j.neucom.2017.10.009
10.1007/s10207-008-0058-x
10.1109/CDC.2007.4434515
10.1109/9.412626
10.1109/TASE.2020.3001356
10.1109/TAC.2012.2185881
10.1016/j.sysconle.2018.07.008
10.1016/j.automatica.2017.09.028
10.1109/TCYB.2018.2843358
10.1109/ACC.2008.4586649
10.1007/978-3-030-30821-6
10.1002/0470045345
10.1023/A:1024007808984
10.1109/WODES.2002.1167685
10.1109/TCNS.2019.2915024
10.1016/j.ins.2013.05.033
10.23919/ACC.2017.7963440
10.1023/A:1008335115538
10.1109/CDC.2008.4738646
10.1016/j.automatica.2012.09.017
10.1137/0325013
10.1016/j.automatica.2008.05.025
10.1109/TAC.2007.910713
10.21236/ADA636482
10.1109/PROC.1973.9030
10.1109/TAC.2009.2039548
10.3182/20110828-6-IT-1002.02665
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
DOI 10.1109/TAC.2023.3239590
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore digital library
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-2523
EndPage 8
ExternalDocumentID 10_1109_TAC_2023_3239590
10034828
Genre orig-research
GrantInformation_xml – fundername: Science and Technology Development Fund, MSAR
  grantid: 0064/2021/A2
GroupedDBID -~X
.DC
0R~
29I
4.4
5GY
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
ACNCT
AENEX
AGQYO
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
F5P
HZ~
IFIPE
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
RIA
RIE
RNS
TAE
TN5
~02
3EH
5VS
AAYXX
AETIX
AGSQL
AI.
AIBXA
ALLEH
CITATION
EJD
H~9
IAAWW
IBMZZ
ICLAB
IDIHD
IFJZH
VH1
VJK
7SC
7SP
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c2433-751687279c7c23c3c50168d8d43c72f9a5e53e7f48c62ff6f1c63f9cb94e6bbf3
IEDL.DBID RIE
ISSN 0018-9286
IngestDate Mon Jun 30 10:21:38 EDT 2025
Thu Apr 24 22:55:48 EDT 2025
Wed Oct 01 04:16:01 EDT 2025
Wed Aug 27 02:18:20 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 11
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c2433-751687279c7c23c3c50168d8d43c72f9a5e53e7f48c62ff6f1c63f9cb94e6bbf3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-9748-0247
0000-0002-1706-708X
0000-0001-6782-458X
0000-0003-1547-5503
PQID 2882572671
PQPubID 85475
PageCount 8
ParticipantIDs crossref_primary_10_1109_TAC_2023_3239590
crossref_citationtrail_10_1109_TAC_2023_3239590
ieee_primary_10034828
proquest_journals_2882572671
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2023-11-01
PublicationDateYYYYMMDD 2023-11-01
PublicationDate_xml – month: 11
  year: 2023
  text: 2023-11-01
  day: 01
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on automatic control
PublicationTitleAbbrev TAC
PublicationYear 2023
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref12
ref15
ref14
ref30
ref11
ref33
ref10
ref32
ref1
ref17
ref16
ref19
ref18
khanna (ref24) 1973
ref23
ref26
ref25
ref20
ref22
ref21
ref28
ref27
ref29
cassandras (ref31) 2009
ref8
ref7
ref9
ref4
ref3
ref6
ref5
monticelli (ref2) 2012
References_xml – ident: ref20
  doi: 10.1109/CDC.2017.8264281
– ident: ref29
  doi: 10.1109/ACC.2010.5530533
– ident: ref15
  doi: 10.1007/s13235-018-0285-3
– ident: ref26
  doi: 10.1016/j.neucom.2017.10.009
– ident: ref11
  doi: 10.1007/s10207-008-0058-x
– ident: ref12
  doi: 10.1109/CDC.2007.4434515
– ident: ref5
  doi: 10.1109/9.412626
– ident: ref32
  doi: 10.1109/TASE.2020.3001356
– ident: ref30
  doi: 10.1109/TAC.2012.2185881
– ident: ref10
  doi: 10.1016/j.sysconle.2018.07.008
– ident: ref16
  doi: 10.1016/j.automatica.2017.09.028
– ident: ref27
  doi: 10.1109/TCYB.2018.2843358
– year: 2009
  ident: ref31
  publication-title: Introduction to Discrete Event Systems
– ident: ref22
  doi: 10.1109/ACC.2008.4586649
– ident: ref4
  doi: 10.1007/978-3-030-30821-6
– year: 2012
  ident: ref2
  publication-title: State Estimation in Electric Power Systems A Generalized Approach
– ident: ref1
  doi: 10.1002/0470045345
– ident: ref7
  doi: 10.1023/A:1024007808984
– ident: ref23
  doi: 10.1109/WODES.2002.1167685
– ident: ref25
  doi: 10.1109/TCNS.2019.2915024
– ident: ref13
  doi: 10.1016/j.ins.2013.05.033
– ident: ref21
  doi: 10.23919/ACC.2017.7963440
– ident: ref6
  doi: 10.1023/A:1008335115538
– ident: ref14
  doi: 10.1109/CDC.2008.4738646
– ident: ref19
  doi: 10.1016/j.automatica.2012.09.017
– ident: ref3
  doi: 10.1137/0325013
– year: 1973
  ident: ref24
  article-title: Sampling and transmission policies for controlled markov processes with costly communication
– ident: ref8
  doi: 10.1016/j.automatica.2008.05.025
– ident: ref9
  doi: 10.1109/TAC.2007.910713
– ident: ref28
  doi: 10.21236/ADA636482
– ident: ref33
  doi: 10.1109/PROC.1973.9030
– ident: ref17
  doi: 10.1109/TAC.2009.2039548
– ident: ref18
  doi: 10.3182/20110828-6-IT-1002.02665
SSID ssj0016441
Score 2.4969707
Snippet This paper deals with the state estimation problem in discrete-event systems modeled with nondeterministic finite automata, partially observed via a sensor...
This article deals with the state estimation problem in discrete-event systems modeled with nondeterministic finite automata, partially observed via a sensor...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1
SubjectTerms Automata
Costs
Data tampering
Discrete event systems
Discrete-event system
Information corruption
Least-cost error sequence
Measurement units
Observers
Sensor systems
Sensors
State estimation
Symbols
Title Error- and Tamper-Tolerant State Estimation for Discrete Event Systems under Cost Constraints
URI https://ieeexplore.ieee.org/document/10034828
https://www.proquest.com/docview/2882572671
Volume 68
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Xplore digital library
  customDbUrl:
  eissn: 1558-2523
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0016441
  issn: 0018-9286
  databaseCode: RIE
  dateStart: 19630101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3NS8MwFA-6kx78nDi_yMGLh9Q2n81xzA0R9DTBi5Q2fQFxrNJ1F_96k7QbQ1G8lZKUR37J--jL7z2Erh2kCmJQpEySgnjaLClcaE1ELCF29i2muWcjPz7J-2f-8CJeOrJ64MIAQLh8BpF_DLn8sjJL_6vMnfDY12JJt9G2SmVL1lqnDLxhb9WuO8E0XeckY307HY4i3yY8YpRp4dXvhg0KTVV-aOJgXib76GklWHur5D1aNkVkPr_VbPy35Ador3M08bDdGYdoC-ZHaHej_OAxeh3XdVUTnM9LPM2d_1yTaTUDZ70aHJxQPHYKoOU2Yufc4rs3p2TAv_e3JHFX7Rx7HlqNR9Wiwb7_Z-g60Sz66Hkyno7uSddugRjKGSNKJDJ17ow2ylBmmBFuUdMyLTkzilqdCxAMlOWpkdRaaRMjmdWm0BxkUVh2gnrzag6nCFtdMgmCFqXh3FqugVtnKXPIcw6awgDdrgDITFeL3As3y0JMEuvMQZZ5yLIOsgG6Wc_4aOtw_DG27xHYGNcu_gBdrEDOupO6yKgLMYSiUiVnv0w7Rzv-6y0B8QL1mnoJl84TaYqrsAO_AIB02OQ
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3Nb9MwFH9i47BxAMaGKAzmAxcOzhJ_JT5OpVWBrqdM2mWKEudZmlY1KE0v--tnO2lVgYa4RZGtPPlnv488_94D-OogTTHGlNZJUlFPm6WVC62pjBXGzr7FrPRs5OuFmt2In7fydiCrBy4MIobLZxj5x5DLrxuz8b_K3AmPfS2W7ABeSiGE7Olau6SBN-294nVnmGW7rGSsL_OrceQbhUeccS29At6zQqGtyl-6OBiY6RtYbEXr75U8RJuuiszjH1Ub_1v2t_B6cDXJVb83TuAFrt7Bq70ChKdwN2nbpqWkXNUkL50H3dK8WaKzXx0JbiiZOBXQsxuJc2_J93unZtC_9_ckyVDvnHgmWkvGzbojvgNo6DvRrc_gZjrJxzM6NFyghgnOaSoTlTmHRpvUMG64kW5RszqrBTcps7qUKDmmVmRGMWuVTYziVptKC1RVZfl7OFw1K_wAxOqaK5Ssqo0Q1gqNwjpbWWJZCtQMR3C5BaAwQzVyL9yyCFFJrAsHWeEhKwbIRvBtN-N3X4njH2PPPAJ74_rFH8H5FuRiOKvrgrkgQ6ZMpcnHZ6ZdwNEsv54X8x-LX5_g2H-ppyOew2HXbvCz80u66kvYjU8Eo9wx
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Error-+and+Tamper-Tolerant+State+Estimation+for+Discrete+Event+Systems+Under+Cost+Constraints&rft.jtitle=IEEE+transactions+on+automatic+control&rft.au=Li%2C+Yuting&rft.au=Hadjicostis%2C+Christoforos+N&rft.au=Wu%2C+Naiqi&rft.au=Li%2C+Zhiwu&rft.date=2023-11-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=0018-9286&rft.eissn=1558-2523&rft.volume=68&rft.issue=11&rft.spage=6743&rft_id=info:doi/10.1109%2FTAC.2023.3239590&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9286&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9286&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9286&client=summon