On the Formalization and Computational Complexity of Resilience Problems for Cyber-Physical Systems

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

doi:10.1007/978-3-031-17715-6_8

Cited by 4 publications

(2 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Pedestrian Crossing In this scenario an ego vehicle 4 , vh, is at position pos and is approaching with speed v and acceleration α, with a pedestrian crossing situated between the positions cr 1 and cr 2 . Moreover, a pedestrian is attempting to cross the road using the pedestrian crossing.…”

Section: Logical Scenarios and Motivating Examplesmentioning

confidence: 99%

“…Our methods differ in that dL specifications are not directly executable and therefore, one uses interactive theorem proving methods to verify dl specifications, whereas logical scenarios are executable thus enabling further automation of verification proofs using rewriting modulo SMT. Formal Definitions of Resilience: Alturki et al [4] propose formal definitions for resilience and show them to be undecidable in general and PSPACE-complete for some cases. While formal connections are left to future work, our definition of timed recoverability seem to specialize their definition so to be applicable for RTA architectures, e.g., considering dt-adequacy.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Automating Safety Proofs About Cyber-Physical Systems Using Rewriting Modulo SMT

Nigam

Talcott

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Cyber-physical systems (CPSes), such as autonomous vehicles, use sophisticated components like ML-based controllers. It is difficult to provide evidence about the safe functioning of such components. To overcome this problem, Runtime Assurance Architecture (RTA) solutions have been proposed. The RTA's decision component evaluates the system's safety risk and whenever the risk is higher than acceptable the RTA switches to a safety mode that, for example, activates a controller with strong evidence for its safe functioning. In this way, RTAs increase CPS runtime safety and resilience by recovering the system from higher to lower risk levels. The goal of this paper is to automate recovery proofs of CPSes using RTAs. We first formalize the key verification problems, namely, the decision sampling-time adequacy problem and the time-bounded recoverability problem. We then demonstrate how to automatically generate proofs for the proposed verification problems using symbolic rewriting modulo SMT. Automation is enabled by integrating the rewriting logic tool (Maude), which generates sets of non-linear constraints, with an SMT-solver (Z3) to produce proofs

show abstract

Section: Logical Scenarios and Motivating Examplesmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%