Pub Date : 2021-09-07DOI: 10.1109/ETFA45728.2021.9613622
Georg Buchgeher, R. Ramler, Heinz Stummer, H. Kaufmann
Microservices are widely used by large internet companies as they support scalable systems with high resilience and fault-tolerance, flexible and agile development, and continuous delivery enabling fast time to market. Hence, there is an increasing interest in adopting microservices in the field of industrial automation. This raises the question, if and to what degree this architectural style can also be applied for the development of industrial control systems (ICS). In this paper, we have systematically analyzed the applicability of microservices for ICS development. Together with domain experts from industry, we have developed a migration path from a monolithic ICS towards cloud-ready systems based on microservices. By studying the central principles for microservice development and operation, we found that microservices can be applied in the context of ICS and the use of microservices leads to increased flexibility with regard to frequent software releases and the development of new deployment variants. However, communication between real-time services is still an open research challenge that poses a potential technical risk in the migration towards adopting full microservice-based system architectures.
{"title":"Adopting Microservices for Industrial Control Systems: A Five Step Migration Path","authors":"Georg Buchgeher, R. Ramler, Heinz Stummer, H. Kaufmann","doi":"10.1109/ETFA45728.2021.9613622","DOIUrl":"https://doi.org/10.1109/ETFA45728.2021.9613622","url":null,"abstract":"Microservices are widely used by large internet companies as they support scalable systems with high resilience and fault-tolerance, flexible and agile development, and continuous delivery enabling fast time to market. Hence, there is an increasing interest in adopting microservices in the field of industrial automation. This raises the question, if and to what degree this architectural style can also be applied for the development of industrial control systems (ICS). In this paper, we have systematically analyzed the applicability of microservices for ICS development. Together with domain experts from industry, we have developed a migration path from a monolithic ICS towards cloud-ready systems based on microservices. By studying the central principles for microservice development and operation, we found that microservices can be applied in the context of ICS and the use of microservices leads to increased flexibility with regard to frequent software releases and the development of new deployment variants. However, communication between real-time services is still an open research challenge that poses a potential technical risk in the migration towards adopting full microservice-based system architectures.","PeriodicalId":312498,"journal":{"name":"2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122477819","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-07DOI: 10.1109/ETFA45728.2021.9613383
Mattias Hovgard, B. Lennartson, Kristofer Bengtsson
This paper investigates the problem of reducing the energy use of the movements of robots in industrial robot stations that have variations in execution times. An online method is presented that repeatedly solves an optimization problem during the execution of the station, that tries to minimize the energy use by finding the optimal execution times of the robot movements while at the same ensuring that the deadline of the station is met with a high enough probability. The method involves reformulating the original optimization problem, which is stochastic and nonlinear, into a convex version that can be solved efficiently. The method is tested on a simulated robot station and the result shows that the method is fast enough to be useable online and reduces the energy use of the station.
{"title":"Online Energy-Optimal Timing of Stochastic Robot Stations","authors":"Mattias Hovgard, B. Lennartson, Kristofer Bengtsson","doi":"10.1109/ETFA45728.2021.9613383","DOIUrl":"https://doi.org/10.1109/ETFA45728.2021.9613383","url":null,"abstract":"This paper investigates the problem of reducing the energy use of the movements of robots in industrial robot stations that have variations in execution times. An online method is presented that repeatedly solves an optimization problem during the execution of the station, that tries to minimize the energy use by finding the optimal execution times of the robot movements while at the same ensuring that the deadline of the station is met with a high enough probability. The method involves reformulating the original optimization problem, which is stochastic and nonlinear, into a convex version that can be solved efficiently. The method is tested on a simulated robot station and the result shows that the method is fast enough to be useable online and reduces the energy use of the station.","PeriodicalId":312498,"journal":{"name":"2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121254629","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-07DOI: 10.1109/ETFA45728.2021.9613647
Julian Rahm, Daniel Henselmann, L. Urbas
In the process industry, ongoing digitization is leading to a considerable information exchange over the entire life cycle of a process plant. Data models are usually created in the initial planning phases and these change continuously with further progress including the planning phase itself, plant adaptations after commissioning, and maintenance. The various models from the disciplines involved have a considerable semantic overlap, creating dependencies. Changes in one model inevitably lead to changes in another. This paper presents an approach for networking and synchronization between data models based on these overlaps. The resulting synchronization network provides models which are as free of inconsistencies as possible across different disciplines at any point in time. In addition, first approaches for collaborative conflict resolution are presented. Approaches from model-driven software development and web technologies are adapted to the application domain of the process industry. Typical information models created during the planning phase of a process engineering plant serve as an example.
{"title":"Synchronization network of data models in the process industry","authors":"Julian Rahm, Daniel Henselmann, L. Urbas","doi":"10.1109/ETFA45728.2021.9613647","DOIUrl":"https://doi.org/10.1109/ETFA45728.2021.9613647","url":null,"abstract":"In the process industry, ongoing digitization is leading to a considerable information exchange over the entire life cycle of a process plant. Data models are usually created in the initial planning phases and these change continuously with further progress including the planning phase itself, plant adaptations after commissioning, and maintenance. The various models from the disciplines involved have a considerable semantic overlap, creating dependencies. Changes in one model inevitably lead to changes in another. This paper presents an approach for networking and synchronization between data models based on these overlaps. The resulting synchronization network provides models which are as free of inconsistencies as possible across different disciplines at any point in time. In addition, first approaches for collaborative conflict resolution are presented. Approaches from model-driven software development and web technologies are adapted to the application domain of the process industry. Typical information models created during the planning phase of a process engineering plant serve as an example.","PeriodicalId":312498,"journal":{"name":"2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )","volume":"205 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116504518","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-07DOI: 10.1109/ETFA45728.2021.9613699
S. Ramasamy, K. Eriksson, Balasubramanian Perumal, Saptha Peralippatt, F. Danielsson
Optimized path planning of robots are necessary for the industries to thrive towards greater flexibility and sustainability. This paper proposes an implementation of a collision-free path with the shortest distance. The novelty of the work presented is the new ARRT*(Adaptive Rapidly exploring Random Tree Star) algorithm, which is modified from the RRT*(Rapidly exploring Random Tree Star). In a constraint environment, RRT* algorithms tend to fail when searching for suitable collision-free paths. The proposed ARRT* algorithm gives an optimized feasible collision-free paths in a constraint environment. The feasibility to implement RRT* and ARRT* in a Multi Agent System as a path agent for online control of robots is demonstrated. We have created a digital twin simulated environment to find a collision-free path based on these two algorithms. The simulated path is tested in real robots for feasibility and validation purpose. During the real time implementation, we measured the following parameters: the algorithm computation time for generating a collision-free path, move along time of the path in real time, and energy consumed by each path. These parameters were measured for both the RRT* and the ARRT* algorithms and the test results were compared. The test results were showing that ARRT* performs better in a constrained environment. Both algorithms were tested in a Plug and Produce setup and we find that the generated paths for both algorithms are suitable for online path planning applications.
机器人的路径优化规划是工业向更大的灵活性和可持续性发展的必要条件。本文提出了一种最短距离无碰撞路径的实现方法。该研究的新颖之处在于在RRT*(快速探索随机树星)的基础上改进了新的ARRT*(自适应快速探索随机树星)算法。在约束环境下，RRT*算法在寻找合适的无冲突路径时容易失败。提出的ARRT*算法给出了约束环境下可行无碰撞路径的优化。论证了在多智能体系统中实现RRT*和ARRT*作为路径智能体用于机器人在线控制的可行性。基于这两种算法，我们创建了一个数字孪生模拟环境来寻找无碰撞路径。仿真路径在真实机器人上进行了可行性和验证。在实时实现过程中，我们测量了以下参数:生成无碰撞路径的算法计算时间，实时沿路径移动的时间，以及每条路径消耗的能量。测量RRT*和ARRT*算法的这些参数，并比较测试结果。测试结果显示，ARRT*在受限的环境中表现更好。两种算法都在Plug and Produce设置中进行了测试，我们发现两种算法生成的路径都适合在线路径规划应用。
{"title":"Optimized Path Planning by Adaptive RRT* Algorithm for Constrained Environments Considering Energy","authors":"S. Ramasamy, K. Eriksson, Balasubramanian Perumal, Saptha Peralippatt, F. Danielsson","doi":"10.1109/ETFA45728.2021.9613699","DOIUrl":"https://doi.org/10.1109/ETFA45728.2021.9613699","url":null,"abstract":"Optimized path planning of robots are necessary for the industries to thrive towards greater flexibility and sustainability. This paper proposes an implementation of a collision-free path with the shortest distance. The novelty of the work presented is the new ARRT*(Adaptive Rapidly exploring Random Tree Star) algorithm, which is modified from the RRT*(Rapidly exploring Random Tree Star). In a constraint environment, RRT* algorithms tend to fail when searching for suitable collision-free paths. The proposed ARRT* algorithm gives an optimized feasible collision-free paths in a constraint environment. The feasibility to implement RRT* and ARRT* in a Multi Agent System as a path agent for online control of robots is demonstrated. We have created a digital twin simulated environment to find a collision-free path based on these two algorithms. The simulated path is tested in real robots for feasibility and validation purpose. During the real time implementation, we measured the following parameters: the algorithm computation time for generating a collision-free path, move along time of the path in real time, and energy consumed by each path. These parameters were measured for both the RRT* and the ARRT* algorithms and the test results were compared. The test results were showing that ARRT* performs better in a constrained environment. Both algorithms were tested in a Plug and Produce setup and we find that the generated paths for both algorithms are suitable for online path planning applications.","PeriodicalId":312498,"journal":{"name":"2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126081259","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-07DOI: 10.1109/ETFA45728.2021.9613179
Nico Braunisch, Sven Schlesinger, R. Lehmann
In this paper, we present our approach towards a modular and adaptable IoT gateway for operational data and functions in the use case of retrofitting brownfield installation for industrie 4.0. The aim is to enable the existing operational technology installation to provide accessible function endpoints that can be triggered by modern IT services. To fulfill the high demands of flexibility in the IT and the requirements towards time-critical response in the OT a highly decoupled architecture employing a streaming platform is proposed. In perspective to mediating between synchronous interaction in functional aspects and asynchronous behavior in OT-IT communication a function call gateway resolves this issue with the support of a highperformance RPC framework. For the concept to be useful for a wide range of retrofitted OT, design principles and modeling standards of Industrie 4.0 are used.
{"title":"Function call gateway for operational aspects in Industrie 4.0","authors":"Nico Braunisch, Sven Schlesinger, R. Lehmann","doi":"10.1109/ETFA45728.2021.9613179","DOIUrl":"https://doi.org/10.1109/ETFA45728.2021.9613179","url":null,"abstract":"In this paper, we present our approach towards a modular and adaptable IoT gateway for operational data and functions in the use case of retrofitting brownfield installation for industrie 4.0. The aim is to enable the existing operational technology installation to provide accessible function endpoints that can be triggered by modern IT services. To fulfill the high demands of flexibility in the IT and the requirements towards time-critical response in the OT a highly decoupled architecture employing a streaming platform is proposed. In perspective to mediating between synchronous interaction in functional aspects and asynchronous behavior in OT-IT communication a function call gateway resolves this issue with the support of a highperformance RPC framework. For the concept to be useful for a wide range of retrofitted OT, design principles and modeling standards of Industrie 4.0 are used.","PeriodicalId":312498,"journal":{"name":"2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126084963","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-07DOI: 10.1109/ETFA45728.2021.9613698
Andreas Berlet, Julius Rückert, H. Koziolek, R. Drath, Mike Barth
Process engineers design industrial process plants using piping and instrumentation diagrams (P&IDs). Today, data analysts who diagnose plant disturbances based on historical signal trends usually analyze these complex diagrams manually on paper, which is time-consuming and error-prone. In the last 15 years, researchers have thus proposed several approaches and tools to turn these diagrams into machine-readable models that can be processed by software tools. Yet, these tools lack sophisticated query interfaces and intuitive visualizations. We propose the method TOPNAV to navigate plant topology models and aid data analytics. The method supports systematic searching for elements and paths in topology models and feeding the results into analytical tools to facilitate statistical analyses. In a user study, an up to 90% time reduction was observed compared to manual P&ID analysis, while reducing errors significantly.
{"title":"TOPNAV: Efficiently Navigating through Industrial Process Plant Topologies","authors":"Andreas Berlet, Julius Rückert, H. Koziolek, R. Drath, Mike Barth","doi":"10.1109/ETFA45728.2021.9613698","DOIUrl":"https://doi.org/10.1109/ETFA45728.2021.9613698","url":null,"abstract":"Process engineers design industrial process plants using piping and instrumentation diagrams (P&IDs). Today, data analysts who diagnose plant disturbances based on historical signal trends usually analyze these complex diagrams manually on paper, which is time-consuming and error-prone. In the last 15 years, researchers have thus proposed several approaches and tools to turn these diagrams into machine-readable models that can be processed by software tools. Yet, these tools lack sophisticated query interfaces and intuitive visualizations. We propose the method TOPNAV to navigate plant topology models and aid data analytics. The method supports systematic searching for elements and paths in topology models and feeding the results into analytical tools to facilitate statistical analyses. In a user study, an up to 90% time reduction was observed compared to manual P&ID analysis, while reducing errors significantly.","PeriodicalId":312498,"journal":{"name":"2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126856720","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-07DOI: 10.1109/ETFA45728.2021.9613406
S. Kropatschek, Thorsten Steuer, Elmar Kiesling, Kristof Meixner, Thom W. Frühwirth, Patrik Sommer, Daniel Schachinger, S. Biffl
In Cyber-physical Production System (CPPS) engineering, data analysts and domain experts collaborate to identify likely causes for quality issues. Industry 4.0 production assets can provide a wealth of data for analysis, making it difficult to identify the most relevant data. Because data analysts typically do not posses detailed knowledge of the production process, a key challenge is to discover potential causes that impact product quality with various experts, as knowledge about production processes is typically distributed across various domains. To address this, we highlight the need for cross-domain modelling and outline an approach for effective and efficient quality analysis. Specifically, we introduce the Quality Dependency Graph (QDG) to represent cross-domain knowledge dependencies for efficiently prioritizing data sources. We evaluate the QDG in a feasibility study based on a real-world use case in the automotive industry.
{"title":"Towards the Representation of Cross-Domain Quality Knowledge for Efficient Data Analytics","authors":"S. Kropatschek, Thorsten Steuer, Elmar Kiesling, Kristof Meixner, Thom W. Frühwirth, Patrik Sommer, Daniel Schachinger, S. Biffl","doi":"10.1109/ETFA45728.2021.9613406","DOIUrl":"https://doi.org/10.1109/ETFA45728.2021.9613406","url":null,"abstract":"In Cyber-physical Production System (CPPS) engineering, data analysts and domain experts collaborate to identify likely causes for quality issues. Industry 4.0 production assets can provide a wealth of data for analysis, making it difficult to identify the most relevant data. Because data analysts typically do not posses detailed knowledge of the production process, a key challenge is to discover potential causes that impact product quality with various experts, as knowledge about production processes is typically distributed across various domains. To address this, we highlight the need for cross-domain modelling and outline an approach for effective and efficient quality analysis. Specifically, we introduce the Quality Dependency Graph (QDG) to represent cross-domain knowledge dependencies for efficiently prioritizing data sources. We evaluate the QDG in a feasibility study based on a real-world use case in the automotive industry.","PeriodicalId":312498,"journal":{"name":"2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126865201","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-07DOI: 10.1109/ETFA45728.2021.9613413
Zhifeng Li, Zhe Guan, Toru Yamamoto, S. Omatsu
As a nonlinear control algorithm, database-driven PID control (DD-PID) approach has been proposed to learn PID parameters based on a database. This method is based on a strategy in which PID parameters are determined based on neighboring data extracted based on the similarity between the query (current input/output data) and the information vector contained in the database. Since sorting operation is required in extracting the neighbor data, it is impossible to finish the calculation within a certain sampling interval for systems with fast response time, which is one of the hindrances in industrial applications. In addition, the DD-PID requires a large amount of storage memory in the database in order to obtain the desired control performance. On the other hand, one of the neural networks is the cerebellar model articulation controller (CMAC). It is a table-referenced adaptive learning controller. The major advantage of this method lies in the reduction of memory and computational load. This paper discusses a realization of the DD-PID by effectively utilizing the advantage of the CMAC.
{"title":"Realization of a Database-Driven Control System Using a CMAC","authors":"Zhifeng Li, Zhe Guan, Toru Yamamoto, S. Omatsu","doi":"10.1109/ETFA45728.2021.9613413","DOIUrl":"https://doi.org/10.1109/ETFA45728.2021.9613413","url":null,"abstract":"As a nonlinear control algorithm, database-driven PID control (DD-PID) approach has been proposed to learn PID parameters based on a database. This method is based on a strategy in which PID parameters are determined based on neighboring data extracted based on the similarity between the query (current input/output data) and the information vector contained in the database. Since sorting operation is required in extracting the neighbor data, it is impossible to finish the calculation within a certain sampling interval for systems with fast response time, which is one of the hindrances in industrial applications. In addition, the DD-PID requires a large amount of storage memory in the database in order to obtain the desired control performance. On the other hand, one of the neural networks is the cerebellar model articulation controller (CMAC). It is a table-referenced adaptive learning controller. The major advantage of this method lies in the reduction of memory and computational load. This paper discusses a realization of the DD-PID by effectively utilizing the advantage of the CMAC.","PeriodicalId":312498,"journal":{"name":"2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124380526","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-07DOI: 10.1109/ETFA45728.2021.9613178
Z. Bakhshi, G. Rodríguez-Navas, H. Hansson
In our previous work we proposed a fault-tolerant persistent storage for container-based fog architecture. We leveraged the use of containerization to provide storage as a containerized application working along with other containers. As a fault-tolerance mechanism we introduced a replicated data structure and to solve consistency issue between the replicas distributed in the cluster of nodes, we used the RAFT consensus protocol. In this paper, we verify our proposed solution using the UPPAAL model checker. We explain how our solution is modeled in UPPAAL and present a formal verification of key properties related to persistent storage and data consistency between nodes.
{"title":"Using UPPAAL to Verify Recovery in a Fault-tolerant Mechanism Providing Persistent State at the Edge","authors":"Z. Bakhshi, G. Rodríguez-Navas, H. Hansson","doi":"10.1109/ETFA45728.2021.9613178","DOIUrl":"https://doi.org/10.1109/ETFA45728.2021.9613178","url":null,"abstract":"In our previous work we proposed a fault-tolerant persistent storage for container-based fog architecture. We leveraged the use of containerization to provide storage as a containerized application working along with other containers. As a fault-tolerance mechanism we introduced a replicated data structure and to solve consistency issue between the replicas distributed in the cluster of nodes, we used the RAFT consensus protocol. In this paper, we verify our proposed solution using the UPPAAL model checker. We explain how our solution is modeled in UPPAAL and present a formal verification of key properties related to persistent storage and data consistency between nodes.","PeriodicalId":312498,"journal":{"name":"2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127438054","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-09-07DOI: 10.1109/ETFA45728.2021.9613193
Sebastian Schmied, Daniel Grossmann, Selvine G. Mathias, Ralph Klaus Müller
Information models are defined as a comprehensive semantic description of data within a production system. These systems underlay a constant change. Therefore, the corresponding information models are also subject to continuous evolution. This paper shows approaches for the versioning compliant design of information models and their implementation as well as support strategies to assist such changes.
{"title":"A concept towards the evolution and versioning of aggregated information models","authors":"Sebastian Schmied, Daniel Grossmann, Selvine G. Mathias, Ralph Klaus Müller","doi":"10.1109/ETFA45728.2021.9613193","DOIUrl":"https://doi.org/10.1109/ETFA45728.2021.9613193","url":null,"abstract":"Information models are defined as a comprehensive semantic description of data within a production system. These systems underlay a constant change. Therefore, the corresponding information models are also subject to continuous evolution. This paper shows approaches for the versioning compliant design of information models and their implementation as well as support strategies to assist such changes.","PeriodicalId":312498,"journal":{"name":"2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA )","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132608324","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：