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

一个基于一致性的建模与仿真验证框架

A Verification Framework for Component-Based Modeling and Simulation Putting the pieces together

Imran Mahmood

摘要:

本文针对可组合性验证中的一些重要问题,提出了一个综合的验证框架,并给出了一个验证过程,以验证不同类型系统模型(如反应式、实时和概率系统)的可组合性。假设所有这些系统在本质上是并发的,其中不同的组成组件同时相互交互,对结构和行为分析的广泛技术的要求变得越来越具有挑战性。所提出的验证框架提供了方法,技术和工具支持,验证其不同层次的可组合性。这些级别被定义为一致的模型可组合性的基础。每个级别的详细讨论,并提出了一种方法来验证该级别的可组合性。特别是,我们专注于动态语义可组合性水平,因为它在整体可组合性的正确性的意义,也由于它在这个过程中构成的难度水平。为了验证可组合性,在这个层次上,我们研究了三种不同的方法,即(一)基于Petri网的代数分析(二)有色Petri网(CPN)的状态空间分析和(iii)通信顺序进程的模型检验的应用。这三种方法都以不同的方式解决了验证动态语义可组合性的问题,但它们都有相同的目标,即,确认组合模型相对于其需求规范的正确性。

英文摘要:

In this thesis a comprehensive verification framework is proposed to contend with some important issues in composability verification and a verification process is suggested to verify composability of different kinds of systems models, such as reactive, real-time and probabilistic systems. With an assumption that all these systems are concurrent in nature in which different composed components interact with each other simultaneously, the requirements for the extensive techniques for the structural and behavioral analysis becomes increasingly challenging. The proposed verification framework provides methods, techniques and tool support for verifying composability at its different levels. These levels are defined as foundations of consistent model composability. Each level is discussed in detail and an approach is presented to verify composability at that level. In particular we focus on the Dynamic-Semantic Composability level due to its significance in the overall composability correctness and also due to the level of difficulty it poses in the process. In order to verify composability at this level we investigate the application of three different approaches namely (i) Petri Nets based Algebraic Analysis (ii) Colored Petri Nets (CPN) based State-space Analysis and (iii) Communicating Sequential Processes based Model Checking. All three approaches attack the problem of verifying dynamic-semantic composability in different ways however they all share the same aim i.e., to confirm the correctness of a composed model with respect to its requirement specifications.

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

↑