基于粒度的实时的演算与时间自动机接口组件性能评估
Performance Evaluation of Components Using a Granularity-based Interface Between Real-Time Calculus and Timed Automata
摘要:
为了分析复杂和异构的实时的【形】嵌入式系统,最近的工作提出了实时的【形】演算(RTC)和时间自动机(TA)之间的接口技术,以利用每种技术的优势来分析各种组件。但是,由于状态空间爆炸问题,分析由TA建模的基于状态的组件的时间可能过高。在本文中,我们提出了一个框架的粒度为基础的接口,以加快分析的TA建模组件。首先,我们抽象精细的模型,以粗粒度处理事件流。我们在多个粗粒度的组件进行分析,然后基于RTC理论,我们推导出的因果关系闭合算法的细输出流的到达模式的上下界。我们的框架可以帮助实现精度和分析时间之间的权衡。
英文摘要:
To analyze complex and heterogeneous real-time embedded systems, recent works have proposed interface techniques between real-time calculus (RTC) and timed automata (TA), in order to take advantage of the strengths of each technique for analyzing various components. But the time to analyze a state-based component modeled by TA may be prohibitively high, due to the state space explosion problem. In this paper, we propose a framework of granularity-based interfacing to speed up the analysis of a TA modeled component. First, we abstract fine models to work with event streams at coarse granularity. We perform analysis of the component at multiple coarse granularities and then based on RTC theory, we derive lower and upper bounds on arrival patterns of the fine output streams using the causality closure algorithm. Our framework can help to achieve tradeoffs between precision and analysis time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。