2022
DOI: 10.1080/00207179.2021.1951357
|View full text |Cite
|
Sign up to set email alerts
|

Current-state opacity and initial-state opacity of modular discrete event systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 36 publications
0
3
0
Order By: Relevance
“…In the past decades, many potential compositionality results have been proposed to tackle the acute computational bottlenecks in the analysis of safety properties for large-scale continuous-space systems [191,148,91,93,29,160,187,188,99,109]. However, in the context of analyzing security properties, compositional approaches have been explored only recently for modular verification and synthesis of DES in [168,137,132,196,212,239] and for continuous-space systems in [114,111,83].…”
Section: Compositional Reasoning For Scalabilitymentioning
confidence: 99%
See 1 more Smart Citation
“…In the past decades, many potential compositionality results have been proposed to tackle the acute computational bottlenecks in the analysis of safety properties for large-scale continuous-space systems [191,148,91,93,29,160,187,188,99,109]. However, in the context of analyzing security properties, compositional approaches have been explored only recently for modular verification and synthesis of DES in [168,137,132,196,212,239] and for continuous-space systems in [114,111,83].…”
Section: Compositional Reasoning For Scalabilitymentioning
confidence: 99%
“…With this structural condition, the verification of opacity for system ⊗ n i=1 Σ i can be divided as n local verification problems for subsystems Σ i , which reduces the double-exponential complexity 2 |X| n to single-exponential complexity n2 |X| , where |X| = max i=1,...,n |X i |. More recently, the results in [196,212] follow the similar line of reasoning by identifying sufficient conditions under which current-state opacity can be verified efficiently using modular approach without building the monolithic system. In [137], a compositional abstraction technique was developed based on a notion of visible bisimulation relation.…”
Section: Compositional Reasoning For Scalabilitymentioning
confidence: 99%
“…When an original system is not opaque, its opacity enforcement problem has been extensively studied using a variety of techniques (see, e.g., previous studies [16][17][18][19][20]). Furthermore, verification and enforcement of opacity have been extended to other classes of models, including Petri nets [21,22], stochastic DESs [23], modular DESs [24], fuzzy DESs [25], and others [26,27]. For details, we refer the reader to the comprehensive review [28] and the references therein.…”
Section: Introductionmentioning
confidence: 99%