Abstract
We investigate the quantitative current-state opacity problem with resource constraints in the framework of probabilistic resource automata which is partially observed. Resource information states and event payoffs capture the variations of a resource that can be consumed or replenished during a system evolution. There are a number of ways to quantify opacity in discrete event systems, but these quantification methods have certain limitations. This research mitigates this restriction by extending current-state opacity and step-based almost current-state opacity formulations to probabilistic resource automata under partial observation with payoff constraints. We define game current-state opacity with an aim of offering a quantitative measure for opacity. We also construct a game current-state analyzer for the verification of game current-state opacity and prove the decidability of verifying the game current-state opacity problem.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
