Combining Time and Frequency Domain Specifications for Periodic Signals

Chakarov, Aleksandar; Sankaranarayanan, Sriram; Fainekos, Georgios

doi:10.1007/978-3-642-29860-8_22

Cited by 8 publications

(5 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, CPS often consist of networked spatially distributed entities where timing constraints are combined with spatial relations between the components. In addition, many basic properties of continuous CPS entities are naturally definable in spectral (for instance frequency) domain [98,137]. There is a necessity to study specification formalisms that gracefully integrate these important CPS aspects.…”

Section: C7 Autonomous Cpsmentioning

confidence: 99%

A survey of challenges for runtime verification from advanced application domains (beyond software)

Sánchez

Schneider

Ahrendt

et al. 2019

Form Methods Syst Des

View full text Add to dashboard Cite

Runtime verification is an area of formal methods that studies the dynamic analysis of execution traces against formal specifications. Typically, the two main activities in runtime verification efforts are the process of creating monitors from specifications, and the algorithms for the evaluation of traces against the generated monitors. Other activities involve the instrumentation of the system to generate the trace and the communication between the system under analysis and the monitor.Most of the applications in runtime verification have been focused on the dynamic analysis of software, even though there are many more potential applications to other computational devices and target systems. In this paper we present a collection of challenges for runtime verification extracted from concrete application domains, focusing on the difficulties that must be overcome to tackle these specific challenges. The computational models that characterize these domains require to devise new techniques beyond the current state of the art in runtime verification.

show abstract

Section: C7 Autonomous Cpsmentioning

confidence: 99%

A survey of challenges for runtime verification from advanced application domains (beyond software)

Sánchez

Schneider

Ahrendt

et al. 2019

Form Methods Syst Des

View full text Add to dashboard Cite

show abstract

“…However, both of their underlying spatial models, graph structures for SSTL and quadtrees for SpaTeL, are not appropriate for this purpose. Logics for describing frequency and temporal properties have been proposed, including Time-Frequency Logic (TFL) in [11] and the approach in [8]. TFL is not sufficiently expressive for peak detection because it lacks the necessary mechanisms to quantify over variables or to freeze their values.…”

Section: Related Workmentioning

confidence: 99%

Quantitative Regular Expressions for Arrhythmia Detection Algorithms

Abbas

Rodionova

Bartocci

et al. 2017

Computational Methods in Systems Biology

View full text Add to dashboard Cite

Abstract. Motivated by the problem of verifying the correctness of arrhythmia-detection algorithms, we present a formalization of these algorithms in the language of Quantitative Regular Expressions. QREs are a flexible formal language for specifying complex numerical queries over data streams, with provable runtime and memory consumption guarantees. The medical-device algorithms of interest include peak detection (where a peak in a cardiac signal indicates a heartbeat) and various discriminators, each of which uses a feature of the cardiac signal to distinguish fatal from non-fatal arrhythmias. Expressing these algorithms' desired output in current temporal logics, and implementing them via monitor synthesis, is cumbersome, error-prone, computationally expensive, and sometimes infeasible. In contrast, we show that a range of peak detectors (in both the time and wavelet domains) and various discriminators at the heart of today's arrhythmia-detection devices are easily expressible in QREs. The fact that one formalism (QREs) is used to describe the desired end-to-end operation of an arrhythmia detector opens the way to formal analysis and rigorous testing of these detectors' correctness and performance. Such analysis could alleviate the regulatory burden on device developers when modifying their algorithms. The performance of the peak-detection QREs is demonstrated by running them on real patient data, on which they yield results on par with those provided by a cardiologist.

show abstract

“…The set AP k of all almost periodic functions belongs to the power spectral envelop H(ω k ) with k degree of robustness, if the Fourier series coefficients satisfy the following constraints [9],…”

Section: B Encoding Membership Of the Limit Cycle In The Robust Powementioning

confidence: 99%

Verifying robust frequency domain properties of non linear oscillators using SMT

Asad

Jones

Surre

2014

17th International Symposium on Design and Diagnostics of Electronic Circuits &Amp; Systems

View full text Add to dashboard Cite

This is the accepted version of the paper.This version of the publication may differ from the final published version. Abstract-We present a novel mixed time and frequency domain approach to the formal verification of oscillators properties which are specified in the frequency domain. We use robust periodogram specification to specify the oscillator behaviour in the close vicinity of the limit cycle. Using SAT modulo ODE (SMO) for Bounded Model Checking (BMC) of the non-linear hybrid automata, we show that the oscillator hybrid timed traces satisfy frequency domain specifications. Permanent

show abstract

Combining Time and Frequency Domain Specifications for Periodic Signals

Cited by 8 publications

References 24 publications

A survey of challenges for runtime verification from advanced application domains (beyond software)

A survey of challenges for runtime verification from advanced application domains (beyond software)

Quantitative Regular Expressions for Arrhythmia Detection Algorithms

Verifying robust frequency domain properties of non linear oscillators using SMT

Contact Info

Product

Resources

About