arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1602.04294cs.FLcs.LO
收藏

时间窗时序逻辑

Time Window Temporal Logic

Cristian-Ioan Vasile, Derya Aksaray, Calin Belta

摘要:

本文介绍了时间窗口时序逻辑(TWTL),一个丰富的表达能力的语言,用于描述各种时间有界规范。特别是,TWTL的语法和语义使串行任务的紧凑表示成为可能,这通常见于机器人和控制应用。本文还讨论了TWTL公式关于任务截止期的松弛问题。有效的自动机为基础的框架,以解决综合,验证和学习问题。所提出的解决方案的关键成分是一个算法,翻译一个TWTL公式的注释有限状态自动机,编码所有可能的时间松弛的规范。案例研究说明了表达的逻辑和提出的算法。

英文摘要:

This paper introduces time window temporal logic (TWTL), a rich expressivity language for describing various time bounded specifications. In particular, the syntax and semantics of TWTL enable the compact representation of serial tasks, which are typically seen in robotics and control applications. This paper also discusses the relaxation of TWTL formulae with respect to deadlines of tasks. Efficient automata-based frameworks to solve synthesis, verification and learning problems are also presented. The key ingredient to the presented solution is an algorithm to translate a TWTL formula to an annotated finite state automaton that encodes all possible temporal relaxations of the specification. Case studies illustrating the expressivity of the logic and the proposed algorithms are included.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑