Online Timed Pattern Matching Using Automata

Bakhirkin, Alexey; Ferrère, Thomas; Ničković, Dejan; Maler, Oded; Asarin, Eugène

doi:10.1007/978-3-030-00151-3_13

Cited by 16 publications

(3 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the context of quality assurance of CPSs, monitoring of digital (i. e., discrete-valued) or analog (i. e., continuous-valued) signals takes an important role. There have been many works on signal monitoring using various logic e. g., signal temporal logic (STL) [MN04; FP09], timed regular expressions (TREs) [Ulu+14], timed automata [Bak+18], or timed symbolic weighted automata (TSWAs) [Wag19]. However, in most of the existing works, interpolation of the sampled signals is limited to only piecewise-constant or piecewise-linear.…”

Section: Related Workmentioning

confidence: 99%

Model-bounded monitoring of hybrid systems

Waga¹,

André²,

Hasuo³

2021

Preprint

View full text Add to dashboard Cite

Monitoring of hybrid systems attracts both scientific and practical attention. However, monitoring algorithms suffer from the methodological difficulty of only observing sampled discrete-time signals, while real behaviors are continuous-time signals. To mitigate this problem of sampling uncertainties, we introduce a model-bounded monitoring scheme, where we use prior knowledge about the target system to prune interpolation candidates. Technically, we express such prior knowledge by linear hybrid automata (LHAs)-the LHAs are called bounding models. We introduce a novel notion of monitored language of LHAs, and we reduce the monitoring problem to the membership problem of the monitored language. We present two partial algorithms-one is via reduction to reachability in LHAs and the other is a direct one using polyhedra-and show that these methods, and thus the proposed model-bounded monitoring scheme, are efficient and practically relevant.

show abstract

Section: Related Workmentioning

confidence: 99%

Model-bounded monitoring of hybrid systems

Waga¹,

André²,

Hasuo³

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…A recent line of work is that of timed pattern matching, that takes as input a log and a specification, and decides where in the log the specification is satisfied or violated. On the one hand, a line of works considers signals, with specifications either in the form of timed regular expressions [11,[31][32][33], or a temporal logic [34]. On the other hand, a line of works considers timed words, with specifications in the form of timed automata [4,36].…”

Section: Related Workmentioning

confidence: 99%

Symbolic Monitoring Against Specifications Parametric in Time and Data

Waga¹,

André²,

Hasuo³

2019

Computer Aided Verification

View full text Add to dashboard Cite

0000−0001−9360−7490] ,Étienne André 4,5,1[0000−0001−8473−9555] , and Ichiro Hasuo 1,2[0000−0002−8300−4650]Abstract. Monitoring 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.

show abstract

“…For such formalisms, monitoring problems have been often phrased as pattern-matching: given a behaviour and a specification (a pattern), detect all the time intervals when the pattern occurs. Efficient algorithms have been developed for matching patterns specified by TA, or various kinds of TRE and temporal logics [8,11,15,21,22].…”

Section: Introductionmentioning

confidence: 99%

Pattern Matching and Parameter Identification for Parametric Timed Regular Expressions

Mambakam

Asarin

Basset

et al. 2023

Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control

View full text Add to dashboard Cite

Timed formalisms such as Timed Automata (TA), Signal Temporal Logic (STL) and Timed Regular expressions (TRE) have been previously applied as behaviour specifications for monitoring or runtime verification, in particular, under the form of pattern-matching, i.e. computing the set of all the segments of a given system run that satisfy the specification.In this work, timed regular expressions with parameters (for timing delays and for signal values) are considered. We define several classes of parametric expressions (based on Boolean or real-valued signals and discrete events), and tackle the problem of computing a parametric match-set, i.e. the parameter values and time segments of data that give a match for a given expression. We propose efficient data structures for representing match-sets (combining zones and polytopes), and devise pattern-matching algorithms. All these different types and algorithms are combined into a single implementation under a tool named parameTRE. We illustrate the approach on several examples, from electrocardiograms to driving patterns. CCS CONCEPTS• Theory of computation → Timed and hybrid models; • Computing methodologies → Algebraic algorithms.

show abstract

Online Timed Pattern Matching Using Automata

Cited by 16 publications

References 26 publications

Model-bounded monitoring of hybrid systems

Model-bounded monitoring of hybrid systems

Symbolic Monitoring Against Specifications Parametric in Time and Data

Pattern Matching and Parameter Identification for Parametric Timed Regular Expressions

Contact Info

Product

Resources

About