A barrier certificate often serves as an inductive invariant that isolates an unsafe region from the reachable set of states, and hence is widely used in proving safety of hybrid systems possibly over an infinite time horizon. We present a novel condition on barrier certificates, termed the invariant barrier-certificate condition, that witnesses unbounded-time safety of differential dynamical systems. The proposed condition is the weakest possible one to attain inductive invariance. We show that discharging the invariant barrier-certificate condition -- thereby synthesizing invariant barrier certificates -- can be encoded as solving an optimization problem subject to bilinear matrix inequalities (BMIs). We further propose a synthesis algorithm based on difference-of-convex programming, which approaches a local optimum of the BMI problem via solving a series of convex optimization problems. This algorithm is incorporated in a branch-and-bound framework that searches for the global optimum in a divide-and-conquer fashion. We present a weak completeness result of our method, namely, a barrier certificate is guaranteed to be found (under some mild assumptions) whenever there exists an inductive invariant (in the form of a given template) that suffices to certify safety of the system. Experimental results on benchmarks demonstrate the effectiveness and efficiency of our approach.
Best-Effort Inductive Logic Programming via Fine-grained Cost-based Hypothesis Generation
Technische Universität Wien(维也纳技术大学);Marmara University(马尔马拉大学);Karlsruhe Institute of Technology(卡尔斯鲁厄理工学院);Sabanci University(萨班哲大学)
本文介绍了参加第一届归纳逻辑程序设计(ILP)竞赛的计算机系统。它基于Answer Set Programming(ASP)。假设空间生成的ASP编码:给定一组表示模式偏差的事实和一组成本配置参数,该编码的每个答案集表示一个规则,该规则被认为是用于找到需要给定示例的假设。与使用规则体的长度作为规则复杂性度量的最新方法相比,我们的方法允许对假设候选规则的形状进行更细粒度的规范。系统迭代地增加规则成本限制,从而增加搜索空间,直到找到合适的假设。该系统搜索一个假设,需要一个单一的例子,利用ASP编码从XHAIL中使用的编码派生。我们用ILP竞赛的开发和测试集进行实验。为了比较,我们还适应了ILASP系统处理竞争的情况下。实验结果表明,假设搜索空间的代价参数是在有限的资源范围内找到竞争实例的假设的重要因素。