Abstract
The increasing data frequency and size of information flow have aroused peoples concern about their private information safety. For a system, it is necessary to verify whether the system is opaque to external invaders. A plant is said to be opaque if any secret behaviour in the plant cannot be detected by an external invader. This paper focuses on illustrating a method to decide whether a given system is opaque. To solve the question, the system is first abstracted as the model of finite state automata. Then this paper studies the safety property from the perspective of current-state opacity of a given automaton.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
