The First-Order Logic of Signals

Abstract : Formalizing properties of systems with continuous dynamics is a challenging task. In this paper, we propose a formal framework for specifying and monitoring rich temporal properties of real-valued signals. We introduce signal first-order logic (SFO) as a specification language that combines first-order logic with linear-real arithmetic and unary function symbols interpreted as piecewise-linear signals. We first show that while the satisfiability problem for SFO is undecidable, its membership and monitoring problems are decidable. We develop an offline monitoring procedure for SFO that has polynomial complexity in the size of the input trace and the specification, for a fixed number of quantifiers and function symbols. We show that the algorithm has computation time linear in the size of the input trace for the important fragment of bounded-response specifications interpreted over input traces with finite variability. We can use our results to extend signal temporal logic with first-order quantifiers over time and value parameters, while preserving its efficient monitoring. We finally demonstrate the practical appeal of our logic through a case study in the microelectronics domain.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01924403
Contributor : Alexey Bakhirkin <>
Submitted on : Thursday, November 15, 2018 - 8:19:46 PM
Last modification on : Thursday, February 7, 2019 - 5:54:10 PM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01924403, version 1

Collections

Citation

Alexey Bakhirkin, Thomas Ferrère, Thomas Henzinger, Dejan Nickovic. The First-Order Logic of Signals. International Conference on Embedded Software (EMSOFT), Sep 2018, Torino, Italy. ⟨hal-01924403⟩

Share

Metrics

Record views

46

Files downloads

22