{"title":"Identification and Validation of Markov Models with Continuous Emission Distributions for Execution Times","authors":"A. Friebe, A. Papadopoulos, T. Nolte","doi":"10.1109/RTCSA50079.2020.9203594","DOIUrl":null,"url":null,"abstract":"It has been shown that in some robotic applications, where the execution times cannot be assumed to be independent and identically distributed, a Markov Chain with discrete emission distributions can be an appropriate model. In this paper we investigate whether execution times can be modeled as a Markov Chain with continuous Gaussian emission distributions. The main advantage of this approach is that the concept of distance is naturally incorporated. We propose a framework based on Hidden Markov Model (HMM) methods that 1) identifies the number of states in the Markov Model from observations and fits the Markov Model to observations, and 2) validates the proposed model with respect to observations. Specifically, we apply a tree-based cross-validation approach to automatically find a suitable number of states in the Markov model. The estimated models are validated against observations, using a data consistency approach based on log likelihood distributions under the proposed model. The framework is evaluated using two test cases executed on a Raspberry Pi Model 3B+ single-board computer running Arch Linux ARM patched with PREEMPT_RT. The first is a simple test program where execution times intentionally vary according to a Markov model, and the second is a video decompression using the ffmpeg program. The results show that in these cases the framework identifies Markov Chains with Gaussian emission distributions that are valid models with respect to the observations.","PeriodicalId":38446,"journal":{"name":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","volume":"36 1","pages":"1-10"},"PeriodicalIF":0.5000,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Embedded and Real-Time Communication Systems (IJERTCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTCSA50079.2020.9203594","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 4
Abstract
It has been shown that in some robotic applications, where the execution times cannot be assumed to be independent and identically distributed, a Markov Chain with discrete emission distributions can be an appropriate model. In this paper we investigate whether execution times can be modeled as a Markov Chain with continuous Gaussian emission distributions. The main advantage of this approach is that the concept of distance is naturally incorporated. We propose a framework based on Hidden Markov Model (HMM) methods that 1) identifies the number of states in the Markov Model from observations and fits the Markov Model to observations, and 2) validates the proposed model with respect to observations. Specifically, we apply a tree-based cross-validation approach to automatically find a suitable number of states in the Markov model. The estimated models are validated against observations, using a data consistency approach based on log likelihood distributions under the proposed model. The framework is evaluated using two test cases executed on a Raspberry Pi Model 3B+ single-board computer running Arch Linux ARM patched with PREEMPT_RT. The first is a simple test program where execution times intentionally vary according to a Markov model, and the second is a video decompression using the ffmpeg program. The results show that in these cases the framework identifies Markov Chains with Gaussian emission distributions that are valid models with respect to the observations.
研究表明,在某些机器人应用中,当执行时间不能假设为独立且同分布时,具有离散发射分布的马尔可夫链可以作为合适的模型。本文研究了执行时间是否可以用具有连续高斯发射分布的马尔可夫链来建模。这种方法的主要优点是自然地包含了距离的概念。我们提出了一个基于隐马尔可夫模型(HMM)方法的框架,该框架1)从观测中识别马尔可夫模型中的状态数,并将马尔可夫模型拟合到观测值中,2)根据观测值验证所提出的模型。具体来说,我们应用基于树的交叉验证方法来自动找到马尔可夫模型中合适数量的状态。使用基于所提出模型下的对数似然分布的数据一致性方法,根据观测值对估计模型进行验证。该框架使用两个测试用例在Raspberry Pi Model 3B+单板计算机上执行,运行带有PREEMPT_RT补丁的Arch Linux ARM。第一个是一个简单的测试程序,其中执行时间会根据马尔可夫模型而有所不同,第二个是使用ffmpeg程序的视频解压缩。结果表明,在这些情况下,框架识别出具有高斯发射分布的马尔可夫链,这是相对于观测的有效模型。