On the formalization and computational complexity of resilience problems for cyber-physical systems

DOI10.1007/978-3-031-17715-6_8MaRDI QIDQ6164468FDOQ6164468

Authors: Musab A. Alturki, Tajana Ban Kirigin, Max Kanovich, Vivek Nigam, Andre Scedrov, Carolyn Talcott 

Publication date: 28 July 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

verificationcomputational complexityplanningformal methodsresiliencemultiset rewriting

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Relationships between nondeterministic and deterministic tape complexities
• Title not available (Why is that?)
• A rewriting framework and logic for activities subject to regulations
• On the complexity of verification of time-sensitive distributed systems
• Soft agents: exploring soft constraints to model robust adaptive distributed cyber-physical agent systems
• Detection and diagnosis of deviations in distributed systems of autonomous agents

Cited In (2)

• An STL-based formulation of resilience in cyber-physical systems
• The extended BG-simulation and the characterization of t-resiliency

This page was built for publication: On the formalization and computational complexity of resilience problems for cyber-physical systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164468)