{"title":"Accurate Temperature Measurements for Medical Research Using Body Sensor Networks","authors":"C. Boano, Matteo Lasagni, K. Römer, Tanja Lange","doi":"10.1109/ISORCW.2011.28","DOIUrl":"https://doi.org/10.1109/ISORCW.2011.28","url":null,"abstract":"Medical measurements and clinical trials are often carried out in controlled lab settings -- severely limiting the realism and duration of such studies. Our goal is henceforth to design a body sensor network for unobtrusive and highly accurate profiling of body parameters over weeks in realistic environments. One example application is monitoring the impact of sleep deprivation on periodic processes in the human body known as circadian rhythms, which requires highly accurate profiling of skin temperature across the human body over weeks with real-time feedback to a remote medic. We analyze the requirements on a body sensor network for such applications and highlight the need for self-organizing behavior such as adaptive sampling to ensure energy efficiency and thus longevity, adaptive communication strategies, self-testing, automatic compensation for environmental conditions, or automatic recording of a diary of activities. As a first step towards this goal, we design and build a prototype of such a non-invasive wearable wireless monitoring system for accurate body temperature measurements and real-time feedback to the medic. Through the design, parameterization, and calibration of an active measurement subsystem, we obtain an accuracy of 0.02°C over the typical body temperature range of 16-42°C. We report results from two preliminary trials regarding the impact of circadian rhythms and mental activity on skin temperature, indicating that our tool could indeed become a valuable asset for medical research.","PeriodicalId":126022,"journal":{"name":"2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117160027","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}
{"title":"Challenges for Creating Highly Dependable Service Based Systems","authors":"Sean Banerjee, H. Srikanth, B. Cukic","doi":"10.1109/ISORCW.2011.33","DOIUrl":"https://doi.org/10.1109/ISORCW.2011.33","url":null,"abstract":"The paradigm shift from traditional on-premise software to a service based model has gained significant momentum in the past decade. One such concept, Software as a Service (SaaS), delivers the functionality of traditional on-premise software as a service over the web. While a defect or a malfunction in a traditional on-premise application may affect a single user, the affected user base in a SaaS application may span the entire group of customers serviced by the provider. The physical disconnect between end users and the SaaS applications puts onus on service providers to deliver highly dependable systems that are available and reliable at all times. In this paper, we explore the general challenges faced in delivering and analyzing highly dependable service based systems. We quantify the challenges of dependability assessment utilizing a commercial case study. Furthermore, we explore one facet of dependability assessment related to log entries not necessarily related to dependability. We provide a novel approach to log filtering and show that the removal of benign log entries leads to more realistic system dependability analysis. We also show the need to merge multiple types of SaaS logs to support effective analysis.","PeriodicalId":126022,"journal":{"name":"2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130368461","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}
{"title":"Vision-Based Autonomous Landing for Small-Scale Unmanned Rotorcraft","authors":"Dongwoon Jeon, Kiho Cho, Doohyun Kim","doi":"10.1109/ISORCW.2011.37","DOIUrl":"https://doi.org/10.1109/ISORCW.2011.37","url":null,"abstract":"Autonomous landing is a challenging issue for unmanned aerial vehicles (UAVs). This paper presents a system that provides vision-based autonomous landing for small-scale unmanned rotorcraft. This approach utilizes dual image sensors facing downward and performs digital image processing techniques such as the blocked histogram matching and the template matching techniques to ensure the timeliness in altitude estimations. The experimental results show the applicability of these approaches in real-world flights.","PeriodicalId":126022,"journal":{"name":"2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130745563","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}
{"title":"Synthesis of Static Communication Schedules for Mixed-Criticality Systems","authors":"W. Steiner","doi":"10.1109/ISORCW.2011.12","DOIUrl":"https://doi.org/10.1109/ISORCW.2011.12","url":null,"abstract":"Throughout many application areas of embedded and cyber-physical systems there is a demand to integrate more and more applications such that they share common resources. These applications may have different levels of criticality with respect to temporal or fault-tolerance properties and we call the result of their integration a mixed-criticality system. The communication network is a resource of particular importance and nowadays the system architecture is highly determined by a network's capabilities. A network for mixed-criticality systems has to establish partitioning such that the influence of messages from different applications on each other is bounded and the impact of low-critical messages on high-critical ones is minimized or removed at all. A straight forward way to establish network-wide partitioning is the time-triggered communication paradigm in which the communication schedule on the network is defined at design time and executed with respect to a globally synchronized time base. In this paper we discuss static scheduling methods for time-triggered traffic such that it can co-exist with non-time-triggered traffic. We introduce the concept of \"schedule porosity'' and show the impact of time-triggered traffic on unsynchronized traffic as a function of schedule porosity.","PeriodicalId":126022,"journal":{"name":"2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127118423","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}
{"title":"Developing Mechanisms for Determining \"Good Enough\" in SORT Systems","authors":"K. Bellman, Phyllis R. Nelson","doi":"10.1109/ISORCW.2011.47","DOIUrl":"https://doi.org/10.1109/ISORCW.2011.47","url":null,"abstract":"In order for a self-organizing real time (SORT) system to produce real time behavior that is \"good enough,\" it must have the ability to trade off among competing performance metrics, of which time is only one. In this paper we discuss what some of those trade-offs are at both \"design time\" and during operations, present some examples of how biological systems create mechanisms to support the fast resolution of trade-offs, and then present a feasibility demonstration by considering a very simple example of how such trade-off mechanisms can be implemented in our SORT testbed.","PeriodicalId":126022,"journal":{"name":"2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127346892","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}
{"title":"A Lazy Algorithm for Distributed Priority Assignment in Real-Time Systems","authors":"M. Neukirchner, S. Stein, R. Ernst","doi":"10.1109/ISORCW.2011.22","DOIUrl":"https://doi.org/10.1109/ISORCW.2011.22","url":null,"abstract":"Integration of system components is a crucial challenge in the design of embedded real-time systems, as complex non-functional interdependencies may exist. [20] presented a framework, enabling autonomous verification of timing properties in the system itself. The work presented in this paper, takes that approach one step further, enabling autonomuous assignment of execution priorities under timing constraints. We present a distributed heuristic algorithm for the constraint statisfaction problem (CSP) of finding feasible priority assignments in static priority preemptive (SPP) scheduled hard real-time systems. The proposed heuristic considers end-to-end path latency constraints in arbitrary task graphs mapped on arbitrary platform graphs.","PeriodicalId":126022,"journal":{"name":"2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132778505","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}
{"title":"MultiChipSat Fault-Tolerant Architecture","authors":"Matthew McCormack, A. Saenz-Otero","doi":"10.1109/ISORCW.2011.17","DOIUrl":"https://doi.org/10.1109/ISORCW.2011.17","url":null,"abstract":"With the process size of microelectronics shrinking well below 90 nm, the characteristics of upsets experienced by spacecraft avionics are drastically changing; traditional hardware mitigation techniques are reaching performance limitations. A method for achieving reliability, along with the performance capabilities of new technologies, is through the use of an innovative avionics architecture which utilizes both software and hardware redundancy techniques to achieve reliability. Instead of ensuring consistent reliability levels to every operation, the fault mitigation levels are user defined for each operation. Thus the architecture allows the system to be optimized about the needed fault tolerance and performance characteristics of each operation through its use of tightly coupled hardware and software design.","PeriodicalId":126022,"journal":{"name":"2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126727823","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}
{"title":"Dependability Concerns in Model-Driven Engineering","authors":"Leonardo Montecchi, P. Lollini, A. Bondavalli","doi":"10.1109/ISORCW.2011.32","DOIUrl":"https://doi.org/10.1109/ISORCW.2011.32","url":null,"abstract":"Model-Driven engineering (MDE) aims to elevate models in the engineering process to a central role in the specification, design, integration, validation, and operation of a system. MDE is becoming a widely used approach within the dependability domain: the system, together with its main dependability-related characteristics, is represented by engineering language models, while automatic transformations are used to generate the analysis models for the dependability analyses. This paper discusses the dependability concerns that should be captured by engineering languages for dependability analysis. It motivates and defines a conceptual model where the specific dependability aspects related to specific dependability analyses can be consistently and unambiguously merged, also detailing the part of the conceptual model supporting state-based dependability analysis methods. Then, it introduces a new intermediate dependability model that acts as a bridge between the high-level engineering language and the low-level dependability analysis formalism, and we discuss its features and its expressive power showing its application for the modelling of a simple but representative case-study.","PeriodicalId":126022,"journal":{"name":"2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops","volume":"74 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122501330","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}
Kim Grüttner, Andreas Herrholz, U. Kühne, Daniel Große, A. Rettberg, W. Nebel, R. Drechsler
{"title":"Towards Dependability-Aware Design of Hardware Systems Using Extended Program State Machines","authors":"Kim Grüttner, Andreas Herrholz, U. Kühne, Daniel Große, A. Rettberg, W. Nebel, R. Drechsler","doi":"10.1109/ISORCW.2011.27","DOIUrl":"https://doi.org/10.1109/ISORCW.2011.27","url":null,"abstract":"Due to the continuous shrinking of the transistor sizes which is strongly driven by Moore's law, reliability becomes a dominant design challenge for embedded systems. Reliability problems arise from permanent errors due to manufacturing, process variations, aging as well as soft errors. As a result, the hardware will consist of unreliable components and hence, the development of embedded systems has to change fundamentally. Therefore, we propose a dependability-aware design approach for hardware systems through integrating dependability into a state-of-the-art system-level design language. Our approach is based on SystemC and extends the Program State Machine model to explicitly observe, diagnose, and compensate faulty behavior. Different compensation mechanisms like run-time reconfiguration or mechanisms for error propagation can be used by the designer during refinement. They are controlled by a new exception-like mechanism. Furthermore, our approach aims to integrate functional verification as well as dependability verification with respect to given fault models.","PeriodicalId":126022,"journal":{"name":"2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115535622","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}
Christoph Baumann, Thorsten Bormer, Holger Blasum, S. Tverdyshev
{"title":"Proving Memory Separation in a Microkernel by Code Level Verification","authors":"Christoph Baumann, Thorsten Bormer, Holger Blasum, S. Tverdyshev","doi":"10.1109/ISORCW.2011.14","DOIUrl":"https://doi.org/10.1109/ISORCW.2011.14","url":null,"abstract":"Often, an integrated mixed-criticality system is built in an environment which provides separation functionality for available on-board resources. In this paper we treat such an environment: the PikeOS separation kernel -- a commercial real-time embedded operating system. PikeOS allows applications with different safety and security levels to run on the same hardware. Obviously, a mixed-criticality system built on PikeOS relies on the correct implementation of the separation mechanisms. In the context of the Verisoft XT and TECOM projects we apply deductive formal software verification to the PikeOS separation mechanisms in order to validate this security requirement. In this work we consider formal verification of a kernel memory manager which is one of the crucial components of the separation functionality. The verification of the memory manager is carried out on the level of the source code using the VCC tool developed by Microsoft Research. Furthermore, we present the overall correctness arguments needed to prove the intended separation property, describe the necessary functional correctness properties of PikeOS, and explain how to formulate these properties in a modular way to be used by VCC. In doing so we demonstrate how a proof of a non-functional system requirement can be conducted based on results from formal verification on the lowest possible level of human-written artefacts, that is the source code level.","PeriodicalId":126022,"journal":{"name":"2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116112610","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}