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

一个用于验证的代数框架

An Algebraic Framework for Runtime Verification

Stefan Jaksic, Ezio Bartocci, Radu Grosu, Dejan Nickovic

摘要:

网络验证(RV)是一种实用的、可扩展的、严格的技术,用于评估复杂系统的正确性,包括网络物理系统(CPS)。通过测量CPS运行满足规范的稳健程度,RV还允许量化CPS对扰动的弹性。在本文中,我们提出了代数验证(ARV),一个通用的,语义框架RV,它利用了monoidal结构的运行(w.r.t.级联)和规范自动机的半环结构(w.r.t.选择和连接),以增量和应用特定的方式计算弹性测量。这使我们能够通过开发一个抽象的监控算法来揭示RV的核心方面,并通过实例化选择和与应用程序指定的实值函数的级联来加强和统一RV的各种定性和定量方法。我们展示了我们的框架的权力和有效性,从汽车领域的两个案例研究。

英文摘要:

Runtime verification (RV) is a pragmatic and scalable, yet rigorous technique, to assess the correctness of complex systems, including cyber-physical systems (CPS). By measuring how robustly a CPS run satisfies a specification, RV allows in addition, to quantify the resiliency of a CPS to perturbations. In this paper we propose Algebraic Runtime Verification (ARV), a general, semantic framework for RV, which takes advantage of the monoidal structure of runs (w.r.t. concatenation) and the semiring structure of a specification automaton (w.r.t. choice and concatenation), to compute in an incremental and application specific fashion the resiliency measure. This allows us to expose the core aspects of RV, by developing an abstract monitoring algorithm, and to strengthen and unify the various qualitative and quantitative approaches to RV, by instantiating choice and concatenation with real-valued functions as dictated by the application. We demonstrate the power and effectiveness of our framework on two case studies from the automotive domain.

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

↑