175
Views
2
CrossRef citations to date
0
Altmetric
Research Articles

Active opacity of discrete-event systems

, &
Pages 2090-2099 | Received 26 Apr 2021, Accepted 21 May 2022, Published online: 06 Jun 2022

References

  • Badouel, E., Bednarczyk, M., Borzyszkowski, A., Caillaud, B., & Darondeau, P. (2007). Concurrent secrets. Discrete Event Dynamic Systems, 17(4), 425–446. https://doi.org/10.1007/s10626-007-0020-5
  • Barbhuiya, F. A., Agarwal, M., Purwar, S., Biswas, S., & Nandi, S. (2015). Application of stochastic discrete event system framework for detection of induced low rate TCP attack. ISA Transactions, 58(5), 474–492. https://doi.org/10.1016/j.isatra.2015.05.009
  • Bryans, J. W., Koutny, M., Mazare, L., & Ryan, P. Y. A. (2008). Opacity generalised to transition systems. International Journal of Information Security, 76(6), 421–435. https://doi.org/10.1007/s10207-008-0058-x
  • Bryans, J. W., Koutny, M., & Ryan, P. Y. A. (2005). Modelling opacity using petri nets. Electronic Notes in Theoretical Computer Science, 121(11), 101–115. https://doi.org/10.1016/j.entcs.2004.10.010
  • Cassandras, C. G., & Lafortune, S. (2010). Introduction to discrete event systems. Springer US.
  • Chen, Z., Lin, F., Wang, C., Wang, L. Y., & Xu, M. (2014). Active diagnosability of discrete event systems and its application to battery fault diagnosis. IEEE Transactions on Control Systems Technology, 22(5), 1892–1898. https://doi.org/10.1109/TCST.87
  • Cong, X., Fanti, M. P., Mangini, A. M., & Li, Z. (2018). On-line verification of current-state opacity by Petri nets and integer linear programming. Automatica, 94(4), 205–213. https://doi.org/10.1016/j.automatica.2018.04.021
  • Cong, X., Fanti, M. P., Mangini, A. M., & Li, Z. (2019). On-line verification of initial-state opacity by Petri nets and integer linear programming. ISA Transactions, 93(3), 108–114. https://doi.org/10.1016/j.isatra.2019.01.023
  • Dubreil, J., Darondeau, P., & Marchand, H. (2010). Supervisory control for opacity. IEEE Transactions on Automatic Control, 55(5), 1089–1100. https://doi.org/10.1109/TAC.2010.2042008
  • Falcone, Y., & Marchand, H. (2015). Enforcement and validation (at runtime) of various notions of opacity. Discrete Event Dynamic Systems, 25(4), 531–570. https://doi.org/10.1007/s10626-014-0196-4
  • Focardi, R., & Gorrieri, R. (1994). A taxonomy of trace-based security properties for CCS. In Proceedings of the 7th workshop on computer security foundations (pp. 126–136). Franconia, NH: IEEE.
  • Ge, H., Yue, D., Xie, X., Dou, C., & Wang, S. (2020). Security control of cyber-physical system based on switching approach for intermittent denial-of-service jamming attack. ISA Transactions, 104(8), 53–61. https://doi.org/10.1016/j.isatra.2019.11.014
  • Guo, Y., Jiang, X., Guo, C., Wang, S., & Karoui, O. (2020). Overview of opacity in discrete event systems. IEEE Access, 8(3), 48731–48741. https://doi.org/10.1109/Access.6287639
  • Huang, J., & Kumar, R. (2008). Directed control of discrete event systems for safety and nonblocking. IEEE Transactions on Automation Science and Engineering, 5(4), 620–629. https://doi.org/10.1109/TASE.2008.923820
  • Huang, Y., Jin, L., Zhong, Z., Lou, Y., & Zhang, S. (2020). Detection and defense of active attacks for generating secret key from wireless channels in static environment. ISA Transactions, 99(11), 231–239. https://doi.org/10.1016/j.isatra.2019.11.001
  • Hubballi, N., Biswas, S., Roopa, S., Ratti, R., & Nandi, S. (2011). LAN attack detection using discrete event systems. ISA Transactions, 50(1), 119–130. https://doi.org/10.1016/j.isatra.2010.08.003
  • Jacob, R., Lesage, J. J., & Faure, J. M. (2016). Overview of discrete event systems opacity: Models, validation, and quantification. Annual Reviews in Control, 41(4), 135–146. https://doi.org/10.1016/j.arcontrol.2016.04.015
  • Ji, Y., Wu, Y. C., & Lafortune, S. (2018). Enforcement of opacity by public and private insertion functions. Automatica, 93(2), 369–378. https://doi.org/10.1016/j.automatica.2018.03.041
  • Ji, Y., Yin, X., & Lafortune, S. (2019a). Enforcing opacity by insertion functions under multiple energy constraints. Automatica, 108(Special issue 2), 108476. https://doi.org/10.1016/j.automatica.2019.06.028
  • Ji, Y., Yin, X., & Lafortune, S. (2019b). Opacity enforcement using nondeterministic publicly known edit functions. IEEE Transactions on Automatic Control, 64(10), 4369–4376. https://doi.org/10.1109/TAC.9
  • Lin, F. (2011). Opacity of discrete event systems and its applications. Automatica, 47(3), 496–503. https://doi.org/10.1016/j.automatica.2011.01.002
  • Lin, F., Wang, L. Y., Chen, W., Han, L., & Shen, B. (2017). N-diagnosability for active on-line diagnosis in discrete event systems. Automatica, 83(4), 220–225. https://doi.org/10.1016/j.automatica.2017.06.004
  • Liu, R., Mei, L., & Lu, J. (2020). K-memory-embedded insertion mechanism for opacity enforcement. Systems & Control Letters, 145(5), 104785. https://doi.org/10.1016/j.sysconle.2020.104785
  • Saadaoui, I., Li, Z., & Wu, N. (2020). Current-state opacity modelling and verification in partially observed Petri nets. Automatica, 116(7), 108907. https://doi.org/10.1016/j.automatica.2020.108907
  • Saboori, A., & Hadjicostis, C. N. (2007). Notions of security and opacity in discrete event systems. In 46th IEEE conference on decision and control (pp. 3101–3106). New Orleans, LA: IEEE.
  • Saboori, A., & Hadjicostis, C. N. (2011). Verification of K-step opacity and analysis of its complexity. IEEE Transactions on Automation Science and Engineering, 8(3), 549–559. https://doi.org/10.1109/TASE.2011.2106775
  • Saboori, A., & Hadjicostis, C. N. (2012a). Verification of infinite-step opacity and complexity considerations. IEEE Transactions on Automatic Control, 57(5), 1265–1269. https://doi.org/10.1109/TAC.2011.2173774
  • Saboori, A., & Hadjicostis, C. N. (2012b). Opacity-enforcing supervisory strategies via state estimator constructions. IEEE Transactions on Automatic Control, 57(5), 1155–1165. https://doi.org/10.1109/TAC.2011.2170453
  • Saboori, A., & Hadjicostis, C. N. (2013). Verification of initial-state opacity in security applications of discrete event systems. Information Sciences, 246(4), 115–132. https://doi.org/10.1016/j.ins.2013.05.033
  • Schneider, S., & Sidiropoulos, A. (1996). CSP and anonymity. In Proceedings of the 4th European symposium on research in computer security (pp. 198–218). Berlin, Heidelberg: Springer.
  • Takai, S., & Oka, Y. (2011). A formula for the supremal controllable and opaque sublanguage arising in supervisory control. SICE Journal of Control, Measurement, and System Integration, 1(4), 307–311.https://doi.org/10.9746/jcmsi.1.307
  • Wu, Y. C., & Lafortune, S. (2013). Comparative analysis of related notions of opacity in centralized and coordinated architectures. Discrete Event Dynamic Systems, 23(3), 307–339. https://doi.org/10.1007/s10626-012-0145-z
  • Wu, Y. C., & Lafortune, S. (2014). Synthesis of insertion functions for enforcement of opacity security properties. Automatica, 50(5), 1336–1348. https://doi.org/10.1016/j.automatica.2014.02.038
  • Wu, Y. C., Raman, V., Rawlings, B. C., Lafortune, S., & Seshia, S. A. (2018). Synthesis of obfuscation policies to ensure privacy and utility. Journal of Automated Reasoning, 60(1), 107–131. https://doi.org/10.1007/s10817-017-9420-x
  • Wu, Y. C., Sankararaman, K. A., & Lafortune, S. (2014). Ensuring privacy in location-based services: An approach based on opacity enforcement. IFAC Proceedings, 47(2), 33–38. https://doi.org/10.3182/20140514-3-FR-4046.00008
  • Yin, X., & Lafortune, S. (2017). A new approach for the verification of infinite-step and K-step opacity using two-way observers. Automatica, 80(4), 162–171. https://doi.org/10.1016/j.automatica.2017.02.037
  • Yin, X., Li, Z., Wang, W., & Li, S. (2019). Infinite-step opacity and K-step opacity of stochastic discrete-event systems. Automatica, 99(4), 266–274. https://doi.org/10.1016/j.automatica.2018.10.049

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.