Jianwen Li, Zheng Wang, Yongxin Zhao, G. Pu, Yanxia Qi, B. Gu
Real time systems consisting of periodic behaviors together with the mode transition mechanism are largely applied in the development of control systems for spacecrafts and automobiles in industry. We have proposed a requirement modeling language called SPARDL for modeling and analyzing such periodic control systems in [11]. In this paper, we specify an Event-B interpretation for the SPARDL model. The semantics of SPARDL is presented by Event-B and a refinement framework is introduced to develop the Event-B models based on the features of the SPARDL model. Furthermore, a case study is analyzed to show the effectiveness of our proposed approach to modeling and validation of the SPARDL model by Event-B.
{"title":"An Event-B Interpretation for SPARDL Model","authors":"Jianwen Li, Zheng Wang, Yongxin Zhao, G. Pu, Yanxia Qi, B. Gu","doi":"10.1109/HASE.2011.27","DOIUrl":"https://doi.org/10.1109/HASE.2011.27","url":null,"abstract":"Real time systems consisting of periodic behaviors together with the mode transition mechanism are largely applied in the development of control systems for spacecrafts and automobiles in industry. We have proposed a requirement modeling language called SPARDL for modeling and analyzing such periodic control systems in [11]. In this paper, we specify an Event-B interpretation for the SPARDL model. The semantics of SPARDL is presented by Event-B and a refinement framework is introduced to develop the Event-B models based on the features of the SPARDL model. Furthermore, a case study is analyzed to show the effectiveness of our proposed approach to modeling and validation of the SPARDL model by Event-B.","PeriodicalId":403140,"journal":{"name":"2011 IEEE 13th International Symposium on High-Assurance Systems Engineering","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134031674","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}
We propose and evaluate a real-time window-based local call admission control algorithm (RWBLAC) for achieving quality of service in IP networks. RWBLAC utilizes a real time traffic measurement and variation of window based techniques traffic policing for QoS admission decisions. This real time fashion based on actual arrival rate make this research distinct form all other using predefined threshold. We use simulation to evaluate the link utilization and adherence to service commitment that could be achieved by RWBLAC, and to compare the performance of its diverse implementation options.
{"title":"A Real Time Window-Based Local Call Admission Control Algorithm for IP Networks","authors":"S. Al-Wakeel, Shaker S. AlGhanmi","doi":"10.1109/HASE.2011.32","DOIUrl":"https://doi.org/10.1109/HASE.2011.32","url":null,"abstract":"We propose and evaluate a real-time window-based local call admission control algorithm (RWBLAC) for achieving quality of service in IP networks. RWBLAC utilizes a real time traffic measurement and variation of window based techniques traffic policing for QoS admission decisions. This real time fashion based on actual arrival rate make this research distinct form all other using predefined threshold. We use simulation to evaluate the link utilization and adherence to service commitment that could be achieved by RWBLAC, and to compare the performance of its diverse implementation options.","PeriodicalId":403140,"journal":{"name":"2011 IEEE 13th International Symposium on High-Assurance Systems Engineering","volume":"690 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129052419","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}
Today, more than ever, enterprises are relying on highly complex IT solutions to respond flexibly and rapidly to the constant changing business environment. Yet, the increasing complexity of IT solutions presents significant challenges. In this paper, we propose a solution to reduce the human intervention needed to maintain data exchange processes after a schema evolution (changes impacting source or target system schemas participating in a data exchange scenario). Our approach, toward reliable self-healed data exchange processes under evolving schemas, is called DEAM (Data Exchange Autonomic Manager).
{"title":"Self-Healing Data Exchange Process under Evolving Schemas: A New Mapping Adaptation Approach Based on Self-Optimization","authors":"Hicham Assoudi, H. Lounis","doi":"10.1109/HASE.2011.42","DOIUrl":"https://doi.org/10.1109/HASE.2011.42","url":null,"abstract":"Today, more than ever, enterprises are relying on highly complex IT solutions to respond flexibly and rapidly to the constant changing business environment. Yet, the increasing complexity of IT solutions presents significant challenges. In this paper, we propose a solution to reduce the human intervention needed to maintain data exchange processes after a schema evolution (changes impacting source or target system schemas participating in a data exchange scenario). Our approach, toward reliable self-healed data exchange processes under evolving schemas, is called DEAM (Data Exchange Autonomic Manager).","PeriodicalId":403140,"journal":{"name":"2011 IEEE 13th International Symposium on High-Assurance Systems Engineering","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132414714","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}
In this paper, we present SSPA (Speculative SYN Packet Acceptance), a mechanism designed to make a broadcast-based single IP address cluster highly available. SSPA ensures that at least one node always responds to new TCP connection requests from clients with little delay, especially when a node fails. With SSPA, during a node failure, another node, snooping packets from the client, recognizes that no one is taking care of the request, and then replies to the client. This significantly reduces the delays experienced by clients even during a node crash, while keeping the overhead of node monitoring low. A fault injection test using an embedded computer cluster shows that SSPA allows a cluster to respond to clients within 400ms during a node crash.
{"title":"Anytime Available Single IP Address Cluster","authors":"H. Fujita, Y. Ishikawa","doi":"10.1109/HASE.2011.53","DOIUrl":"https://doi.org/10.1109/HASE.2011.53","url":null,"abstract":"In this paper, we present SSPA (Speculative SYN Packet Acceptance), a mechanism designed to make a broadcast-based single IP address cluster highly available. SSPA ensures that at least one node always responds to new TCP connection requests from clients with little delay, especially when a node fails. With SSPA, during a node failure, another node, snooping packets from the client, recognizes that no one is taking care of the request, and then replies to the client. This significantly reduces the delays experienced by clients even during a node crash, while keeping the overhead of node monitoring low. A fault injection test using an embedded computer cluster shows that SSPA allows a cluster to respond to clients within 400ms during a node crash.","PeriodicalId":403140,"journal":{"name":"2011 IEEE 13th International Symposium on High-Assurance Systems Engineering","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127215678","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}
Electrostatic discharge (ESD) is often the cause of system-level failure or malfunction of embedded systems. The underlying faults are difficult to localize, as the information gained from the hardware-based diagnostic methods typically in use lacks sufficient detail. The alternative proposed in this paper is software instrumentation that monitors key registers and flags to detect anomalies indicative of failure. In contrast to hardware-based techniques, which use invasive probes that can alter the very phenomena being studied, the proposed approach makes use of standard peripherals such as the serial or Ethernet port to monitor and record the effect of ESD. We illustrate the use of this software instrumentation technique in conjunction with a three-dimensional ESD injection system to produce a sensitivity map that visualizes the susceptibility of various segments of an embedded system to ESD.
{"title":"Software-Based Instrumentation for Localization of Faults Caused by Electrostatic Discharge","authors":"Pratik Maheshwari, Byongsu Seol, Jong-Sung Lee, Jae-Deok Lim, Sahra Sedigh Sarvestani, D. Pommerenke","doi":"10.1109/HASE.2011.64","DOIUrl":"https://doi.org/10.1109/HASE.2011.64","url":null,"abstract":"Electrostatic discharge (ESD) is often the cause of system-level failure or malfunction of embedded systems. The underlying faults are difficult to localize, as the information gained from the hardware-based diagnostic methods typically in use lacks sufficient detail. The alternative proposed in this paper is software instrumentation that monitors key registers and flags to detect anomalies indicative of failure. In contrast to hardware-based techniques, which use invasive probes that can alter the very phenomena being studied, the proposed approach makes use of standard peripherals such as the serial or Ethernet port to monitor and record the effect of ESD. We illustrate the use of this software instrumentation technique in conjunction with a three-dimensional ESD injection system to produce a sensitivity map that visualizes the susceptibility of various segments of an embedded system to ESD.","PeriodicalId":403140,"journal":{"name":"2011 IEEE 13th International Symposium on High-Assurance Systems Engineering","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124693319","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}
In this paper, we explore the possibility to use Event-B as a formal domain modeling tool. We identify the areas where domain modelers can struggle and present some guidelines to avoid these pitfalls. We mainly address three questions about domain modeling: what to specify, how to refine, and how to verify. We discuss the strategy to express domain assumptions, protocols, time, and temporal properties. We also analyze the refinement and proof system of Event-B in this realm. We advocate small incremental steps and alternative refinement mechanisms, such as "observation levels. " We find animation a very helpful activity to complement the verification process.
{"title":"Guidelines for Formal Domain Modeling in Event-B","authors":"A. Mashkoor, J. Jacquot","doi":"10.1109/HASE.2011.47","DOIUrl":"https://doi.org/10.1109/HASE.2011.47","url":null,"abstract":"In this paper, we explore the possibility to use Event-B as a formal domain modeling tool. We identify the areas where domain modelers can struggle and present some guidelines to avoid these pitfalls. We mainly address three questions about domain modeling: what to specify, how to refine, and how to verify. We discuss the strategy to express domain assumptions, protocols, time, and temporal properties. We also analyze the refinement and proof system of Event-B in this realm. We advocate small incremental steps and alternative refinement mechanisms, such as \"observation levels. \" We find animation a very helpful activity to complement the verification process.","PeriodicalId":403140,"journal":{"name":"2011 IEEE 13th International Symposium on High-Assurance Systems Engineering","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116894448","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}
Patrick Hein, Debmalya Biswas, L. Martucci, M. Mühlhäuser
In today's collaborative business environment there is a need to share information across organizational boundaries. Publish/Subscribe systems are ideal for such scenarios as they allow real-time information to be shared in an asynchronous fashion. In this work, we focus on the access control aspect. While access control in general for publish/subscribe systems has been studied before, their usage in a multi-organizational scenario leads to some novel challenges. Here a publisher might wish to enforce restrictions w.r.t. not only subscribers, but also other publishers publishing certain event types due to competitive or regulatory reasons. With different publishers and subscribers having their own preferences and restrictions, conflicts are evident w.r.t. both publishing and subscribing to specific event types. Given this, the first contribution of this work is to provide efficient conflict detection and resolution algorithms The other important (and often ignored) aspect of large scale and evolving systems is that of efficiently handling modifications to existing policies, e.g. a rule may become invalid after a certain period of time. Our approach in handling such modifications is two-fold: (i) to maintain consistency and (ii) to automatically detect and enforce rules which could not have been enforced earlier due to conflicts. The second contribution of our work is thus to provide lifecycle management for access control rules, which is tightly coupled with the conflict detection and resolution algorithms.
{"title":"Conflict Detection and Lifecycle Management for Access Control in Publish/Subscribe Systems","authors":"Patrick Hein, Debmalya Biswas, L. Martucci, M. Mühlhäuser","doi":"10.1109/HASE.2011.50","DOIUrl":"https://doi.org/10.1109/HASE.2011.50","url":null,"abstract":"In today's collaborative business environment there is a need to share information across organizational boundaries. Publish/Subscribe systems are ideal for such scenarios as they allow real-time information to be shared in an asynchronous fashion. In this work, we focus on the access control aspect. While access control in general for publish/subscribe systems has been studied before, their usage in a multi-organizational scenario leads to some novel challenges. Here a publisher might wish to enforce restrictions w.r.t. not only subscribers, but also other publishers publishing certain event types due to competitive or regulatory reasons. With different publishers and subscribers having their own preferences and restrictions, conflicts are evident w.r.t. both publishing and subscribing to specific event types. Given this, the first contribution of this work is to provide efficient conflict detection and resolution algorithms The other important (and often ignored) aspect of large scale and evolving systems is that of efficiently handling modifications to existing policies, e.g. a rule may become invalid after a certain period of time. Our approach in handling such modifications is two-fold: (i) to maintain consistency and (ii) to automatically detect and enforce rules which could not have been enforced earlier due to conflicts. The second contribution of our work is thus to provide lifecycle management for access control rules, which is tightly coupled with the conflict detection and resolution algorithms.","PeriodicalId":403140,"journal":{"name":"2011 IEEE 13th International Symposium on High-Assurance Systems Engineering","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128559058","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
扫码关注我们
求助内容：
应助结果提醒方式：