32 search results - page 1 / 7 » Verification of K-step opacity and analysis of its complexit... |
CDC
2009
IEEE
13 years 8 months ago
2009
IEEE
In this paper, we analyze the verification of K-step opacity in discrete event systems that are modeled as (possibly non-deterministic) finite automata with partial observation on ...
ITC
2002
IEEE
13 years 9 months ago
2002
IEEE
The advantage to “one test at a time” fault diagnosis is its ability to implicate the components of complicated defect behaviors. The disadvantage is the large size and opacit...
CCR
2004
13 years 4 months ago
2004
Protocol and system designers use verification techniques to analyze a system's correctness properties. Network operators need verification techniques to ensure the "cor...
CASCON
2001
13 years 6 months ago
2001
Automated verification tools vary widely in the types of properties they are able to analyze, the complexity of their algorithms, and the amount of necessary user involvement. In ...
ICSE
2008
IEEE-ACM
14 years 4 months ago
2008
IEEE-ACM
This paper examines the suitability and use of runtime verification as means for monitoring security protocols and their properties. In particular, we employ the runtime verificat...