Pattern Matching and Parameter Identification for Parametric Timed Regular Expressions

DOI10.1145/3575870.3587115MaRDI QIDQ6202093zbMATH OpenFDO

Authors Akshay Mambakam, Eugene Asarin, Nicolas Basset, Thao Dang

Publication date 21 February 2024

Published in Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)

zbMATH Keywords

pattern matchingmonitoringparametric identificationtimed languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Cites work

• A Boyer-Moore type algorithm for timed pattern matching
• A theory of timed automata
• An Improved Tight Closure Algorithm for Integer Octagonal Constraints
• Efficient parametric identification for STL
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• From MITL to Timed Automata
• Learning specifications for labelled patterns
• Measuring with timed patterns
• Moore-machine filtering for timed and untimed pattern matching
• On the quantitative semantics of regular expressions over real-valued signals
• Online timed pattern matching using automata
• Online timed pattern matching using derivatives
• Parametric real-time reasoning
• Robust satisfaction of temporal logic over real-valued signals
• Specification and efficient monitoring beyond STL
• Specifying timed patterns using temporal logic
• Survey on mining signal temporal logic specifications
• Timed pattern matching
• Timed regular expressions

This page was built for publication: Pattern Matching and Parameter Identification for Parametric Timed Regular Expressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202093)