Abstract
Opacity is an important information flow property that is concerned with the secret leakage of a system to a malicious observer called an “intruder”. Usually, opacity analyses are made under static or dynamic observation, i.e., the observability of events in a system is fixed or changeable over time by a mask. In this paper, we address the verification of language-based opacity in the context of discrete-event systems under Orwellian observation. We consider an Orwellian partial observability model, where some unobservable events, not visible when occurring, may become noticeable in the future. Specifically, we propose a set of unobservable events that are no longer unobservable once an event in another particular disjoint event subset is triggered. First, we define and solve an integer linear programming problem to verify language-based opacity in discrete event systems using labeled Petri nets. We then propose a new Orwellian projection function that is event-based, i.e., the system is allowed to re-interpret the observation of the already triggered events when a particular observable event occurs. Finally, the verification of language-based opacity in discrete event systems under Orwellian projection is addressed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Mazaré, L.: Using unification for opacity properties. In: Proceedings of the 4th IFIP WG1.7 Workshop Issues Theory Security (WITS 2004), Spain, vol. 7, pp. 165–176. (2004)
Bryans, J.W., Koutny, M., Mazaré, L., Ryan, P.Y.: Opacity generalised to transition systems. Int. J. Inform. Secur. 7(6), 421–435 (2008)
Bryans, J.W., Koutny, M., Ryan, P.Y.: Modelling opacity using Petri nets. Electron. Notes Theor. Comput. Sci. 121, 101–115 (2005)
Saboori, A., Hadjicostis, C.N.: Notions of security and opacity in discrete event systems. In: Proceedings of the 46th IEEE Conference Decision Control, pp. 5056–5061 (2007)
Saboori, A., Hadjicostis, C.N.: Verification of initial-state opacity in security applications of discrete event systems. Inf. Sci. 246, 115–132 (2013)
Guo, Y., Jiang, X., Guo, C., Wang, S., Karoui, O.: Overview of opacity in discrete event systems. IEEE Access 8, 48731–48741 (2020)
Cassez, F., Dubreil, J., Marchand, H.: Synthesis of opaque systems with static and dynamic masks. Formal Meth. Syst. Des. 40, 88–115 (2012)
Yin, X., Li, S.: Synthesis of dynamic masks for infinite-step opacity. IEEE Trans. Autom. Control 65(4), 1429–1441 (2020)
Mullins, J., Yeddes, M.: Opacity with Orwellian observers and intransitive non-interference. In: Proceedings of the 12th International Workshop on Discrete Event Systems (WODES), France, pp. 344–349 (2014)
Yeddes, M.: Enforcing opacity with Orwellian observation. In: Proceedings of the 13th International Workshop on Discrete Event Systems (WODES), Xi’an, China, pp. 306–312 (2016)
Hou, J., Yin, X., Li, S.: A framework for current-state opacity under dynamic information release mechanism. Automatica 140, 110238 (2022)
Lin, F.: Opacity of discrete event systems and its applications. Automatica 47(3), 496–503 (2011)
Zhang, B., Shu, S., Lin, F.: Polynomial algorithms to check opacity in discrete event systems. In: Proceedings of the 24th Control and Decision Conference (CCDC), pp. 763–769 (2012)
Tong, Y., Ma, Z., Li, Z., Seactzu, C., Giua, A.: Verification of language-based opacity in Petri nets using verifier. In: Proceedings of the 2011 American Control Conference, pp. 757–763 (2016)
Basile, F., De Tommasi, G.: An algebraic characterization of language-based opacity in labeled Petri nets. In: Proceedings of the 14th International Workshop on Discrete Event Systems, vol. 51, no. 7, pp. 329–336 (2018)
Ma, Z., Tong, Y., Li, Z., Giua, A.: Basis marking representation of Petri net reachability spaces and its application to the reachability problem. IEEE Trans. Autom. Control 62(3), 1078–1093 (2017)
Behinaein, B., Lin, F., Rudie, K.: Optimal information release for mixed opacity in discrete-event systems. IEEE Trans. Autom. Sci. Eng. 16(4), 1960–1970 (2019)
Bérard, B., Mullins, J.: Verification of information flow properties under rational observation. arXiv preprint arXiv:1409.0871 (2014)
Zhang, B., Shu, S., Lin, F.: Maximum information release while ensuring opacity in discrete event systems. IEEE Trans. Autom. Sci. Eng. 12(3), 1067–1079 (2015)
Basile, F., De tommasi, G., Motta, C.: Assessment of initial-state-opacity in live and bounded labeled Petri net systems via optimization techniques. Automatica 152, 110911 (2023)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Habbachi, S., Ben Hafaiedh, I., Li, Z., Krichen, M. (2024). On Language-Based Opacity Verification Problem in Discrete Event Systems Under Orwellian Observation. In: Ben Hedia, B., Maleh, Y., Krichen, M. (eds) Verification and Evaluation of Computer and Communication Systems. VECoS 2023. Lecture Notes in Computer Science, vol 14368. Springer, Cham. https://doi.org/10.1007/978-3-031-49737-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-031-49737-7_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-49736-0
Online ISBN: 978-3-031-49737-7
eBook Packages: Computer ScienceComputer Science (R0)