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

Technical Report: Time-Bounded Resilience (2401.05585v3)

Published 10 Jan 2024 in cs.LO

Abstract: Most research on formal system design has focused on optimizing various measures of efficiency. However, insufficient attention has been given to the design of systems optimizing resilience, the ability of systems to adapt to unexpected changes or adversarial disruptions. In our prior work, we formalized the intuitive notion of resilience as a property of cyber-physical systems by using a multiset rewriting language with explicit time. In the present paper, we study the computational complexity of a formalization of time-bounded resilience problems for the class of $\eta$-simple progressing planning scenarios, where, intuitively, it is simple to check that a system configuration is critical, and only a finite number of actions can be carried out in a bounded time period. We show that, in the time-bounded model with $n$ (potentially adversarially chosen) updates, the corresponding time-bounded resilience problem for this class of systems is complete for the $\SigmaP_{2n+1}$ class of the polynomial hierarchy, PH. To support the formal models and complexity results, we perform automated experiments for time-bounded verification using the rewriting logic tool Maude.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (40)
  1. On the formalization and computational complexity of resilience problems for cyber-physical systems. In Theoretical Aspects of Computing–ICTAC 2022: 19th International Colloquium, Tbilisi, Georgia, September 27–29, 2022, Proceedings, pages 96–113. Springer, 2022.
  2. S. Arora and B. Barak. Complexity theory: A modern approach. Cambridge University Press Cambridge, 2009.
  3. A framework for measuring software obfuscation resilience against automated attacks. In 2015 IEEE/ACM 1st International Workshop on Software Protection, pages 45–51, 2015.
  4. E. Bauer. Design for reliability: information and computer-based systems. John Wiley & Sons, 2011.
  5. Modelling and analysing resilient cyber-physical systems. In 2019 IEEE/ACM 14th International Symposium on Software Engineering for Adaptive and Self-Managing Systems (SEAMS), pages 70–76, 2019.
  6. Towards identifying and closing gaps in assurance of autonomous road vehicles–a collection of technical notes part 1. arXiv preprint arXiv:2003.00789, 2020.
  7. Urban resilience: A civil engineering perspective. Sustainability, 9(1), 2017.
  8. A framework to quantitatively assess and enhance the seismic resilience of communities. Earthquake spectra, 19(4):733–752, 2003.
  9. Resilient dynamic programming. Algorithmica, 77(2):389–425, Feb 2017.
  10. All About Maude: A High-Performance Logical Framework, volume 4350 of LNCS. Springer, 2007.
  11. Resilient x10: Efficient failure-aware programming. SIGPLAN Not., 49(8):67–80, feb 2014.
  12. Multiset rewriting and the complexity of bounded security protocols. Journal of Computer Security, 12(2):247–311, 2004.
  13. Towards resilient artificial intelligence: Survey and research issues. In 2021 IEEE International Conference on Cyber Security and Resilience (CSR), pages 536–542, 2021.
  14. H. B. Enderton. A mathematical introduction to logic. Academic Press, 1972.
  15. Experimental study of resilient algorithms and data structures. In P. Festa, editor, Experimental Algorithms, pages 1–12, Berlin, Heidelberg, 2010. Springer Berlin Heidelberg.
  16. C. Folke. Resilience: The emergence of a perspective for social–ecological systems analyses. Global Environmental Change, 16(3):253–267, 2006. Resilience, Vulnerability, and Adaptation: A Cross-Cutting Theme of the International Human Dimensions Programme on Global Environmental Change.
  17. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences). W. H. Freeman, first edition edition, 1979.
  18. Adversarial resilience in sequential prediction via abstention. arXiv preprint arXiv:2306.13119, 2023.
  19. Formal verification of robustness and resilience of learning-enabled state estimation systems for robotics, 2020.
  20. A programming model for resilience in extreme scale computing. In IEEE/IFIP International Conference on Dependable Systems and Networks Workshops (DSN 2012), pages 1–6, 2012.
  21. Bounded memory dolev–yao adversaries in collaborative systems. Information and Computation, 238:233–261, 2014.
  22. Timed multiset rewriting and the verification of time-sensitive distributed systems. In 14th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS), 2016.
  23. On the complexity of verification of time-sensitive distributed systems. In D. Dougherty, J. Meseguer, S. A. Mödersheim, and P. Rowe, editors, Protocols, Strands, and Logic, volume 13066 of Springer LNCS, pages 251–275. Springer International Publishing, 2021.
  24. On the complexity of verification of time-sensitive distributed systems. In Protocols, Strands, and Logic, pages 251–275. Springer International Publishing, 2021.
  25. Time, computational complexity, and probability in the analysis of distance-bounding protocols. Journal of Computer Security, 25(6):585–630, 2017.
  26. A rewriting framework and logic for activities subject to regulations. Mathematical Structures in Computer Science, 27(3):332–375, 2017.
  27. I. Koren and C. M. Krishna. Fault-tolerant systems. Morgan Kaufmann, 2020.
  28. Sure: A modeling and simulation integration platform for evaluation of secure and resilient cyber–physical systems. Proceedings of the IEEE, 106(1):93–112, 2018.
  29. Constructing models for systems resilience: Challenges, concepts, and formal methods. Systems, 8(1), 2020.
  30. A. M. Madni and S. Jackson. Towards a conceptual framework for resilience engineering. IEEE Systems Journal, 3(2):181–191, 2009.
  31. S. B. Manyena. The concept of resilience revisited. Disasters, 30(4):434–450, 2006.
  32. Predictive formal analysis of resilience in cyber-physical systems. IEEE Access, 7:33741–33758, 2019.
  33. R. Neches and A. M. Madni. Towards affordably adaptable and effective systems. Systems Engineering, 16(2):224–234, 2013.
  34. V. Nigam and C. L. Talcott. Automating recoverability proofs for cyber-physical systems with runtime assurance architectures. In C. David and M. Sun, editors, 17th International Symposium on Theoretical Aspects of Software Engineering, volume 13931 of Lecture Notes in Computer Science, pages 1–19. Springer, 2023.
  35. Resilient machine learning for networked cyber physical systems: A survey for machine learning security to securing machine learning for cps. IEEE Communications Surveys & Tutorials, 23(1):524–552, 2021.
  36. C. H. Papadimitriou. Computational complexity. Academic Internet Publ., 2007.
  37. A. Prasad. Towards Robust and Resilient Machine Learning. PhD thesis, Carnegie Mellon University, Apr 2022.
  38. Towards formal approaches to system resilience. In 2013 IEEE 19th Pacific Rim International Symposium on Dependable Computing, pages 41–50, 2013.
  39. L. J. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3(1):1–22, 1976.
  40. M. Vardi. Efficiency vs. resilience: What covid-19 teaches computing. Communications of the ACM, 63(5):9–9, 2020.

Summary

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

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