Quantitative monitoring of STL with edit distance

DOI10.1007/s10703-018-0319-xzbMath1394.68230OpenAlexW2795231670WikidataQ92909322 ScholiaQ92909322MaRDI QIDQ1667648

Peng Zhang

Publication date: 30 August 2018

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-018-0319-x

zbMATH Keywords

robustnessdynamic programmingruntime verificationweighted edit distancehardware monitors

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (10)

Offline and online monitoring of scattered uncertain logs using uncertain linear dynamical systems ⋮ Wireless protocol validation under uncertainty ⋮ Quantitative monitoring of STL with edit distance ⋮ Bridging the gap between single- and multi-model predictive runtime verification ⋮ From LTL to rLTL monitoring: improved monitorability through robust semantics ⋮ Model predictive monitoring of dynamical systems for signal temporal logic specifications ⋮ TeLEx: learning signal temporal logic from positive examples using tightness metric ⋮ A survey of challenges for runtime verification from advanced application domains (beyond software) ⋮ Introduction to the special issue on runtime verification ⋮ Algebraic quantitative semantics for efficient online temporal monitoring

Uses Software

• ANTLR
• S-TaLiRo
• Breach

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robustness of temporal logic specifications for continuous-time signals
• Handbook of weighted automata
• Fast string correction with Levenshtein automata
• Quantitative monitoring of STL with edit distance
• Time robustness in MTL and expressivity in hybrid system falsification
• Computing the edit distance of a regular language
• Robust online monitoring of signal temporal logic
• STL*: extending signal temporal logic with signal-value freezing operator
• Weighted Symbolic Automata with Data Storage
• S-TaLiRo: A Tool for Temporal Logic Falsification for Hybrid Systems
• On the Merits of Temporal Testers
• Robust Satisfaction of Temporal Logic over Real-Valued Signals
• Epsilon-Tubes and Generalized Skorokhod Metrics for Hybrid Paths Spaces
• Order- n correction for regular languages
• Sampling-50 years after Shannon
• Symbolic Automata Constraint Solving
• Data-Driven Statistical Learning of Temporal Logic Properties
• EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
• Quantifying conformance using the Skorokhod metric
• Computer Aided Verification

This page was built for publication: Quantitative monitoring of STL with edit distance