English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Cyber-physical systems (CPSes), such as autonomous vehicles, usesophisticated components like ML-based controllers. It is difficult to provideevidence about the safe functioning of such components. To overcome thisproblem, Runtime Assurance Architecture (RTA) solutions have been proposed. The\RAP's decision component evaluates the system's safety risk and whenever therisk is higher than acceptable the RTA switches to a safety mode that, forexample, activates a controller with strong evidence for its safe functioning.In this way, RTAs increase CPS runtime safety and resilience by recovering thesystem from higher to lower risk levels. The goal of this paper is to automaterecovery proofs of CPSes using RTAs. We first formalize the key verificationproblems, namely, the decision sampling-time adequacy problem and thetime-bounded recoverability problem. We then demonstrate how to automaticallygenerate proofs for the proposed verification problems using symbolic rewritingmodulo 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

Technical-Report: Automating Recoverability Proofs for Cyber-Physical Systems with Runtime Assurance Architectures