P. Binns, M. Elgersma, S. Ganguli, Vu Ha, T. Samad
{"title":"Statistical verification of two non-linear real-time UAV controllers","authors":"P. Binns, M. Elgersma, S. Ganguli, Vu Ha, T. Samad","doi":"10.1109/RTTAS.2004.1317280","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317280","url":null,"abstract":"We present a versatile statistical verification methodology and we illustrate different uses of this methodology on two examples of nonlinear real-time UAV controllers. The first example applies our statistical methodology to the verification of a computation time property for a software implementation of a high-performance controller as a function of controller state variable values. The second example illustrates our statistical verification methodology applied to finding verifiably safe flight envelopes for a class of maneuvers, again as a function of controller state variable values. We compare our approach to verification with other statistical techniques used for estimating execution times and controller performance. We close with candidate topics for future work.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130191670","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":"Incremental satisfiability counting for real-time systems","authors":"S. Andrei, W. Chin","doi":"10.1109/RTTAS.2004.1317295","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317295","url":null,"abstract":"Testing constraints for real-time systems are usually verified through the satisfiability of propositional formulae. In this paper, we propose an alternative where the verification of timing constraints can be done by counting the number of truth assignments instead of Boolean satisfiability. This number can also tell us how \"far away\" a given specification is from satisfying its safety assertion. Furthermore, specifications and safety assertions are often modified in an incremental fashion, where problematic bugs are fixed one at a time. To support this development, we propose an incremental algorithm for counting satisfiability. Our proposed incremental algorithm is optimal as no unnecessary nodes are created during each counting. This works for the class of expressions, known as path RTL ([F. Jahanian et al. (1987), F. Wang et al. (1994)]). To illustrate this application, we show how incremental satisfiability counting can be applied to a well-known rail-road crossing example, particularly when its specification is still being refined.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133062281","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":"Storage access support for soft real-time applications","authors":"Joel C. Wu, S. Brandt","doi":"10.1109/RTTAS.2004.1317261","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317261","url":null,"abstract":"Most research on QoS-aware storage has focused on the use of QoS-aware disk schedulers. However, the increasing intelligence and autonomy of modern disk drives have made fine-grained external disk scheduling difficult. As this trend continues, providing QoS-aware storage through external disk schedulers may become infeasible in the future. In this paper, we present a coarse-grained approach to storage bandwidth management that does not rely on external disk schedulers. The goal is to provide better storage access support for storage-bound soft real-time applications. Our approach gives priority to disk requests generated by soft real-time applications by controlling the rate that best-effort disk requests may be dispatched.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125594959","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}
D. Lugato, Frédéric Maraux, Yves Le Traon, V. Normand, H. Dubois, Jean-Yves Pierron, J. Gallois, C. Nebut
{"title":"Automated functional test case synthesis from THALES industrial requirements","authors":"D. Lugato, Frédéric Maraux, Yves Le Traon, V. Normand, H. Dubois, Jean-Yves Pierron, J. Gallois, C. Nebut","doi":"10.1109/RTTAS.2004.1317254","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317254","url":null,"abstract":"Test case generation and specification validation are essential concerns for the software industry in its continuous search for productivity improvement and quality mastering. We present the approach developed in the MUTATION project for functional test case synthesis in the THALES industrial context. A two-step approach is proposed, which automates most of the process in a continuous way. The first step consists in expressing the requirements in the requirements description language (RDL) textual formalism and completing, disambiguating and validating them through simulation. Test objectives are then automatically derived from the RDL formalisation. The second step synthesises functional test cases through combining the test objectives produced at step 1 and symbolic path computation on a UML detailed design model of the application, using the academic tool AGATHA (French acronym for toolset dedicated to automatic test generation for automata based specification). Test cases are produced through selecting symbolic behaviour paths that match the test objectives, applying a constraint solver to generate numeric tests. This approach is based on three innovations that are the core of this work: 1) definition of an appropriate language and a related methodology to define the test requirements; 2) symbolic execution on a UML action language; 3) combination of test objectives and symbolic execution to synthesize functional test cases.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"92 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116299713","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":"An embedded architectural framework for interaction between automobiles and consumer devices","authors":"Edward C. Nelson, K. Prasad, V. Rasin, C. Simonds","doi":"10.1109/RTTAS.2004.1317264","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317264","url":null,"abstract":"The last two and one half decades have seen rapid growth in the amount and importance of software in automobiles. This growth is bringing about a shift from treating software as a part of the hardware it controls to viewing it as an implementation of a set of services that mediate between the hardware and the functionality seen by the user. This paper describes an in-vehicle computing platform based on the software service platform to provide entertainment and information functions that has been implemented in two prototype vehicles at Ford Motor Company.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126772807","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}
Morgan Deters, Nicholas A. Leidenfrost, Matthew P. Hampton, James C. Brodman, R. Cytron
{"title":"Automated reference-counted object recycling for real-time Java","authors":"Morgan Deters, Nicholas A. Leidenfrost, Matthew P. Hampton, James C. Brodman, R. Cytron","doi":"10.1109/RTTAS.2004.1317289","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317289","url":null,"abstract":"We introduce an aspect-oriented reformulation of reference-counting that is particularly well-suited to Java applications and does not share the error-prone characteristic of manual, user-driven reference counting. We present our method in the context of the real-time specification for Java and demonstrate that it can recycle dead objects in bounded time. We apply partial evaluation to specialize the aspect-generated code, which substantially reduces the reference-counting overhead.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"219 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133390545","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}
Wankang Zhao, P. Kulkarni, D. Whalley, Christopher A. Healy, F. Mueller, Gang-Ryung Uh
{"title":"Timing the WCET of embedded applications","authors":"Wankang Zhao, P. Kulkarni, D. Whalley, Christopher A. Healy, F. Mueller, Gang-Ryung Uh","doi":"10.1109/RTTAS.2004.1317294","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317294","url":null,"abstract":"It is advantageous to not only calculate the WCET of an application, but to also perform transformations to reduce the WCET since an application with a lower WCET is less likely to violate its timing constraints. In this paper we describe an environment consisting of an interactive compilation system and a timing analyzer, where a user can interactively tune the WCET of an application. After each optimization phase is applied, the timing analyzer is automatically invoked to calculate the WCET of the function being tuned. Thus, a user can easily gauge the progress of reducing the WCET. In addition, the user can apply a genetic algorithm to search for an effective optimization sequence that best reduces the WCET. Using the genetic algorithm, we show that the WCET for a number of applications can be reduced by 7% on average as compared to the default batch optimization sequence.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124222805","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":"RT-Frontier: a real-time operating system for practical imprecise computation","authors":"Hidenori Kobayashi, N. Yamasaki","doi":"10.1109/RTTAS.2004.1317271","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317271","url":null,"abstract":"Imprecise computation is known as an effective technique for dynamically resolving trade-offs between the amount of resources and the quality of the result. However, its implementation and operating system support methods have not been exploited enough from a practical point of view. This paper presents a new approach taken in the RT-Frontier operating system to support imprecise computation. Applications that allow imprecise computation are first transformed to tasks composed of three parts based on an extended imprecise computation model. All tasks are then uniformly scheduled according to a novel scheduling algorithm called Slack Stealer for Optional Parts (SS-OP). The SS-OP algorithm is designed to handle imprecise computations with small overhead, which is at a comparable level of that of the Earliest Deadline First (EOF) algorithm. The results of experiments show that the presented approach is cost-effective enough to be considered as a practical basis for embedded real-time systems.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123784126","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":"Maximizing the use of computational resources in multi-camera feedback control","authors":"D. Henriksson, Tomas Olsson","doi":"10.1109/RTTAS.2004.1317282","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317282","url":null,"abstract":"In vision-based feedback control systems, the time to obtain sensor information is usually nonnegligible, and these systems thereby possess fundamentally different timing behavior compared to standard real-time control applications. For many image-based tracking algorithms, however, it is possible to trade-off the computational time versus the accuracy of the produced position/orientation estimates. This paper presents a method for optimizing the use of computational resources in a multicamera based positioning system. A simplified equation for the covariance of the position estimation error is calculated, which depends on the set of cameras used and the number of edge detection points in each image. An efficient algorithm for selection of a suitable subset of the available cameras is presented, which attempts to minimize the estimation covariance given a desired, prespecified maximum input-output latency of the feedback control loop. Simulations have been performed that capture the realtime properties of the vision-based tracking algorithm and the effects of the timing on the performance of the control system. The suggested strategy has been compared with heuristic algorithms, and it obtains large improvements in estimation accuracy and performance for objects both in free motion and under closed-loop position control.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114529580","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":"Scheduling of iterative algorithms on FPGA with pipelined arithmetic unit","authors":"P. Šůcha, Z. Pohl, Z. Hanzálek","doi":"10.1109/RTTAS.2004.1317287","DOIUrl":"https://doi.org/10.1109/RTTAS.2004.1317287","url":null,"abstract":"This paper presents a scheduling technique for a library of arithmetic logarithmic modules for FPGA illustrated on a RLS filter for active noise cancellation. The problem under assumption is to find an optimal periodic cyclic schedule satisfying the timing constraints. The approach is based on a transformation to monoprocessor cyclic scheduling with precedence delays. We prove that this problem is NP-hard and we suggest a solution based on integer linear programming that allows to minimize completion time. Finally experimental results of optimized RLS filter are shown.","PeriodicalId":447481,"journal":{"name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124473267","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}