Many prior approaches in UML-based embedded software design incorporate state-based behavior modeling. However, interaction-based behavior modeling provides more intuitive view of a system. In this paper, we propose an approach to interaction-based behavior modeling of embedded software using UML 2.0. We use the interaction overview diagrams and the sequence diagrams to model the behavior. We present the method of constructing interaction-based behavior model with an example. We also briefly describe the idea of generating executable code from it
{"title":"Interaction-based behavior modeling of embedded software using UML 2.0","authors":"Sang-Uk Jeon, Jang-Eui Hong, Doo-Hwan Bae","doi":"10.1109/ISORC.2006.42","DOIUrl":"https://doi.org/10.1109/ISORC.2006.42","url":null,"abstract":"Many prior approaches in UML-based embedded software design incorporate state-based behavior modeling. However, interaction-based behavior modeling provides more intuitive view of a system. In this paper, we propose an approach to interaction-based behavior modeling of embedded software using UML 2.0. We use the interaction overview diagrams and the sequence diagrams to model the behavior. We present the method of constructing interaction-based behavior model with an example. We also briefly describe the idea of generating executable code from it","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124922561","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}
F. Rammig, M. Götz, T. Heimfarth, P. Janacik, Simon Oberthür
It can be observed that most technological artefacts are becoming intelligent "things that think" and most of these intelligent objects will be linked together to an "Internet of things". To master this omnipresent virtual "organism", completely new design and operation paradigms have to evolve. In this paper we discuss how research of our group at the University of Paderborn is providing fundamental principles, methods, and tools to design real-time operating systems for this virtual "organism" of the future. Based on our fine-granular library for the construction of reflexive RTOS, the necessary configuration tool and its on-line version are discussed. Next step towards self-coordination is a profile management system to support self-optimization of the RTOS. The included flexible resource manager allows migration of RTOS services dynamically between programmable processors and re-configurable HW. In a final step the RTOS itself can be distributed. Its services are provided by a cluster of instances instead of a single one. This makes a sophisticated dynamically self-optimizing communication system necessary
{"title":"Real-time operating systems for self-coordinating embedded systems","authors":"F. Rammig, M. Götz, T. Heimfarth, P. Janacik, Simon Oberthür","doi":"10.1109/ISORC.2006.67","DOIUrl":"https://doi.org/10.1109/ISORC.2006.67","url":null,"abstract":"It can be observed that most technological artefacts are becoming intelligent \"things that think\" and most of these intelligent objects will be linked together to an \"Internet of things\". To master this omnipresent virtual \"organism\", completely new design and operation paradigms have to evolve. In this paper we discuss how research of our group at the University of Paderborn is providing fundamental principles, methods, and tools to design real-time operating systems for this virtual \"organism\" of the future. Based on our fine-granular library for the construction of reflexive RTOS, the necessary configuration tool and its on-line version are discussed. Next step towards self-coordination is a profile management system to support self-optimization of the RTOS. The included flexible resource manager allows migration of RTOS services dynamically between programmable processors and re-configurable HW. In a final step the RTOS itself can be distributed. Its services are provided by a cluster of instances instead of a single one. This makes a sophisticated dynamically self-optimizing communication system necessary","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130842135","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 ubiquitous computing environments, our daily lives will be made convenient by embedded intelligent devices. Those devices, such as car navigation systems, personal digital assistances, and cellular phones, provide various kinds of the complex services. Those devices are networked with each other and provide complicated services, through the Internet. While they provide useful services, there is an increasing possibility of security attacks, which include the unexpected execution of unsecure codes. Current information appliances have not yet fully embodied a resource protection mechanism that prevents misbehaved applications from consuming the whole CPU capacity of system resources. In this paper, we propose accounting system, and describe its design and implementation. The system is a resource monitoring and restriction system that has the purpose of improving the system's reliability and security. We developed the system on Linux. Our system is a very generic to offer various services, such as security improvement, overload control, and class-based accounting, that require CPU resource control
{"title":"Accounting system: a fine-grained CPU resource protection mechanism for embedded system","authors":"Midori Sugaya, S. Oikawa, T. Nakajima","doi":"10.1109/ISORC.2006.14","DOIUrl":"https://doi.org/10.1109/ISORC.2006.14","url":null,"abstract":"In ubiquitous computing environments, our daily lives will be made convenient by embedded intelligent devices. Those devices, such as car navigation systems, personal digital assistances, and cellular phones, provide various kinds of the complex services. Those devices are networked with each other and provide complicated services, through the Internet. While they provide useful services, there is an increasing possibility of security attacks, which include the unexpected execution of unsecure codes. Current information appliances have not yet fully embodied a resource protection mechanism that prevents misbehaved applications from consuming the whole CPU capacity of system resources. In this paper, we propose accounting system, and describe its design and implementation. The system is a resource monitoring and restriction system that has the purpose of improving the system's reliability and security. We developed the system on Linux. Our system is a very generic to offer various services, such as security improvement, overload control, and class-based accounting, that require CPU resource control","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134595360","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}
A new customizable interface for smart devices based on hyperlink associability is presented. Although mobile devices should be easy to use, many current devices have complex and widely varying interfaces for users. The proposed architecture, Hyrax, attempts to improve the menu structure and accessibility of functions with consideration of user preferences. In Hyrax, the user interface is constructed and customized using hyperlinks for access to application functions. We focus on the user interface of a phone and present the customizable menu structure of the phone using XLink defined in W3C and external function interface (EFI) defined in the WAP Forum specifications
{"title":"Design of a hyperlink-based software architecture for smart devices","authors":"Y. Nakamoto, Mitsuko Sato","doi":"10.1109/ISORC.2006.28","DOIUrl":"https://doi.org/10.1109/ISORC.2006.28","url":null,"abstract":"A new customizable interface for smart devices based on hyperlink associability is presented. Although mobile devices should be easy to use, many current devices have complex and widely varying interfaces for users. The proposed architecture, Hyrax, attempts to improve the menu structure and accessibility of functions with consideration of user preferences. In Hyrax, the user interface is constructed and customized using hyperlinks for access to application functions. We focus on the user interface of a phone and present the customizable menu structure of the phone using XLink defined in W3C and external function interface (EFI) defined in the WAP Forum specifications","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122688650","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}
This paper proposes the TMO model-based monitoring structure (TMS) for monitoring TMO model-based real-time systems. The monitoring infrastructure configured through TMS is managed by the middleware layer, allowing for automatic monitoring and ease of deployment. In addition, since TMS is designed to utilize proven distributed capabilities enabled by the TMO model, it allows for stable, distributed monitoring on the TMO systems. As the results of experiments indicate, TMS instrumentation overhead on the execution of middleware threads and TMO methods does not exceed 1ms. This means TMS has little or no effect on the operation of the middleware and TMO methods. As such, TMS is a suitable structure for monitoring TMO systems in a stable manner
{"title":"Modeling of a monitoring scheme for TMO model-based real-time systems","authors":"Yoon-Seok Jeong, Tae Wan Kim, Chun-Hyon Chang","doi":"10.1109/ISORC.2006.56","DOIUrl":"https://doi.org/10.1109/ISORC.2006.56","url":null,"abstract":"This paper proposes the TMO model-based monitoring structure (TMS) for monitoring TMO model-based real-time systems. The monitoring infrastructure configured through TMS is managed by the middleware layer, allowing for automatic monitoring and ease of deployment. In addition, since TMS is designed to utilize proven distributed capabilities enabled by the TMO model, it allows for stable, distributed monitoring on the TMO systems. As the results of experiments indicate, TMS instrumentation overhead on the execution of middleware threads and TMO methods does not exceed 1ms. This means TMS has little or no effect on the operation of the middleware and TMO methods. As such, TMS is a suitable structure for monitoring TMO systems in a stable manner","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129332298","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}
Xuefeng Piao, Sangchul Han, Heeheon Kim, Minkyu Park, Yookun Cho, Seong-je Cho
Validation methods for hard real-time jobs are usually performed based on the maximum execution time. The actual execution time of jobs are assumed to be known only when the jobs arrive or not known until they finish. A predictable algorithm must guarantee that it can generate a schedule for any set of jobs such that the finish time for the actual execution time is no later than the finish time for the maximum execution time. It is known that any job-level fixed priority algorithm (such as earliest deadline first) is predictable. However, job-level dynamic priority algorithms (such as least laxity first) may or may not. In this paper, we investigate the predictability of a job-level dynamic priority algorithm EDZL (earliest deadline zero laxity). We show that EDZL is predictable on the domain of integers regardless of the knowledge of the actual execution times. Based on this result, furthermore, we also show that EDZL can successfully schedule any periodic task set if the total utilization is not greater than (m + 1)/2, where m is the number of processors
{"title":"Predictability of earliest deadline zero laxity algorithm for multiprocessor real-time systems","authors":"Xuefeng Piao, Sangchul Han, Heeheon Kim, Minkyu Park, Yookun Cho, Seong-je Cho","doi":"10.1109/ISORC.2006.64","DOIUrl":"https://doi.org/10.1109/ISORC.2006.64","url":null,"abstract":"Validation methods for hard real-time jobs are usually performed based on the maximum execution time. The actual execution time of jobs are assumed to be known only when the jobs arrive or not known until they finish. A predictable algorithm must guarantee that it can generate a schedule for any set of jobs such that the finish time for the actual execution time is no later than the finish time for the maximum execution time. It is known that any job-level fixed priority algorithm (such as earliest deadline first) is predictable. However, job-level dynamic priority algorithms (such as least laxity first) may or may not. In this paper, we investigate the predictability of a job-level dynamic priority algorithm EDZL (earliest deadline zero laxity). We show that EDZL is predictable on the domain of integers regardless of the knowledge of the actual execution times. Based on this result, furthermore, we also show that EDZL can successfully schedule any periodic task set if the total utilization is not greater than (m + 1)/2, where m is the number of processors","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116437813","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}
This paper presents an overview of the real time markup language (RTML). RTML is a XML profile which provides the syntactic representation for describing the semantics of real time data for exchange over distributed networked real time systems. For the basis of interoperability, this profile is described in the XML schema language. This paper describes the background of this work and shows how the vocabularies are developed, and how it derives the extensibility of XML schema in aiding the definition of data in real time systems in order to achieve the goal of interoperability
{"title":"XML descriptor based approach for real time data messaging","authors":"P. Poon, T. Dillon, E. Chang, Ling Feng","doi":"10.1109/ISORC.2006.77","DOIUrl":"https://doi.org/10.1109/ISORC.2006.77","url":null,"abstract":"This paper presents an overview of the real time markup language (RTML). RTML is a XML profile which provides the syntactic representation for describing the semantics of real time data for exchange over distributed networked real time systems. For the basis of interoperability, this profile is described in the XML schema language. This paper describes the background of this work and shows how the vocabularies are developed, and how it derives the extensibility of XML schema in aiding the definition of data in real time systems in order to achieve the goal of interoperability","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125863885","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}
This paper illustrates how the real-time specification for Java (RTSJ) can be modified to allow applications to implement more flexible scheduling. The proposed approach is a two-level scheduling mechanism where the first level is the RTSJ priority scheduler and the second level is under application control. Minimum, backward-compatible changes to the RTSJ specification are discussed to motivate the required interface. The only assumptions made about the underlying real-time operating system are that it supports pre-emptive priority-based dispatching and that changes to priorities have immediate effect
{"title":"Getting more flexible scheduling in the RTSJ","authors":"A. Zerzelidis, A. Wellings","doi":"10.1109/ISORC.2006.38","DOIUrl":"https://doi.org/10.1109/ISORC.2006.38","url":null,"abstract":"This paper illustrates how the real-time specification for Java (RTSJ) can be modified to allow applications to implement more flexible scheduling. The proposed approach is a two-level scheduling mechanism where the first level is the RTSJ priority scheduler and the second level is under application control. Minimum, backward-compatible changes to the RTSJ specification are discussed to motivate the required interface. The only assumptions made about the underlying real-time operating system are that it supports pre-emptive priority-based dispatching and that changes to priorities have immediate effect","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115768054","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}
To communicate between heterogeneous computer systems, mechanisms for data conversion are necessary. In this paper we present a portable, asymmetric data conversion method that is suitable for remote testing frameworks in embedded systems development. The described method takes the resource limitations of embedded systems into account by doing the data conversion at the testing host. The method can be implemented as platform-independent source code and it avoids the need of recompiling the code of a communication partner if the code of the other communication partner is migrated to a different platform
{"title":"Portable data exchange for remote-testing frameworks","authors":"R. Kirner, P. Puschner, I. Wenzel, B. Rieder","doi":"10.1109/ISORC.2006.63","DOIUrl":"https://doi.org/10.1109/ISORC.2006.63","url":null,"abstract":"To communicate between heterogeneous computer systems, mechanisms for data conversion are necessary. In this paper we present a portable, asymmetric data conversion method that is suitable for remote testing frameworks in embedded systems development. The described method takes the resource limitations of embedded systems into account by doing the data conversion at the testing host. The method can be implemented as platform-independent source code and it avoids the need of recompiling the code of a communication partner if the code of the other communication partner is migrated to a different platform","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131372905","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}
M. D. Miguel, Javier Fernández Briones, Juan Pedro Silva, A. Alonso
The development of safety critical software applications has always been done in accordance to strict methods. These systems require the application of verification techniques that guarantee safety properties. Often, they are complex systems that require the integration of different types of engineers such as safety engineers and software architects. Currently, different groups of engineers apply different analysis and modeling techniques (e.g. architectural description languages, and safety analysis models); these differences create inconsistencies between different types of model. In this paper we introduce some solutions to reduce these problems in some safety architectures. These solutions integrate developing modeling languages such as UML and specific safety analysis languages such as FTA and FMECA
{"title":"Model based integration of safety analysis and development","authors":"M. D. Miguel, Javier Fernández Briones, Juan Pedro Silva, A. Alonso","doi":"10.1109/ISORC.2006.53","DOIUrl":"https://doi.org/10.1109/ISORC.2006.53","url":null,"abstract":"The development of safety critical software applications has always been done in accordance to strict methods. These systems require the application of verification techniques that guarantee safety properties. Often, they are complex systems that require the integration of different types of engineers such as safety engineers and software architects. Currently, different groups of engineers apply different analysis and modeling techniques (e.g. architectural description languages, and safety analysis models); these differences create inconsistencies between different types of model. In this paper we introduce some solutions to reduce these problems in some safety architectures. These solutions integrate developing modeling languages such as UML and specific safety analysis languages such as FTA and FMECA","PeriodicalId":212174,"journal":{"name":"Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131729601","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
扫码关注我们
求助内容：
应助结果提醒方式：