Sébastien Demathieu, F. Thomas, C. André, S. Gérard, F. Terrier
A UML profile for Modeling and Analysis of Real-Time and Embedded systems (MARTE) has been recently standardized by the OMG. This initiative meets the needs of several Thales divisions (e.g., aerospace, land and joint and air systems), which develop real-time and embedded systems. CEA LIST, INRIA and Thales have been the main contributors to the MARTE standard through the ProMARTE consortium. To foster the deployment of MARTE in Thales divisions, we have launched the development of a case study related to a real-time and embedded system using the MARTE adopted specification. As a first step of this study, we make use of a fictive system- the Josefil challenge-to evaluate whether the profile is applicable to the Thales current systems and software engineering practices. The purpose of this paper is to report on this first stage and outline the next scheduled activities.
{"title":"First Experiments Using the UML Profile for MARTE","authors":"Sébastien Demathieu, F. Thomas, C. André, S. Gérard, F. Terrier","doi":"10.1109/ISORC.2008.36","DOIUrl":"https://doi.org/10.1109/ISORC.2008.36","url":null,"abstract":"A UML profile for Modeling and Analysis of Real-Time and Embedded systems (MARTE) has been recently standardized by the OMG. This initiative meets the needs of several Thales divisions (e.g., aerospace, land and joint and air systems), which develop real-time and embedded systems. CEA LIST, INRIA and Thales have been the main contributors to the MARTE standard through the ProMARTE consortium. To foster the deployment of MARTE in Thales divisions, we have launched the development of a case study related to a real-time and embedded system using the MARTE adopted specification. As a first step of this study, we make use of a fictive system- the Josefil challenge-to evaluate whether the profile is applicable to the Thales current systems and software engineering practices. The purpose of this paper is to report on this first stage and outline the next scheduled activities.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115336877","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}
The paper is organized as follows. Section 2 reviews the terminology of time Petri nets and the definitions of their state spaces. The classical "state classes" construction, preserving markings and LTL properties, is explained in section 3, and its properties discussed. Section 4 explains the richer "strong state classes" abstraction, that allows in addition to decide state reachability properties. Section 5 discusses preservation of branching properties and explains the "atomic state classes" construction. Finally, section 7 discusses a number of related issues and recent results, including extensions of these methods to handle enriched classes of time Petri nets.
{"title":"Abstract State Spaces for Time Petri Nets Analysis","authors":"B. Berthomieu, Florent Peres, F. Vernadat","doi":"10.1109/ISORC.2008.75","DOIUrl":"https://doi.org/10.1109/ISORC.2008.75","url":null,"abstract":"The paper is organized as follows. Section 2 reviews the terminology of time Petri nets and the definitions of their state spaces. The classical \"state classes\" construction, preserving markings and LTL properties, is explained in section 3, and its properties discussed. Section 4 explains the richer \"strong state classes\" abstraction, that allows in addition to decide state reachability properties. Section 5 discusses preservation of branching properties and explains the \"atomic state classes\" construction. Finally, section 7 discusses a number of related issues and recent results, including extensions of these methods to handle enriched classes of time Petri nets.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124802867","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}
Knowing the program timing characteristics is fundamental to the successful design and execution of real-time systems. A critical timing measure is the worst-case execution time (WCET) of a program. Often, timing analysis in industry is done by measurements. Recently, tools for deriving WCET estimates have reached the market. With more widespread use of WCET tools in industry, the usability aspects of these tools will be of growing importance. In this paper we discuss usability using the results of the WCET Challenge 2006, which was the first event that compared different WCET tools using the same set of benchmarks. Another source of input to the discussion are experiences from industrial case-studies of WCET tools. Finally, we point out some areas for future research and development for WCET analysis methods and tools.
{"title":"Usability Aspects of WCET Analysis","authors":"J. Gustafsson","doi":"10.1109/ISORC.2008.55","DOIUrl":"https://doi.org/10.1109/ISORC.2008.55","url":null,"abstract":"Knowing the program timing characteristics is fundamental to the successful design and execution of real-time systems. A critical timing measure is the worst-case execution time (WCET) of a program. Often, timing analysis in industry is done by measurements. Recently, tools for deriving WCET estimates have reached the market. With more widespread use of WCET tools in industry, the usability aspects of these tools will be of growing importance. In this paper we discuss usability using the results of the WCET Challenge 2006, which was the first event that compared different WCET tools using the same set of benchmarks. Another source of input to the discussion are experiences from industrial case-studies of WCET tools. Finally, we point out some areas for future research and development for WCET analysis methods and tools.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"1 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125046384","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}
Machine learning deals with the issue of how to build programs that improve their performance at some task through experience. Machine learning algorithms have proven to be of great practical value in a variety of application domains. They are particularly useful for (a) poorly understood problem domains where little knowledge exists for the humans to develop effective algorithms; (b) domains where there are large databases containing valuable implicit regularities to be discovered; or (c) domains where programs must adapt to changing conditions. Not surprisingly, the field of Cyber space turns out to be a fertile ground where many software security problems could be formulated as learning problems and approached in terms of learning algorithms. This paper deals with the subject of applying machine learning in extraction detection. In the paper, we present our research work on design and implementation of an extrusion detection system for information security of big companies. The result shows a potential in real-world applications.
{"title":"A Framework for Extrusion Detection Using Machine Learning","authors":"Yan Luo, J. Tsai","doi":"10.1109/ISORC.2008.70","DOIUrl":"https://doi.org/10.1109/ISORC.2008.70","url":null,"abstract":"Machine learning deals with the issue of how to build programs that improve their performance at some task through experience. Machine learning algorithms have proven to be of great practical value in a variety of application domains. They are particularly useful for (a) poorly understood problem domains where little knowledge exists for the humans to develop effective algorithms; (b) domains where there are large databases containing valuable implicit regularities to be discovered; or (c) domains where programs must adapt to changing conditions. Not surprisingly, the field of Cyber space turns out to be a fertile ground where many software security problems could be formulated as learning problems and approached in terms of learning algorithms. This paper deals with the subject of applying machine learning in extraction detection. In the paper, we present our research work on design and implementation of an extrusion detection system for information security of big companies. The result shows a potential in real-world applications.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128968170","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}
T. Harmon, Martin Schoeberl, R. Kirner, R. Klefstad
Reusable libraries are problematic for real-time software in Java. Using Java's standard class library, for example, demands meticulous coding and testing to avoid response time spikes and garbage collection. We propose two design requirements for reusable libraries in real-time systems: worst-case execution time (WCET) bounds and worst- case memory consumption bounds. Furthermore, WCET cannot be known if blocking method calls are used. We have applied these requirements to the design of three Java-based prototypes: a set of collection classes, a networking stack, and trigonometric functions. Our prototypes show that reusable libraries can meet these requirements and thus be viable for real-time systems.
{"title":"Toward Libraries for Real-Time Java","authors":"T. Harmon, Martin Schoeberl, R. Kirner, R. Klefstad","doi":"10.1109/ISORC.2008.73","DOIUrl":"https://doi.org/10.1109/ISORC.2008.73","url":null,"abstract":"Reusable libraries are problematic for real-time software in Java. Using Java's standard class library, for example, demands meticulous coding and testing to avoid response time spikes and garbage collection. We propose two design requirements for reusable libraries in real-time systems: worst-case execution time (WCET) bounds and worst- case memory consumption bounds. Furthermore, WCET cannot be known if blocking method calls are used. We have applied these requirements to the design of three Java-based prototypes: a set of collection classes, a networking stack, and trigonometric functions. Our prototypes show that reusable libraries can meet these requirements and thus be viable for real-time systems.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130675739","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}
Several approaches for scalable interest management (IM) within real-time distributed virtual environments (DVEs) have been proposed based upon some division of the data-space in to disjoint volumes or cells. Any such approach, however, must implement some mechanism for propagating the query and update messages around the distributed system. The efficiency of this process can greatly effect the scalability of such systems. In this paper we evaluate an adaptive approach to this problem.
{"title":"Push-Pull Interest Management for Virtual Worlds","authors":"Rob Minson, G. Theodoropoulos","doi":"10.1109/ISORC.2008.82","DOIUrl":"https://doi.org/10.1109/ISORC.2008.82","url":null,"abstract":"Several approaches for scalable interest management (IM) within real-time distributed virtual environments (DVEs) have been proposed based upon some division of the data-space in to disjoint volumes or cells. Any such approach, however, must implement some mechanism for propagating the query and update messages around the distributed system. The efficiency of this process can greatly effect the scalability of such systems. In this paper we evaluate an adaptive approach to this problem.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125636516","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}
Kyung-Deok Moon, Jun Hee Park, K. Kim, L. Zheng, Qian Zhou
Universal middleware bridge (UMB) provides seamless interoperation among heterogeneous home network middleware. There have been high demands for the UMB components (UMB core and adaptors) to have fault- tolerance capabilities. This paper presents a TMO structuring approach together with new implementation techniques for the fault-tolerant TMO-replica structuring scheme called PSTR. PSTR implementations of UMB components provide fault tolerance capabilities essential in realizing high reliability for the UMB facility.
{"title":"Fault-Tolerance in Universal Middleware Bridge","authors":"Kyung-Deok Moon, Jun Hee Park, K. Kim, L. Zheng, Qian Zhou","doi":"10.1109/ISORC.2008.91","DOIUrl":"https://doi.org/10.1109/ISORC.2008.91","url":null,"abstract":"Universal middleware bridge (UMB) provides seamless interoperation among heterogeneous home network middleware. There have been high demands for the UMB components (UMB core and adaptors) to have fault- tolerance capabilities. This paper presents a TMO structuring approach together with new implementation techniques for the fault-tolerant TMO-replica structuring scheme called PSTR. PSTR implementations of UMB components provide fault tolerance capabilities essential in realizing high reliability for the UMB facility.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130800169","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}
The ever-increasing functionality and the nonfunctional constraints that must be satisfied by embedded systems lead to an enormous growth in the complexity at the system level In this paper we investigate the notion of cognitive complexity and argue that it is not the embedded system, but the models of the embedded system that must be simple and understandable. The introduction of appropriate levels of abstraction in modeling and the associated concept formation help to reduce the emerging complexity by focusing on the relevant properties and omitting irrelevant detail, thus leading to a simpler representation of the evolving artifact. In the second part of the paper we present examples of basic-level concepts that we find essential in the design of distributed embedded systems and summarize the insights by presenting a set of concise design patterns that support the component-based design of embedded systems.
{"title":"The Complexity Challenge in Embedded System Design","authors":"H. Kopetz","doi":"10.1109/ISORC.2008.14","DOIUrl":"https://doi.org/10.1109/ISORC.2008.14","url":null,"abstract":"The ever-increasing functionality and the nonfunctional constraints that must be satisfied by embedded systems lead to an enormous growth in the complexity at the system level In this paper we investigate the notion of cognitive complexity and argue that it is not the embedded system, but the models of the embedded system that must be simple and understandable. The introduction of appropriate levels of abstraction in modeling and the associated concept formation help to reduce the emerging complexity by focusing on the relevant properties and omitting irrelevant detail, thus leading to a simpler representation of the evolving artifact. In the second part of the paper we present examples of basic-level concepts that we find essential in the design of distributed embedded systems and summarize the insights by presenting a set of concise design patterns that support the component-based design of embedded systems.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128914225","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}
The increasing complexity of modern real-time systems and the increasing need for real-time behavior in a broad range of applications such as network- centric warfare, telephony and stock trading has encouraged many developers to consider using Real-time Javatrade for systems previously only written in C, Ada or assembly language. The RTSJ standard defines the baseline requirements for a Real-time Java implementation, and commercial Java virtual machine (JVM) implementations include additional features such as real-time garbage collectors and real-time compilation (compiling from Java to native code in a manner compatible with real-time), which make the use of Java practical for these applications. This paper describes some of the challenges that will be faced by implementers of the RTSJ standard based on our experience with implementing IBM's RTSJ-compliant J2SE Java virtual machine, called IBMreg WebSpherereg Real-time.
{"title":"Challenges in Implementing the Real-Time Specification for Java (RTSJ) in a Commercial Real-Time Java Virtual Machine","authors":"Michael H. Dawson","doi":"10.1109/ISORC.2008.29","DOIUrl":"https://doi.org/10.1109/ISORC.2008.29","url":null,"abstract":"The increasing complexity of modern real-time systems and the increasing need for real-time behavior in a broad range of applications such as network- centric warfare, telephony and stock trading has encouraged many developers to consider using Real-time Javatrade for systems previously only written in C, Ada or assembly language. The RTSJ standard defines the baseline requirements for a Real-time Java implementation, and commercial Java virtual machine (JVM) implementations include additional features such as real-time garbage collectors and real-time compilation (compiling from Java to native code in a manner compatible with real-time), which make the use of Java practical for these applications. This paper describes some of the challenges that will be faced by implementers of the RTSJ standard based on our experience with implementing IBM's RTSJ-compliant J2SE Java virtual machine, called IBMreg WebSpherereg Real-time.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115551191","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}
Although a growing number of devices have the support for parallel processing, parallelism is not widely exploited, as it should be. This can be illustrated by the fact that all Apple desktops and laptops are currently supplied with one or more dual- core processors. Despite this, parallel programming in popular languages such as Java is not widely encouraged and often only recommended as a last resort. In addition, it is likely that the next generation parallel applications will have to operate within a diverse range of heterogeneous devices ranging from supercomputers to sensors. This paper proposes a flexible component-based middleware that aims at facilitating the construction of deadlock-free parallel and concurrent applications for heterogeneous environments. The middleware is particularly targeted to tailor applications to the target need and environment. For our prototyping, we implemented plu- gins that are capable of deploying JCSP (CSP library for Java programmers) and OCCam-pi processes. Both JCSP and OCCam-pi make use of the CSP disciplines. The CSP (Communicating Sequential Processes) paradigm helps us to avoid concurrency problems such as deadlocks. It should be stressed that there is no bias towards these languages as the proposed middleware is highly extensible.
{"title":"FlexPar: Reconfigurable Middleware for Parallel Environments","authors":"J. Ueyama, E. Madeira, P. Grace","doi":"10.1109/ISORC.2008.76","DOIUrl":"https://doi.org/10.1109/ISORC.2008.76","url":null,"abstract":"Although a growing number of devices have the support for parallel processing, parallelism is not widely exploited, as it should be. This can be illustrated by the fact that all Apple desktops and laptops are currently supplied with one or more dual- core processors. Despite this, parallel programming in popular languages such as Java is not widely encouraged and often only recommended as a last resort. In addition, it is likely that the next generation parallel applications will have to operate within a diverse range of heterogeneous devices ranging from supercomputers to sensors. This paper proposes a flexible component-based middleware that aims at facilitating the construction of deadlock-free parallel and concurrent applications for heterogeneous environments. The middleware is particularly targeted to tailor applications to the target need and environment. For our prototyping, we implemented plu- gins that are capable of deploying JCSP (CSP library for Java programmers) and OCCam-pi processes. Both JCSP and OCCam-pi make use of the CSP disciplines. The CSP (Communicating Sequential Processes) paradigm helps us to avoid concurrency problems such as deadlocks. It should be stressed that there is no bias towards these languages as the proposed middleware is highly extensible.","PeriodicalId":378715,"journal":{"name":"2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115077038","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
扫码关注我们
求助内容：
应助结果提醒方式：