Pattern Matching and Parameter Identification for Parametric Timed Regular Expressions
DOI10.1145/3575870.3587115MaRDI QIDQ6202093FDOQ6202093
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)
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
- From MITL to Timed Automata
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Parametric real-time reasoning
- Timed regular expressions
- An Improved Tight Closure Algorithm for Integer Octagonal Constraints
- Robust satisfaction of temporal logic over real-valued signals
- Online timed pattern matching using automata
- On the quantitative semantics of regular expressions over real-valued signals
- Online timed pattern matching using derivatives
- Timed pattern matching
- Specification and efficient monitoring beyond STL
- Measuring with timed patterns
- Learning specifications for labelled patterns
- Efficient parametric identification for STL
- Survey on mining signal temporal logic specifications
- Specifying timed patterns using temporal logic
- Moore-machine filtering for timed and untimed pattern matching
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)
