当前位置: X-MOL 学术arXiv.cs.FL › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Temporal-Logic Query Checking over Finite Data Streams
arXiv - CS - Formal Languages and Automata Theory Pub Date : 2020-06-06 , DOI: arxiv-2006.03751
Samuel Huang and Rance Cleaveland

This paper describes a technique for inferring temporal-logic properties for sets of finite data streams. Such data streams arise in many domains, including server logs, program testing, and financial and marketing data; temporal-logic formulas that are satisfied by all data streams in a set can provide insight into the underlying dynamics of the system generating these streams. Our approach makes use of so-called Linear Temporal Logic (LTL) queries, which are LTL formulas containing a missing subformula and interpreted over finite data streams. Solving such a query involves computing a subformula that can be inserted into the query so that the resulting grounded formula is satisfied by all data streams in the set. We describe an automaton-driven approach to solving this query-checking problem and demonstrate a working implementation via a pilot study.

中文翻译:

有限数据流上的时态逻辑查询检查

本文描述了一种推断有限数据流集的时间逻辑属性的技术。此类数据流出现在许多领域,包括服务器日志、程序测试以及财务和营销数据;一组中所有数据流都满足的时间逻辑公式可以深入了解生成这些流的系统的潜在动态。我们的方法利用所谓的线性时间逻辑 (LTL) 查询,这些查询是包含缺失子公式并在有限数据流上解释的 LTL 公式。解决这样的查询涉及计算可以插入到查询中的子公式,以便生成的基础公式满足集合中的所有数据流。
更新日期:2020-06-09
down
wechat
bug