Browsing by Subject "Verification complexity"
Now showing items 1-1 of 1
-
Article
Current-state opacity formulations in probabilistic finite automata
(2014)A system is said to be current-state opaque if the entrance of the system state to a set of secret states remains opaque (uncertain) to an intruder - at least until the system leaves the set of secret states. This notion ...