Timed Pattern Matching
Timed Pattern Matching
复制标题
定时模式匹配
DOI：
--
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
O. Maler
中科院分区：
文献类型：
--
作者：
Dogan Ulus;Thomas Ferrère;E. Asarin;O. Maler
给定一个定时正则表达式和一个密集时间布尔信号，我们计算信号中表达式的所有匹配的集合，即满足正则表达式的信号的所有片段的集合。匹配集被视为二维空间中的点集，每个点指示真实的时间轴上的匹配段的开始和结束。我们的程序，它的工作原理是通过归纳的结构上的表达，是基于以下结果，我们证明在本文中：一个定时正则表达式的所有匹配的信号的有限的变化和持续时间的集合可以被写为一个有限的工会区。
Given a timed regular expression and a dense-time Boolean signal we compute the set of all matches of the expression in the signal, that is, the set of all segments of the signal that satisfy the regular expression. The set of matches is viewed as a set of points in a two-dimensional space with each point indicating the beginning and end of a matching segment on the real time axis. Our procedure, which works by induction on the structure of the expression, is based on the following result that we prove in this paper: the set of all matches of a timed regular expression by a signal of finite variability and duration can be written as a finite union of zones.