Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Verification and Enforcement of Strong State-Based Opacity for Discrete-Event Systems (2401.10363v1)

Published 18 Jan 2024 in cs.FL

Abstract: In this paper, we investigate the verification and enforcement of strong state-based opacity (SBO) in discrete-event systems modeled as partially-observed (nondeterministic) finite-state automata, including strong K-step opacity (K-SSO), strong current-state opacity (SCSO), strong initial-state opacity (SISO), and strong infinite-step opacity (Inf-SSO). They are stronger versions of four widely-studied standard opacity notions, respectively. We firstly propose a new notion of K-SSO, and then we construct a concurrent-composition structure that is a variant of our previously-proposed one to verify it. Based on this structure, a verification algorithm for the proposed notion of K-SSO is designed. Also, an upper bound on K in the proposed K-SSO is derived. Secondly, we propose a distinctive opacity-enforcement mechanism that has better scalability than the existing ones (such as supervisory control). The basic philosophy of this new mechanism is choosing a subset of controllable transitions to disable before an original system starts to run in order to cut off all its runs that violate a notion of strong SBO of interest. Accordingly, the algorithms for enforcing the above-mentioned four notions of strong SBO are designed using the proposed two concurrent-composition structures. In particular, the designed algorithm for enforcing Inf-SSO has lower time complexity than the existing one in the literature, and does not depend on any assumption. Finally, we illustrate the applications of the designed algorithms using examples.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (48)
  1. S. Lafortune, F. Lin, and C.N. Hadjicostis, “On the history of diagnosability and opacity in discrete event systems,” Annual Reviews in Control, vol. 45, pp. 257–266, 2018.
  2. L. An and G. Yang, “Opacity enforcement for confidential robust control in linear cyber-physical systems,” IEEE Transactions on Automatic Control, vol. 65, no. 3, pp. 1234–1241, 2020.
  3. B. Ramasubramanian, W.R. Cleaveland, and S. Marcus, “Notions of centralized and decentralized opacity in linear systems,” IEEE Transactions on Automatic Control, vol. 65, no. 4, pp. 1442–1455, 2020.
  4. X. Yin, M. Zamani, and S. Liu, “On approximate opacity of cyber-physical systems,” IEEE Transactions on Automatic Control, vol. 66, no. 4, pp. 1630–1645, 2021.
  5. L. Mazare´´𝑒\acute{e}over´ start_ARG italic_e end_ARG, “Using unification for opacity properties,” in Proceedings of the Workshop on Issues in the Theory of Security, 2004, pp. 165–176.
  6. J.W. Bryans, M. Koutny, and P. Ryan, “Modelling opacity using Petri nets,” Electronic Notes in Theoretical Computer Science, vol. 121, pp. 101–115, 2005.
  7. A. Saboori and C.N. Hadjicostis, “Notions of security and opaicty in discrete event systems,” in Proceedings of 46th IEEE Conference on Decision and Control, 2007, pp. 5056–5061.
  8. J.W. Bryans, M. Koutny, L. Mazare´´𝑒\acute{e}over´ start_ARG italic_e end_ARG, and P. Ryan, “Opacity generalised to transition systems,” Internationa Journal of Information Security, vol. 7, no. 6, pp. 421–435, 2008.
  9. R. Jacob, J.J. Lesage, and J.M. Faure, “Overview of discrete event systems opacity: Models, validation, and quantification,” Annual Reviews in Control, vol. 41, pp. 135–146, 2016.
  10. A. Saboori and C.N. Hadjicostis, “Verification of initial-state opacity in security appications of discrete event systems,” Information Sciences, vol. 246, pp. 115–132, 2013.
  11. A. Saboori and C.N. Hadjicostis, “Verification of K𝐾Kitalic_K-step opacity and analysis of its complexity,” IEEE Transactions on Automation Science and Engineering, vol. 8, no. 3, pp. 549–559, 2011.
  12. A. Saboori and C.N. Hadjicostis, “Verification of infinite-step opacity and complexity considerations,” IEEE Transactions on Automatic Control, vol. 57, no. 5, pp. 1265–1269, 2012.
  13. F. Lin, “Opacity of discrete event systems and its applications,” Automatica, vol. 47, no. 3, pp. 496–503, 2011.
  14. Y. Wu and S. Lafortune, “Comparative analysis of related notions of opacity in centralized and coordinated architectures,” Discrete Event Dynamic Systems, vol. 23, no. 3, pp. 307–339, 2013.
  15. K. Zhang, “A unified concurrent-composition method to state/event inference and concealment in labeled finite-state automata as discrete-event systems,” Annual Reviews in Control, vol. 56, 2023, Art. no. 100902.
  16. J. Balun and T. Masopust, “Verifying weak and strong k𝑘kitalic_k-step opacity in discrete-event systems,” Automatica, vol. 155, 2023, Art. no. 111153.
  17. J. Balun and T. Masopust, “Comparing the notions of opacity for discrete-event systems,” Discrete Event Dynamic Systems, vol. 31, pp. 553–582, 2021.
  18. J. Dubreil, P. Darondeau, and H. Marchand, “Supervisory control for opacity,” IEEE Transactions on Automatic Control, vol. 55, no. 5, pp. 1089–1100, 2010.
  19. A. Saboori and C.N. Hadjicostis, “Opacity-enforcing supervisory strategies via state estimator constructions,” IEEE Transactions on Automatic Control, vol. 57, no. 2, pp. 1155–1165, 2012.
  20. X. Yin and S. Lafortune, “A uniform approach for synthesizing property-enforcing supervisors for partially-observed discrete-event systems,” IEEE Transactions on Automatic Control, vol. 61, no. 8, pp. 2140–2154, 2016.
  21. Y. Tong, Z. Li, C. Seatzu, and A. Giua, “Current-state opacity enforcement in discrete event systems under incomparable observations,” Discrete Event Dynamic Systems, vol. 28, no. 2, pp. 161–182, 2018.
  22. Y. Wu and S. Lafortune, “Synthesis of insertion functions for enforcement of opacity security properties,” Automatica, vol. 50, pp. 1336–1348, 2014.
  23. Y. Ji, Y. Wu, and S. Lafortune, “Enforcement of opacity by public and private insertion functions,” Automatica, vol. 93, pp. 369–378, 2018.
  24. Y. Ji, X. Yin, and S. Lafortune, “Opacity enforcement using nondeterministic publicly-known edit functions,” IEEE Transactions on Automatic Control, vol. 64, no. 10, pp. 4369–4376, 2019.
  25. R. Liu and J. Lu, “Enforcement for infinite-step opacity and K𝐾Kitalic_K-step opacity via insertion mechanism,” Automatica, vol. 140, 2022, Art. no. 110212.
  26. X. Li, C.N. Hadjicostis, and Z. Li, “Extended insertion functions for opacity enforcement in discrete-event systems,” IEEE Transactions on Automatic Control, vol. 67, no. 10, pp. 5289–5303, 2022.
  27. F. Cassez, J. Dubreil, and H. Marchand, “Synthesis of opaque systems with static and dynamic masks,” Formal Methods in System Design, vol. 40, pp. 88–115, 2012.
  28. B. Zhang, S. Shu, and F. Lin, “Maximum information release while ensuring opacity in discrete event systems,” IEEE Transactions on Automation Science and Engineering, vol. 12, no. 4, pp. 1067–1079, 2015.
  29. X. Yin and S. Li, “Synthesis of dynamic masks for infinite-step opacity,” IEEE Transactions on Automatic Control, vol. 65, no. 4, pp. 1429–1441, 2020.
  30. Y. Tong, Z. Li, C. Seatzu, and A. Giua, “Verification of state-based opacity using Petri nets,” IEEE Transactions on Automatic Control, vol. 62, no. 6, pp. 2823–2837, 2017.
  31. K. Zhang, X. Yin, and M. Zamani, “Opacity of nondeterministic transition systems: A (bi)simulation relation approach,” IEEE Transactions on Automatic Control, vol. 64, no. 2, pp. 5116–5123, 2019.
  32. C. Keroglou and C.N. Hadjicostis, “Probabilistic system opacity in discrete event systems,” Discrete Event Dynamic Systems, vol. 28, pp. 289–314, 2018.
  33. X. Yin, Z. Li, W. Wang, and C. Liu, “Infinite-step opacity and K𝐾Kitalic_K-step opacity of stochastic discrete-event systems,” Automatica, vol. 99, pp. 266–274, 2019.
  34. W. Deng, D. Qiu, and J. Yang, “Opacity measures of fuzzy discrete event systems,” IEEE Transactions on Fuzzy Systems, vol. 29, no. 9, pp. 2612–2622, 2020.
  35. K. Zhang, “State-based opacity of labeled real-time automata,” Theoretical Computer Science, vol. 987, 2024, Art. no. 114373.
  36. J. Hou, X. Yin, and S. Li, “A framework for current-state opacity under dynamic information release mechanism,” Automatica, vol. 140, 2022, Art. no. 110238.
  37. A. Saboori and C.N. Hadjicostis, “Coverage analysis of mobile agent trajectory via state-based opacity formulations,” Control Engineering Practice, vol. 19, no. 9, pp. 967–977, 2011.
  38. Y. Wu, K. Sankararaman, and S. Lafortune, “Ensuring privacy in location-based services: An approach based on opacity enforcement,” in Proceedings of 12th International Workshop on Discrete Event Systems, 2014, pp. 33–38.
  39. A. Bourouis, K. Klai, N.B. Hadj-Alouane, and Y.E. Touati, “On the verification of opacity in web services and their composition,” IEEE Transactions on Services Computing, vol. 10, no. 1, pp. 66–79, 2017.
  40. F. Lin, W. Chen, W. Wang, and F. Wang, “Information control in networked discrete event systems and its application to battery management systems,” Discrete Event Dynamic Systems, vol. 30, no. 2, pp. 243–268, 2020.
  41. Y. Falcone and H. Marchand, “Enforcement and validation (at runtime) of various notions of opacity,” Discrete Event Dynamic Systems, vol. 25, pp. 531–570, 2015.
  42. Z. Ma, X. Yin, and Z. Li, “Verification and enforcement of strong infinite- and k𝑘kitalic_k-step opacity using state recognizers,” Automatica, vol. 133, 2021, Art. no. 109838.
  43. X. Han, K. Zhang, J. Zhang, Z. Li, and Z. Chen, “Strong current-state and initial-state opacity of discrete-event systems,” Automatica, vol. 148, 2023, Art. no. 110756.
  44. K. Zhang, “A new framework for discrete-event systems,” Foundations and Trends®normal-®{}^{\circledR}start_FLOATSUPERSCRIPT ® end_FLOATSUPERSCRIPT in Systems and Control, vol. 10, no. 1-2, pp. 1–179, 2023.
  45. K. Zhang, “Polynomial-time verification and enforcement of delayed strong detectability for discrete-event systems,” IEEE Transactions on Automatic Control, vol. 68, no. 1, pp. 510–515, 2023.
  46. X. Han, K. Zhang, and Z. Li, “Verification of strong K𝐾Kitalic_K-step opacity for discrete-event systems,” in Proceedings of 61th IEEE Conference on Decision and Control, 2022, pp. 4250–4255.
  47. X. Yin and S. Lafortune, “A new approach for the verification of infinite-step and K-step opacity using two-way observers,” Automatica, vol. 80, pp. 162–171, 2017.
  48. P.J. Ramadge and W.M. Wonham, “Supervisory control of a class of discrete event processes,” SIAM Journal on Control and Optimization, vol. 25, no. 1, pp. 206–230, 1987.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now