27 research outputs found
Keynote: The first-order logic of signals
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 micro-electronics domain
RTLola Cleared for Take-Off: Monitoring Autonomous Aircraft
The autonomous control of unmanned aircraft is a highly safety-critical
domain with great economic potential in a wide range of application areas,
including logistics, agriculture, civil engineering, and disaster recovery. We
report on the development of a dynamic monitoring framework for the DLR ARTIS
(Autonomous Rotorcraft Testbed for Intelligent Systems) family of unmanned
aircraft based on the formal specification language RTLola. RTLola is a
stream-based specification language for real-time properties. An RTLola
specification of hazardous situations and system failures is statically
analyzed in terms of consistency and resource usage and then automatically
translated into an FPGA-based monitor. Our approach leads to highly efficient,
parallelized monitors with formal guarantees on the noninterference of the
monitor with the normal operation of the autonomous system
Laser spectroscopy for breath analysis : towards clinical implementation
Detection and analysis of volatile compounds in exhaled breath represents an attractive tool for monitoring the metabolic status of a patient and disease diagnosis, since it is non-invasive and fast. Numerous studies have already demonstrated the benefit of breath analysis in clinical settings/applications and encouraged multidisciplinary research to reveal new insights regarding the origins, pathways, and pathophysiological roles of breath components. Many breath analysis methods are currently available to help explore these directions, ranging from mass spectrometry to laser-based spectroscopy and sensor arrays. This review presents an update of the current status of optical methods, using near and mid-infrared sources, for clinical breath gas analysis over the last decade and describes recent technological developments and their applications. The review includes: tunable diode laser absorption spectroscopy, cavity ring-down spectroscopy, integrated cavity output spectroscopy, cavity-enhanced absorption spectroscopy, photoacoustic spectroscopy, quartz-enhanced photoacoustic spectroscopy, and optical frequency comb spectroscopy. A SWOT analysis (strengths, weaknesses, opportunities, and threats) is presented that describes the laser-based techniques within the clinical framework of breath research and their appealing features for clinical use.Peer reviewe
Learning Specifications for Labelled Patterns
International audienceIn this work, we introduce a supervised learning framework for inferring temporal logic specifications from labelled patterns in signals, so that the formulae can then be used to correctly detect the same patterns in unlabelled samples. The input patterns that are fed to the training process are labelled by a Boolean signal that captures their occurrences. To express the patterns with quantitative features, we use parametric specifications that are increasing, which we call Increasing Parametric Pattern Predictor (IPPP). This means that augmenting the value of the parameters makes the predicted pattern true on a larger set. A particular class of parametric specification formalisms that we use is Parametric Signal Temporal Logic (PSTL). One of the main contributions of this paper is the definition of a new measure, called-count, to assess the quality of the learned formula. This measure enables us to compare two Boolean signals and, hence, quantifies how much the labelling signal induced by the formula differs from the true labelling signal (e.g. given by an expert). Therefore, the-count can measure the number of mismatches (either false positives or false negatives) up to some error tolerance. Our supervised learning framework can be expressed by a multicriteria optimization problem with two objective functions: the minimization of false positives and false negatives given by the parametric formula on a signal. We provide an algorithm to solve this multi-criteria optimization problem. Our approach is demonstrated on two case studies involving characterization and classification of labeled ECG (electrocardiogram) data
LNCS
Cyber-physical systems (CPS) and the Internet-of-Things (IoT) result in a tremendous amount of generated, measured and recorded time-series data. Extracting temporal segments that encode patterns with useful information out of these huge amounts of data is an extremely difficult problem. We propose shape expressions as a declarative formalism for specifying, querying and extracting sophisticated temporal patterns from possibly noisy data. Shape expressions are regular expressions with arbitrary (linear, exponential, sinusoidal, etc.) shapes with parameters as atomic predicates and additional constraints on these parameters. We equip shape expressions with a novel noisy semantics that combines regular expression matching semantics with statistical regression. We characterize essential properties of the formalism and propose an efficient approximate shape expression matching procedure. We demonstrate the wide applicability of this technique on two case studies
Symbolic Monitoring against Specifications Parametric in Time and Data
This is the author version of the manuscript of the same name published in the proceedings of the 31st International Conference on Computer-Aided Verification (CAV 2019).International audienceMonitoring consists in deciding whether a log meets a given specification. In this work, we propose an automata-based formalism to monitor logs in the form of actions associated with time stamps and arbitrarily data values over infinite domains. Our formalism uses both timing parameters and data parameters, and is able to output answers symbolic in these parameters and in the log segments where the property is satisfied or violated. We implemented our approach in an ad-hoc prototype SyMon, and experiments show that its high expressive power still allows for efficient online monitoring
Online Parametric Timed Pattern Matching with Automata-Based Skipping
Published in the proceedings of NFM 2019International audienceTimed pattern matching has strong connections with monitoring real-time systems. Given a log and a specification containing timing parameters (that can capture uncertain or unknown constants), parametric timed pattern matching aims at exhibiting for which start and end dates, as well as which parameter valuations, a specification holds on that log. This problem is notably close to robustness. We propose here a new framework for parametric timed pattern matching. Not only we dramatically improve the efficiency when compared to a previous method based on parametric timed model checking, but we further propose optimizations based on skipping. Our algorithm is suitable for online monitoring, and experiments show that it is fast enough to be applied at runtime