arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1510.08970cs.LOcs.SYeess.SYmath.OC
收藏

鲁棒线性时序逻辑

Robust Linear Temporal Logic

University of California at Los Angeles(加州大学洛杉矶分校)

Paulo Tabuada, Daniel Neider

AI总结:

本文提出鲁棒LTL,通过多值语义定义鲁棒性,证明验证和合成问题可解,验证问题在子公式数量上指数时间,合成问题双指数时间。

摘要:

尽管普遍认为每个系统都应具备鲁棒性,即

英文摘要:

Although it is widely accepted that every system should be robust, in the sense that "small" violations of environment assumptions should lead to "small" violations of system guarantees, it is less clear how to make this intuitive notion of robustness mathematically precise. In this paper, we address this problem by developing a robust version of Linear Temporal Logic (LTL), which we call robust LTL and denote by rLTL. Formulas in rLTL are syntactically identical to LTL formulas but are endowed with a many-valued semantics that encodes robustness. In particular, the semantics of the rLTL formula $φ\Rightarrow ψ$ is such that a "small" violation of the environment assumption $φ$ is guaranteed to only produce a "small" violation of the system guarantee $ψ$. In addition to introducing rLTL, we study the verification and synthesis problems for this logic: similarly to LTL, we show that both problems are decidable, that the verification problem can be solved in time exponential in the number of subformulas of the rLTL formula at hand, and that the synthesis problem can be solved in doubly exponential time.

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

↑