Pub Date : 2018-09-01DOI: 10.1109/ETFA.2018.8502479
Julius Pfrommer, A. Ebner, S. Ravikumar, B. Karunakaran
OPC UA is a client-server communication protocol for industrial use cases without hard realtime requirements. The new PubSub extension of OPC UA adds the possibility of many-to-many communication based on the Publish / Subscribe paradigm. In conjunction with the upcoming Time-Sensitive Networking (TSN) extensions of Ethernet, OPC UA Pub Sub aims to also cover time-deterministic connectivity. This poses requirements to OPC UA implementations that have traditionally not been regarded. We propose an approach to combine non-realtime OPCUA servers with realtime OPC UA Pub Sub where both can access a shared information model without the loss of realtime guarantees for the publisher. As a result, the publisher can be run inside a (hardware-triggered) interrupt to ensure short delays and small jitter. An open source implementation of OPC UA Pub Sub is provided based on the open62541 SDK. This is also the basis for measurements used to evaluate the potential of the technology.
OPC UA是一种客户端-服务器通信协议，适用于没有硬性实时需求的工业用例。OPC UA的新PubSub扩展增加了基于发布/订阅范式的多对多通信的可能性。与即将到来的以太网时间敏感网络(TSN)扩展相结合，OPC UA Pub Sub旨在覆盖时间确定性连接。这对OPC UA实现提出了传统上不被重视的要求。我们提出了一种将非实时OPCUA服务器与实时OPCUA Pub Sub相结合的方法，在这种方法中，两者都可以访问共享的信息模型，而不会失去对发布者的实时性保证。因此，发布者可以在(硬件触发的)中断中运行，以确保较短的延迟和较小的抖动。基于open62541 SDK提供了OPC UA Pub Sub的开源实现。这也是用于评估该技术潜力的测量的基础。
{"title":"Open Source OPC UA PubSub Over TSN for Realtime Industrial Communication","authors":"Julius Pfrommer, A. Ebner, S. Ravikumar, B. Karunakaran","doi":"10.1109/ETFA.2018.8502479","DOIUrl":"https://doi.org/10.1109/ETFA.2018.8502479","url":null,"abstract":"OPC UA is a client-server communication protocol for industrial use cases without hard realtime requirements. The new PubSub extension of OPC UA adds the possibility of many-to-many communication based on the Publish / Subscribe paradigm. In conjunction with the upcoming Time-Sensitive Networking (TSN) extensions of Ethernet, OPC UA Pub Sub aims to also cover time-deterministic connectivity. This poses requirements to OPC UA implementations that have traditionally not been regarded. We propose an approach to combine non-realtime OPCUA servers with realtime OPC UA Pub Sub where both can access a shared information model without the loss of realtime guarantees for the publisher. As a result, the publisher can be run inside a (hardware-triggered) interrupt to ensure short delays and small jitter. An open source implementation of OPC UA Pub Sub is provided based on the open62541 SDK. This is also the basis for measurements used to evaluate the potential of the technology.","PeriodicalId":6566,"journal":{"name":"2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"10 1","pages":"1087-1090"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87322293","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 : 2018-09-01DOI: 10.1109/ETFA.2018.8502523
Aakash Soni, Xiaoting Li, Jean-Luc Scharbarg, C. Fraboul
In order to handle mixed criticality flows in a realtime embedded network, switched Ethernet with Quality of Service (QoS) facilities has become a popular solution. Deficit Round Robin (DRR) is such a QoS facility. Worst-Case Traversal Time (WCTT) analysis is mandatory for such systems, in order to ensure that end-to-end delay constraints are met. Network Calculus is a classical approach to achieve this WCTT analysis. A solution has been proposed for switched Ethernet with DRR. It computes pessimistic upper bounds on end-to-end latencies. This pessimism is partly due to the fact that the scheduling of flows by end systems is not considered in the analysis. This scheduling can be modeled by offsets between flows. This modeling has been integrated in WCTT analysis of switched Ethernet with First In First Out (FIFO) scheduling. It leads to a significant reduction of delay upper bounds. The contribution of this paper is to integrate the offsets in the WCTT analysis for switched Ethernet with DRR and to evaluate the reduction on delay upper bounds, considering a realistic case study.
{"title":"Integrating Offset in Worst Case Delay Analysis of Switched Ethernet Network With Deficit Round Robbin","authors":"Aakash Soni, Xiaoting Li, Jean-Luc Scharbarg, C. Fraboul","doi":"10.1109/ETFA.2018.8502523","DOIUrl":"https://doi.org/10.1109/ETFA.2018.8502523","url":null,"abstract":"In order to handle mixed criticality flows in a realtime embedded network, switched Ethernet with Quality of Service (QoS) facilities has become a popular solution. Deficit Round Robin (DRR) is such a QoS facility. Worst-Case Traversal Time (WCTT) analysis is mandatory for such systems, in order to ensure that end-to-end delay constraints are met. Network Calculus is a classical approach to achieve this WCTT analysis. A solution has been proposed for switched Ethernet with DRR. It computes pessimistic upper bounds on end-to-end latencies. This pessimism is partly due to the fact that the scheduling of flows by end systems is not considered in the analysis. This scheduling can be modeled by offsets between flows. This modeling has been integrated in WCTT analysis of switched Ethernet with First In First Out (FIFO) scheduling. It leads to a significant reduction of delay upper bounds. The contribution of this paper is to integrate the offsets in the WCTT analysis for switched Ethernet with DRR and to evaluate the reduction on delay upper bounds, considering a realistic case study.","PeriodicalId":6566,"journal":{"name":"2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"24 1","pages":"353-359"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85678051","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 : 2018-09-01DOI: 10.1109/ETFA.2018.8502631
Antje Rogalla, A. Fay, O. Niggemann
Current production planning and scheduling systems in automation do not meet the requirements of modern individualized production. Today's, static production processes impede customized manufacturing and small-scale production. A new way of thinking towards a dynamic control is required. This paper focuses on automated integrated process planning and scheduling on control level in discrete manufacturing. Existing algorithms in artificial intelligence planning are applied to solve process planning and scheduling problems. The challenge is to model the manufacturing system and products in a way that automated planners can generate efficiently process plans and schedules. Hence, based on a general classification of operations, different modeling options with regard to a successful automated process planning and scheduling are discussed. As a result, a domain modeling approach for discrete manufacturing is presented.
{"title":"Improved Domain Modeling for Realistic Automated Planning and Scheduling in Discrete Manufacturing","authors":"Antje Rogalla, A. Fay, O. Niggemann","doi":"10.1109/ETFA.2018.8502631","DOIUrl":"https://doi.org/10.1109/ETFA.2018.8502631","url":null,"abstract":"Current production planning and scheduling systems in automation do not meet the requirements of modern individualized production. Today's, static production processes impede customized manufacturing and small-scale production. A new way of thinking towards a dynamic control is required. This paper focuses on automated integrated process planning and scheduling on control level in discrete manufacturing. Existing algorithms in artificial intelligence planning are applied to solve process planning and scheduling problems. The challenge is to model the manufacturing system and products in a way that automated planners can generate efficiently process plans and schedules. Hence, based on a general classification of operations, different modeling options with regard to a successful automated process planning and scheduling are discussed. As a result, a domain modeling approach for discrete manufacturing is presented.","PeriodicalId":6566,"journal":{"name":"2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"6 1","pages":"464-471"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88702938","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 : 2018-09-01DOI: 10.1109/ETFA.2018.8502492
Shanmugasivam Pillai, Naveen John Punnoose, P. Vadakkepat, A. Loh, Kee Jin Lee
Factories are increasingly pushing towards automation and data-centric approaches under the current Industry 4.0 standards. Early-stage product quality estimation is identified as one of the solutions that can significantly reduce manufacturing cost and wastage. However, quality estimation is a classification problem that is inherently challenging for traditional data-driven algorithms due to its imbalanced nature. In this paper, a framework is proposed, that combines the feature extraction capabilities of convolutional neural networks and the domain knowledge characteristics of fuzzy systems. The proposed method addresses data imbalance using an ensemble of class-biased individuals, that learn features using a class-weighted loss function. Experiments were conducted using a benchmark dataset and production data acquired from the semiconductor industry. Improvements were noted for G-Mean and ROC-AVC values when compared to existing algorithms.
{"title":"An Ensemble of fuzzy Class-Biased Networks for Product Quality Estimation","authors":"Shanmugasivam Pillai, Naveen John Punnoose, P. Vadakkepat, A. Loh, Kee Jin Lee","doi":"10.1109/ETFA.2018.8502492","DOIUrl":"https://doi.org/10.1109/ETFA.2018.8502492","url":null,"abstract":"Factories are increasingly pushing towards automation and data-centric approaches under the current Industry 4.0 standards. Early-stage product quality estimation is identified as one of the solutions that can significantly reduce manufacturing cost and wastage. However, quality estimation is a classification problem that is inherently challenging for traditional data-driven algorithms due to its imbalanced nature. In this paper, a framework is proposed, that combines the feature extraction capabilities of convolutional neural networks and the domain knowledge characteristics of fuzzy systems. The proposed method addresses data imbalance using an ensemble of class-biased individuals, that learn features using a class-weighted loss function. Experiments were conducted using a benchmark dataset and production data acquired from the semiconductor industry. Improvements were noted for G-Mean and ROC-AVC values when compared to existing algorithms.","PeriodicalId":6566,"journal":{"name":"2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"7 1","pages":"615-622"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88713259","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 : 2018-09-01DOI: 10.1109/etfa.2018.8502521
{"title":"Intelligent Sensors, Sensor Networks, and Information Processing","authors":"","doi":"10.1109/etfa.2018.8502521","DOIUrl":"https://doi.org/10.1109/etfa.2018.8502521","url":null,"abstract":"","PeriodicalId":6566,"journal":{"name":"2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"69 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86148419","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 : 2018-09-01DOI: 10.1109/ETFA.2018.8502471
Alioune Mbaye, D. Lefebvre, F. Basile
This paper concerns the design of optimal control sequences for timed Petri nets under earliest firing policy. Optimality is defined with respect to the sequences duration. The proposed method computes the control firing sequence and its duration by solving integer linear problems constrained by a set of matrix inequalities that must be fulfilled by a sequence of elementary firing count vectors. To reduce the error that may affect the estimation of the sequence duration, an expansion of the net structure is proposed with respect to the time parameters. The estimation error is proved to be bounded depending on a granularity parameter used for expansion.
{"title":"Control design for timed Petri nets based on LMIs and structure expansion","authors":"Alioune Mbaye, D. Lefebvre, F. Basile","doi":"10.1109/ETFA.2018.8502471","DOIUrl":"https://doi.org/10.1109/ETFA.2018.8502471","url":null,"abstract":"This paper concerns the design of optimal control sequences for timed Petri nets under earliest firing policy. Optimality is defined with respect to the sequences duration. The proposed method computes the control firing sequence and its duration by solving integer linear problems constrained by a set of matrix inequalities that must be fulfilled by a sequence of elementary firing count vectors. To reduce the error that may affect the estimation of the sequence duration, an expansion of the net structure is proposed with respect to the time parameters. The estimation error is proved to be bounded depending on a granularity parameter used for expansion.","PeriodicalId":6566,"journal":{"name":"2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"21 1","pages":"426-432"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81597129","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 : 2018-09-01DOI: 10.1109/ETFA.2018.8502527
Martin Rudorfer, Jan Guhl, Paul Hoffmann, J. Krüger
In this paper we contribute to the research on facilitating industrial robot programming by presenting a concept for intuitive drag and drop like programming of pick and place tasks with Augmented Reality (AR). We propose a service-oriented architecture to achieve easy exchangeability of components and scalability with respect to AR devices and robot workplaces. Our implementation uses a HoloLens and a UR5 robot, which are integrated into a framework of RESTful web services. The user can drag recognized objects and drop them at a desired position to initiate a pick and place task. Although the positioning accuracy is unsatisfactory yet, our implemented prototype achieves most of the desired advantages to proof the concept.
{"title":"Holo Pick'n'Place","authors":"Martin Rudorfer, Jan Guhl, Paul Hoffmann, J. Krüger","doi":"10.1109/ETFA.2018.8502527","DOIUrl":"https://doi.org/10.1109/ETFA.2018.8502527","url":null,"abstract":"In this paper we contribute to the research on facilitating industrial robot programming by presenting a concept for intuitive drag and drop like programming of pick and place tasks with Augmented Reality (AR). We propose a service-oriented architecture to achieve easy exchangeability of components and scalability with respect to AR devices and robot workplaces. Our implementation uses a HoloLens and a UR5 robot, which are integrated into a framework of RESTful web services. The user can drag recognized objects and drop them at a desired position to initiate a pick and place task. Although the positioning accuracy is unsatisfactory yet, our implemented prototype achieves most of the desired advantages to proof the concept.","PeriodicalId":6566,"journal":{"name":"2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"2 1","pages":"1219-1222"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89712992","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 : 2018-09-01DOI: 10.1109/ETFA.2018.8502660
J. L. Flores, Imanol Mugarza
The IoT and IIoT paradigms are creating new business opportunities. However, high-interconnectivity among all objects introduce new security concerns and challenges. Security is not a product, but a process. Security tests and audits have to constantly be accomplished. Once a security flaw is detected, a software patch fixing the security weakness could be then produced. This continuous security evaluation, which is iterative, might be expensive. In this paper, a novel vulnerability discovery approach is presented: Hadros. The particularity of the proposed design is that security tests are distributively executed among all the deployed IoT/IIoT nodes and performed at the idle time of the system, while runtime. Hadros is suitable and advantageous for the IoT and IIoT era, due to the fact that testing coverage is broadly increased as more devices are incorporated. Meanwhile, resources employed by the security researchers are also significantly reduced.
{"title":"Runtime Vulnerability Discovery as a Service on Industrial Internet of Things (IIoT) Systems","authors":"J. L. Flores, Imanol Mugarza","doi":"10.1109/ETFA.2018.8502660","DOIUrl":"https://doi.org/10.1109/ETFA.2018.8502660","url":null,"abstract":"The IoT and IIoT paradigms are creating new business opportunities. However, high-interconnectivity among all objects introduce new security concerns and challenges. Security is not a product, but a process. Security tests and audits have to constantly be accomplished. Once a security flaw is detected, a software patch fixing the security weakness could be then produced. This continuous security evaluation, which is iterative, might be expensive. In this paper, a novel vulnerability discovery approach is presented: Hadros. The particularity of the proposed design is that security tests are distributively executed among all the deployed IoT/IIoT nodes and performed at the idle time of the system, while runtime. Hadros is suitable and advantageous for the IoT and IIoT era, due to the fact that testing coverage is broadly increased as more devices are incorporated. Meanwhile, resources employed by the security researchers are also significantly reduced.","PeriodicalId":6566,"journal":{"name":"2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"14 1","pages":"948-955"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88093991","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 : 2018-09-01DOI: 10.1109/ETFA.2018.8502495
Riccardo Colelli, S. Panzieri, F. Pascucci
Industrial Control systems traditionally achieved security by using isolation from the outside and proprietary protocols to communicate inside. This paradigm is changed with the advent of the Industrial Internet of Things that foresees flexible and interconnected systems. In this contribution, the threats coming from this new approach are analyzed and a framework for identify them is proposed. It is based on the common signature based intrusion detection system developed in the information technology domain, however, to cope with the constraints of the operation technology domain, it exploits anomaly based features. Specifically, it is able to analyze the traffic on the network at application layer by mean of deep packet inspection, parsing the information carried by the proprietary protocols. Two different topologies are adopted to cope also with legacy systems. A simple set up is considered to prove the effectiveness of the approach.
{"title":"Exploiting System Model for Securing CPS: the Anomaly Based IDS Perspective","authors":"Riccardo Colelli, S. Panzieri, F. Pascucci","doi":"10.1109/ETFA.2018.8502495","DOIUrl":"https://doi.org/10.1109/ETFA.2018.8502495","url":null,"abstract":"Industrial Control systems traditionally achieved security by using isolation from the outside and proprietary protocols to communicate inside. This paradigm is changed with the advent of the Industrial Internet of Things that foresees flexible and interconnected systems. In this contribution, the threats coming from this new approach are analyzed and a framework for identify them is proposed. It is based on the common signature based intrusion detection system developed in the information technology domain, however, to cope with the constraints of the operation technology domain, it exploits anomaly based features. Specifically, it is able to analyze the traffic on the network at application layer by mean of deep packet inspection, parsing the information carried by the proprietary protocols. Two different topologies are adopted to cope also with legacy systems. A simple set up is considered to prove the effectiveness of the approach.","PeriodicalId":6566,"journal":{"name":"2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"68 1","pages":"1171-1174"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88200334","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
扫码关注我们
求助内容：
应助结果提醒方式：