USING SEQUENTIAL CLUSTERING TO IDENTIFICATION OF HYBRID TIMED AUTOMATA FROM ANALOG IIOT DATA

Q3 Engineering
Kirill Kadomskіy
{"title":"USING SEQUENTIAL CLUSTERING TO IDENTIFICATION OF HYBRID TIMED AUTOMATA FROM ANALOG IIOT DATA","authors":"Kirill Kadomskіy","doi":"10.34229/1028-0979-2021-5-3","DOIUrl":null,"url":null,"abstract":"In Industrial IoT (IIoT) systems, timed automata provide a highly useful abstraction for diagnosis and control tasks. Applying them requires automaton to be learned in passive online manner using positive samples only. Such kind of learning is supported by Hybrid timed Automata (HTA) and algorithm OTALA, but requireds a sequence of discrete events rather than continuous analog time series typically found in IIoT. Recent attempts to cover this gap, taken by A. von Birgelen, O. Niggemann, and others, involved pre-processing observations with a self-organized map (SOM) and watershed transform, yet resulting models have proven ineffective in some real-world systems. In this paper, incremental model-based clustering (IMCF) is employed to learn timed automaton from analog IIoT data. IMCF is a sequential algorithm that processes observed time-series online and splits them into a sequence of discrete states with either crisp or fuzzy transitions between them. Such transitions are then treated as events required for HTA identification with OTALA. Obtained models are evaluated in a case of IIoT system that has proved to be challenging for existing modelling techniques. Experimental results show 24,9–76,8% increase in model’s performance and suggest that discretizing obtained with IMCF has higher informativeness for HTA identification. Finally, wider perspectives of applying HTA in IIoT are discussed, and remaining principal limitations are identified as discrete nature of state transitions, and lack of long-term memory for transitions.","PeriodicalId":54874,"journal":{"name":"Journal of Automation and Information Sciences","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Automation and Information Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.34229/1028-0979-2021-5-3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

Abstract

In Industrial IoT (IIoT) systems, timed automata provide a highly useful abstraction for diagnosis and control tasks. Applying them requires automaton to be learned in passive online manner using positive samples only. Such kind of learning is supported by Hybrid timed Automata (HTA) and algorithm OTALA, but requireds a sequence of discrete events rather than continuous analog time series typically found in IIoT. Recent attempts to cover this gap, taken by A. von Birgelen, O. Niggemann, and others, involved pre-processing observations with a self-organized map (SOM) and watershed transform, yet resulting models have proven ineffective in some real-world systems. In this paper, incremental model-based clustering (IMCF) is employed to learn timed automaton from analog IIoT data. IMCF is a sequential algorithm that processes observed time-series online and splits them into a sequence of discrete states with either crisp or fuzzy transitions between them. Such transitions are then treated as events required for HTA identification with OTALA. Obtained models are evaluated in a case of IIoT system that has proved to be challenging for existing modelling techniques. Experimental results show 24,9–76,8% increase in model’s performance and suggest that discretizing obtained with IMCF has higher informativeness for HTA identification. Finally, wider perspectives of applying HTA in IIoT are discussed, and remaining principal limitations are identified as discrete nature of state transitions, and lack of long-term memory for transitions.
利用序列聚类方法从模拟物联网数据中识别混合时间自动机
在工业物联网(IIoT)系统中,时间自动机为诊断和控制任务提供了非常有用的抽象。应用它们需要自动机以被动在线的方式学习,只使用正样本。这种学习由混合时间自动机(HTA)和OTALA算法支持,但需要一系列离散事件,而不是IIoT中常见的连续模拟时间序列。最近,a . von Birgelen、O. Niggemann等人尝试用自组织地图(SOM)和分水岭变换对观测结果进行预处理,但结果模型在一些现实世界的系统中被证明是无效的。本文采用基于增量模型的聚类(IMCF)从模拟IIoT数据中学习时间自动机。IMCF是一种顺序算法,它在线处理观察到的时间序列,并将它们分成一系列离散状态,它们之间有清晰或模糊的过渡。然后将此类转换视为与OTALA进行HTA识别所需的事件。在工业物联网系统的情况下评估获得的模型,该系统已被证明对现有建模技术具有挑战性。实验结果表明,模型性能提高了24.9 ~ 76.8%,表明用IMCF进行离散化对HTA识别具有较高的信息量。最后,讨论了在工业物联网中应用HTA的更广泛视角,并将剩余的主要限制确定为状态转换的离散性质,以及缺乏对转换的长期记忆。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Automation and Information Sciences
Journal of Automation and Information Sciences AUTOMATION & CONTROL SYSTEMS-
自引率
0.00%
发文量
0
审稿时长
6-12 weeks
期刊介绍: This journal contains translations of papers from the Russian-language bimonthly "Mezhdunarodnyi nauchno-tekhnicheskiy zhurnal "Problemy upravleniya i informatiki". Subjects covered include information sciences such as pattern recognition, forecasting, identification and evaluation of complex systems, information security, fault diagnosis and reliability. In addition, the journal also deals with such automation subjects as adaptive, stochastic and optimal control, control and identification under uncertainty, robotics, and applications of user-friendly computers in management of economic, industrial, biological, and medical systems. The Journal of Automation and Information Sciences will appeal to professionals in control systems, communications, computers, engineering in biology and medicine, instrumentation and measurement, and those interested in the social implications of technology.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信