A Barrier Certificate-Based Simplex Architecture with Application to Microgrids

Damare, Amol; Roy, Shouvik; Smolka, Scott A.; Stoller, Scott D.

doi:10.1007/978-3-031-17196-3_6

Cited by 5 publications

(2 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…RTAs. Since the first proposal of RTAs, called Simplex Architecture [30], there has been several recent proposals of RTA variants [25,20,11] (to name a few). While there are some differences on their architectures and functions, they all contain a decision module that evaluates the system risk level to decide which controller to use (the safe or the advanced controller).…”

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: Related Workmentioning

confidence: 99%

“…CPS Verification and Validation Much of the literature in CPS verification, e.g. [16] to name one, including some of the previous work on RTA [25,11,20], rely on simulationbased methods. These approaches are complementary to the one introduced in this paper.…”

Section: Related Workmentioning

confidence: 99%