Pith. sign in

REVIEW 1 cited by

Runtime Enforcement of CPS against Signal Temporal Logic

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2502.11584 v1 pith:APTKNDGU submitted 2025-02-17 eess.SY cs.SY

classification eess.SYcs.SY
keywords enforcementruntimesignaltemporalformulapropertiestimedapproach
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Cyber-Physical Systems (CPSs), especially those involving autonomy, need guarantees of their safety. Runtime Enforcement (RE) is a lightweight method to formally ensure that some specified properties are satisfied over the executions of the system. Hence, there is recent interest in the RE of CPS. However, existing methods are not designed to tackle specifications suitable for the hybrid dynamics of CPS. With this in mind, we develop runtime enforcement of CPS using properties defined in Signal Temporal Logic (STL). In this work, we aim to construct a runtime enforcer for a given STL formula to minimally modify a signal to satisfy the formula. To achieve this, the STL formula to be enforced is first translated into a timed transducer, while the signal to be corrected is encoded as timed words. We provide timed transducers for the temporal operators \emph{until} and \emph{release} noting that other temporal operators can be expressed using these two. Our approach enables effective enforcement of STL properties for CPS. A case study is provided to illustrate the approach and generate empirical evidence of its suitability for CPS.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Frequency Automata: A novel formal model of hybrid systems in combined time and frequency domains

    cs.FL 2025-05 reject novelty 4.0 of 10

    A hybrid automaton flow is rewritten as a rotating vector x_n=sin(theta), and simulation steps jump from the current angle to the guard angle, giving fast and, for the tested cases, accurate level crossings.

Pith tools