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

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

Andrej Scedrov, Carolyn L. Talcott, Musab A. Alturki, Tajana Ban Kirigin, Vivek Nigam, Max I. Kanovich

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

• Unnamed Item
• On the complexity of verification of time-sensitive distributed systems
• Relationships between nondeterministic and deterministic tape complexities
• A rewriting framework and logic for activities subject to regulations
• 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

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