Pub Date : 2006-09-01DOI: 10.1109/ETFA.2006.355382
M. Díaz, Daniel Garrido, L. Llopis, B. Rubio, J. M. Troya
Wireless sensor and actor networks (WSANs) constitute an emerging and pervasive technology that is attracting increased interest for a wide range of applications. WSANs have two major requirements: coordination mechanisms for both sensor-actor and actor-actor interactions, and real-time communication to perform correct and timely actions. Additionally, the development of WSAN applications is notoriously difficult, due to the extreme resource limitations of nodes. This paper introduces a framework to facilitate the task of the application programmer taking into account these special characteristics of WSANs. We propose a real-time component model using light-weight components. In addition, a high-level coordination model based on tuple channels is integrated into the framework including high-level constructs that abstract the details of communication and facilitate the data-centric behavior of sensor queries.
{"title":"A Component Framework for Wireless Sensor and Actor Networks","authors":"M. Díaz, Daniel Garrido, L. Llopis, B. Rubio, J. M. Troya","doi":"10.1109/ETFA.2006.355382","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355382","url":null,"abstract":"Wireless sensor and actor networks (WSANs) constitute an emerging and pervasive technology that is attracting increased interest for a wide range of applications. WSANs have two major requirements: coordination mechanisms for both sensor-actor and actor-actor interactions, and real-time communication to perform correct and timely actions. Additionally, the development of WSAN applications is notoriously difficult, due to the extreme resource limitations of nodes. This paper introduces a framework to facilitate the task of the application programmer taking into account these special characteristics of WSANs. We propose a real-time component model using light-weight components. In addition, a high-level coordination model based on tuple channels is integrated into the framework including high-level constructs that abstract the details of communication and facilitate the data-centric behavior of sensor queries.","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122110359","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355207
R. Moraes, P. Portugal, F. Vasques
The IEEE 802.11e standard was published as an amendment to the original IEEE 802.11 standard. This amendment is intended to provide differentiated levels of QoS to the supported applications. The 802.11e amendment incorporates an additional coordination function called hybrid coordination function (HCF) that uses both a contention-based channel access method, called the enhanced distributed channel access (EDCA) and a controlled channel access, referred to as the HCF controlled channel access (HCCA). Under the EDCA mechanism, it is a common assumption to consider the highest access category (voice) adequate to support real-time communication. In this paper, we analyze the timing behavior of the EDCA function, when it is used to support real-time traffic. Basically, we assess the behavior of the voice category in open communication environments (i.e., a communication environment subject to external disturbances) when this access category is used to transfer small sized packets, generated in periodic intervals. We show that the transmission opportunity (TXOP) mechanism included in the IEEE 802.11e amendment improves the system throughput, for the case of message streams with small packet sizes. However, the impact of external disturbances upon the transfer of real-time messages is highly relevant. For instance, the average access delay for the real-time messages is more than one order of magnitude larger when the external disturbance increases the network load from just 10% to 30%. Furthermore, both the number of packet losses and the average size of the MAC queues forecast an unacceptable number of deadline losses for the real-time message streams, even for intermediate load cases.
{"title":"Simulation Analysis of the IEEE 802.11e EDCA Protocol for an Industrially-Relevant Real-Time Communication Scenario","authors":"R. Moraes, P. Portugal, F. Vasques","doi":"10.1109/ETFA.2006.355207","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355207","url":null,"abstract":"The IEEE 802.11e standard was published as an amendment to the original IEEE 802.11 standard. This amendment is intended to provide differentiated levels of QoS to the supported applications. The 802.11e amendment incorporates an additional coordination function called hybrid coordination function (HCF) that uses both a contention-based channel access method, called the enhanced distributed channel access (EDCA) and a controlled channel access, referred to as the HCF controlled channel access (HCCA). Under the EDCA mechanism, it is a common assumption to consider the highest access category (voice) adequate to support real-time communication. In this paper, we analyze the timing behavior of the EDCA function, when it is used to support real-time traffic. Basically, we assess the behavior of the voice category in open communication environments (i.e., a communication environment subject to external disturbances) when this access category is used to transfer small sized packets, generated in periodic intervals. We show that the transmission opportunity (TXOP) mechanism included in the IEEE 802.11e amendment improves the system throughput, for the case of message streams with small packet sizes. However, the impact of external disturbances upon the transfer of real-time messages is highly relevant. For instance, the average access delay for the real-time messages is more than one order of magnitude larger when the external disturbance increases the network load from just 10% to 30%. Furthermore, both the number of packet losses and the average size of the MAC queues forecast an unacceptable number of deadline losses for the real-time message streams, even for intermediate load cases.","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125841161","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355362
O. Barambones, A. Garrido, F. Maseda, P. Alkorta
A novel sensorless adaptive robust control law is proposed to improve the trajectory tracking performance of induction motors. The proposed design employs the so called vector (or field oriented) control theory for the induction motor drives and the designed control law is based on an integral sliding-mode algorithm that overcomes the system uncertainties. The proposed sliding-mode control law incorporates an adaptive switching gain to avoid calculating an upper limit of the system uncertainties. The proposed design also includes a new method in order to estimate the rotor speed. In this method, the rotor speed estimation error is presented as a first order simple function based on the difference between the real stator currents and the estimated stator currents. The stability analysis of the proposed controller under parameter uncertainties and load disturbances is provided using the Lyapunov stability theory. Finally simulated results show, on the one hand that the proposed controller with the proposed rotor speed estimator provides high-performance dynamic characteristics, and on the other hand that this scheme is robust with respect to plant parameter variations and external load disturbances
{"title":"Speed Sensorless Vector Control of Induction Motors Based on Robust Adaptive Variable Structure Control Law","authors":"O. Barambones, A. Garrido, F. Maseda, P. Alkorta","doi":"10.1109/ETFA.2006.355362","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355362","url":null,"abstract":"A novel sensorless adaptive robust control law is proposed to improve the trajectory tracking performance of induction motors. The proposed design employs the so called vector (or field oriented) control theory for the induction motor drives and the designed control law is based on an integral sliding-mode algorithm that overcomes the system uncertainties. The proposed sliding-mode control law incorporates an adaptive switching gain to avoid calculating an upper limit of the system uncertainties. The proposed design also includes a new method in order to estimate the rotor speed. In this method, the rotor speed estimation error is presented as a first order simple function based on the difference between the real stator currents and the estimated stator currents. The stability analysis of the proposed controller under parameter uncertainties and load disturbances is provided using the Lyapunov stability theory. Finally simulated results show, on the one hand that the proposed controller with the proposed rotor speed estimator provides high-performance dynamic characteristics, and on the other hand that this scheme is robust with respect to plant parameter variations and external load disturbances","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125849353","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355448
V. Vyatkin, M. Hirsch, H. Hanisch
This paper discusses systematic approaches to the design of distributed controllers in industrial automation systems. Several design approaches are compared that lead to the distributed control of manufacturing machines and their parts. In particular, a decentralized control method is introduced that does not require a master controller. The implementation frameworks of IEC 61131-3 and IEC 61499 are checked on their fitness to the distributed control. A migration method from a PLC-based control to IEC 61499 is illustrated. A layered architecture for distributed controllers is introduced and tested on examples.
{"title":"Systematic Design and Implementation of Distributed Controllers in Industrial Automation","authors":"V. Vyatkin, M. Hirsch, H. Hanisch","doi":"10.1109/ETFA.2006.355448","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355448","url":null,"abstract":"This paper discusses systematic approaches to the design of distributed controllers in industrial automation systems. Several design approaches are compared that lead to the distributed control of manufacturing machines and their parts. In particular, a decentralized control method is introduced that does not require a master controller. The implementation frameworks of IEC 61131-3 and IEC 61499 are checked on their fitness to the distributed control. A migration method from a PLC-based control to IEC 61499 is illustrated. A layered architecture for distributed controllers is introduced and tested on examples.","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126035327","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355447
G. Goulas, V. Barkayannis, S. Gianoulis, Christos G Gogos, P. Alefragis, P. Foundas, Christos Valouxis, S. Koubias, E. Housos
This paper describes the ERMIS system, specially designed to support the fleet and personnel scheduling and management issues, as well as to support various business collaboration issues for a helicopter taxi company. The implemented system offers a Web-based interface for the flying and stationary personnel and a software application running on a PDA with GSM and GPS capabilities for the pilots. The information flow and the business processes of the ERMIS system are based on XML Web services which makes the system open and interoperable with other company-owned information systems.
{"title":"ERMIS: A Helicopter Taxi Company Software Support System based on GPS, GSM and Web Services","authors":"G. Goulas, V. Barkayannis, S. Gianoulis, Christos G Gogos, P. Alefragis, P. Foundas, Christos Valouxis, S. Koubias, E. Housos","doi":"10.1109/ETFA.2006.355447","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355447","url":null,"abstract":"This paper describes the ERMIS system, specially designed to support the fleet and personnel scheduling and management issues, as well as to support various business collaboration issues for a helicopter taxi company. The implemented system offers a Web-based interface for the flying and stationary personnel and a software application running on a PDA with GSM and GPS capabilities for the pilots. The information flow and the business processes of the ERMIS system are based on XML Web services which makes the system open and interoperable with other company-owned information systems.","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121953813","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355384
P. Peti, R. Obermaisser, H. Paulitsch
In the context of distributed real-time systems as deployed in the avionic and the automotive domain a substantial number of system malfunctions result from connector faults. For instance, a middle class car has more than 40 electronic control units (ECUs) interconnected by a heterogenous network infrastructure consisting of hundreds of wires and connections. Connector faults such as loose contacts impose a challenging task for the technician at the service station. This paper investigates to what extent the use of time-triggered communication protocols, in particular the TTP C2 communication controller, helps in identifying connector faults. We perform fault injection campaigns to judge whether the status information provided by the TTP C2 controller is sufficient for the detection of connector faults. The derived results constitute an important input for online analysis mechanisms
{"title":"Investigating Connector Faults in the Time-Triggered Architecture","authors":"P. Peti, R. Obermaisser, H. Paulitsch","doi":"10.1109/ETFA.2006.355384","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355384","url":null,"abstract":"In the context of distributed real-time systems as deployed in the avionic and the automotive domain a substantial number of system malfunctions result from connector faults. For instance, a middle class car has more than 40 electronic control units (ECUs) interconnected by a heterogenous network infrastructure consisting of hundreds of wires and connections. Connector faults such as loose contacts impose a challenging task for the technician at the service station. This paper investigates to what extent the use of time-triggered communication protocols, in particular the TTP C2 communication controller, helps in identifying connector faults. We perform fault injection campaigns to judge whether the status information provided by the TTP C2 controller is sufficient for the detection of connector faults. The derived results constitute an important input for online analysis mechanisms","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129903345","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355457
William D. Henderson, S. Tron
Wireless sensor networks (WSN) consist of small self-contained devices with computational, sensing and wireless communication capabilities. They allow flexible, powerful, tetherless, automated data collection and monitoring systems to be created. Anticipated applications include environmental hazard monitoring, forest fire detection, machine instrumentation, etc. Many routing protocols have been proposed to facilitate data transport from sensor nodes to a base station; few of these protocols have been formally verified or operationally deployed however. The minimum cost forwarding (MCF) routing protocol (Ye et al., 2001), has been proposed. The application of MCF is restricted to networks possessing a single sink node and multiple source nodes. However, it offers several potential advantages for sensor nodes with limited resources. The MCF protocol is the subject of the current study with a view to its implementation in a prototype sensor network. The first phase of the work, and the subject of this paper, is the formal evaluation of the MCF protocol to increase confidence its correctness and study its ability to handle node failure and other errors. As a result of formal verification using a model checking tool, UPPAAL, we confirm the soundness of the protocol during its initialisation and operational phases and have identified significant weaknesses in the published protocol concerning equal-cost minimum cost paths and node failure. In particular, we identify a flaw in the previously suggested periodic initialisation broadcast to re-establish a minimum cost field. Here we present these results and offer improvements to overcome some deficiencies. It is expected that model checking may usefully be applied in the study of other WSN protocols.
无线传感器网络(WSN)由具有计算、传感和无线通信能力的小型独立设备组成。它们允许创建灵活、强大、无线、自动化的数据收集和监控系统。预期的应用包括环境危害监测、森林火灾探测、机器仪表等。已经提出了许多路由协议来促进从传感器节点到基站的数据传输;然而，这些协议中很少得到正式核查或实际部署。最小成本转发(MCF)路由协议(Ye et al.， 2001)已经被提出。MCF的应用仅限于具有单个汇聚节点和多个源节点的网络。然而，它为资源有限的传感器节点提供了几个潜在的优势。MCF协议是当前研究的主题，目的是在原型传感器网络中实现它。第一阶段的工作，也是本文的主题，是对MCF协议进行形式化评估，以增加对其正确性的信心，并研究其处理节点故障和其他错误的能力。作为使用模型检查工具UPPAAL进行正式验证的结果，我们在初始化和运行阶段确认了协议的合理性，并确定了已发布协议中有关等成本最小成本路径和节点故障的重大弱点。特别是，我们在之前建议的周期性初始化广播中发现了一个缺陷，以重新建立最小成本字段。在这里，我们提出了这些结果，并提出了改进措施，以克服一些不足。模型检验可以有效地应用于其他无线传感器网络协议的研究。
{"title":"Verification of The Minimum Cost Forwarding Protocol for Wireless Sensor Networks","authors":"William D. Henderson, S. Tron","doi":"10.1109/ETFA.2006.355457","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355457","url":null,"abstract":"Wireless sensor networks (WSN) consist of small self-contained devices with computational, sensing and wireless communication capabilities. They allow flexible, powerful, tetherless, automated data collection and monitoring systems to be created. Anticipated applications include environmental hazard monitoring, forest fire detection, machine instrumentation, etc. Many routing protocols have been proposed to facilitate data transport from sensor nodes to a base station; few of these protocols have been formally verified or operationally deployed however. The minimum cost forwarding (MCF) routing protocol (Ye et al., 2001), has been proposed. The application of MCF is restricted to networks possessing a single sink node and multiple source nodes. However, it offers several potential advantages for sensor nodes with limited resources. The MCF protocol is the subject of the current study with a view to its implementation in a prototype sensor network. The first phase of the work, and the subject of this paper, is the formal evaluation of the MCF protocol to increase confidence its correctness and study its ability to handle node failure and other errors. As a result of formal verification using a model checking tool, UPPAAL, we confirm the soundness of the protocol during its initialisation and operational phases and have identified significant weaknesses in the published protocol concerning equal-cost minimum cost paths and node failure. In particular, we identify a flaw in the previously suggested periodic initialisation broadcast to re-establish a minimum cost field. Here we present these results and offer improvements to overcome some deficiencies. It is expected that model checking may usefully be applied in the study of other WSN protocols.","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128922955","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355367
Hao He, A. Aendenroomer, B. S. Lim
Diner-waiter pattern has been proposed to improve the real-time performance and resource usage in distributed control. This paper further proposes an approach to enhance and implement the diner-waiter pattern in an agent framework with QoS being the time delay measured from the request is raised until the service is fulfilled. The time critical services are modelled and the evaluation criterion is given. An algorithm is proposed to dynamically change the preference list and routing rule for better QoS service providers. As the result, requests are routed to appropriate service providers in less time, and the interruption to the service providers (event processors) is reduced
{"title":"Diner-Waiter Pattern for Time Critical Services","authors":"Hao He, A. Aendenroomer, B. S. Lim","doi":"10.1109/ETFA.2006.355367","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355367","url":null,"abstract":"Diner-waiter pattern has been proposed to improve the real-time performance and resource usage in distributed control. This paper further proposes an approach to enhance and implement the diner-waiter pattern in an agent framework with QoS being the time delay measured from the request is raised until the service is fulfilled. The time critical services are modelled and the evaluation criterion is given. An algorithm is proposed to dynamically change the preference list and routing rule for better QoS service providers. As the result, requests are routed to appropriate service providers in less time, and the interruption to the service providers (event processors) is reduced","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121059681","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355406
S. Klinkhieo, C. Kambhampati, R. Patton
This paper deals with fault-tolerant control of a network controlled systems (NCS) problem, where the sensors, actuator and controller are inter-connected via a communication network. A procedure is proposed for controlling a system over a network using the concept of an NCS-information-packet which is an augmented vector comprising control moves and fault flags. The size of this packet is used to define a completely fault tolerant NCS. The behavior and control of this scheme is illustrated by way of an example, where the plant is being controlled over a network. Implicit in this paper is that appropriate FDI schemes exist within the set up. The software environment used is MATLABcopy and LABVIEWcopy. The results illustrate that the scheme is tolerant to faults.
{"title":"Information Packets and MPC Enable Fault-tolerance in Network Control","authors":"S. Klinkhieo, C. Kambhampati, R. Patton","doi":"10.1109/ETFA.2006.355406","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355406","url":null,"abstract":"This paper deals with fault-tolerant control of a network controlled systems (NCS) problem, where the sensors, actuator and controller are inter-connected via a communication network. A procedure is proposed for controlling a system over a network using the concept of an NCS-information-packet which is an augmented vector comprising control moves and fault flags. The size of this packet is used to define a completely fault tolerant NCS. The behavior and control of this scheme is illustrated by way of an example, where the plant is being controlled over a network. Implicit in this paper is that appropriate FDI schemes exist within the set up. The software environment used is MATLABcopy and LABVIEWcopy. The results illustrate that the scheme is tolerant to faults.","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123328543","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 : 2006-09-01DOI: 10.1109/ETFA.2006.355368
M. Skambraks
Employing programmable electronic systems (PESs) in safety-critical real-time applications that cannot immediately be transferred to safe states requires especially high degrees of fault-tolerance. Conventionally, this demand is satisfied not only by configuring multiple PESs redundantly, but also by applying redundant processing structures inside each PES. Instead, it is also desirable to provide the capability to rehabilitate a PES's faulty state by copying the internal state from its redundant counterparts at runtime. Thus, redundancy attrition due to transient faults is prevented, since failed channels can be brought back on line. Here, the problems concerned with state restoration at runtime are stated, the advantages and disadvantages of existing techniques are discussed, and a hardware-supported concept is introduced
{"title":"An Architecture for Runtime State Restoration after Transient Hardware-Faults in Redundant Real-Time Systems","authors":"M. Skambraks","doi":"10.1109/ETFA.2006.355368","DOIUrl":"https://doi.org/10.1109/ETFA.2006.355368","url":null,"abstract":"Employing programmable electronic systems (PESs) in safety-critical real-time applications that cannot immediately be transferred to safe states requires especially high degrees of fault-tolerance. Conventionally, this demand is satisfied not only by configuring multiple PESs redundantly, but also by applying redundant processing structures inside each PES. Instead, it is also desirable to provide the capability to rehabilitate a PES's faulty state by copying the internal state from its redundant counterparts at runtime. Thus, redundancy attrition due to transient faults is prevented, since failed channels can be brought back on line. Here, the problems concerned with state restoration at runtime are stated, the advantages and disadvantages of existing techniques are discussed, and a hardware-supported concept is introduced","PeriodicalId":431393,"journal":{"name":"2006 IEEE Conference on Emerging Technologies and Factory Automation","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123075916","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
扫码关注我们
求助内容：
应助结果提醒方式：