arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2108.05911eess.SYcs.DMcs.FLcs.SY
收藏

自治系统类序列行为静态测试环境的综合

Synthesis of Static Test Environments for Observing Sequence-like Behaviors in Autonomous Systems

Apurva Badithela, Richard M. Murray

摘要:

在本文中,我们研究正式的测试用例生成的高层次的任务目标,特别是可达性,自治系统。我们使用Kripke结构来表示被测Agent的高层决策和测试环境的抽象。首先,我们定义了一个测试规范的概念,专注于一个片段的线性时序逻辑表示的时序逻辑公式。其次,我们制定了测试图合成的问题,找到一个测试配置,代理必须满足测试规范,以满足其任务目标。我们提出了一个基于网络流的算法,通过限制由Kripke结构诱导的原始图上的边删除表示的变迁来合成测试图。该算法使用整数线性规划迭代地合成测试图。我们证明了我们的算法的完备性,我们表明,在每次迭代的边缘删除保持在后续迭代的整数线性规划的可行性。我们形式化的最小约束测试图的最大流方面的概念,并证明合成的测试图是最小约束。我们证明了我们的算法在一个简单的图形和gridworlds。

英文摘要:

In this paper, we investigate formal test-case generation for high-level mission objectives, specifically reachability, of autonomous systems. We use Kripke structures to represent the high-level decision-making of the agent under test and the abstraction of the test environment. First, we define the notion of a test specification, focusing on a fragment of linear temporal logic represented by sequence temporal logic formulas. Second, we formulate the problem of test graph synthesis to find a test configuration for which the agent must satisfy the test specification to satisfy its mission objectives. We an algorithm, based on network flows, for synthesizing a test graph by restricting transitions, represented by edge deletions, on the original graph induced by the Kripke structures. The algorithm synthesizes the test graph iteratively using an integer linear program. We prove completeness for our algorithm, and we show that the edge deletions in each iteration maintain feasibility of the integer linear program in the subsequent iteration. We formalize the notion of a minimally constrained test graph in terms of maximum flow, and prove the synthesized test graph to be minimally constrained. We demonstrate our algorithm on a simple graph and on gridworlds.

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

↑