T. Kaldma, L. Motus, T. Tommingas, R. Paluoja, J. Tekko
{"title":"Animation in CONRAD: informal analysis of timing properties","authors":"T. Kaldma, L. Motus, T. Tommingas, R. Paluoja, J. Tekko","doi":"10.1109/EMWRTS.1994.336839","DOIUrl":"https://doi.org/10.1109/EMWRTS.1994.336839","url":null,"abstract":"It is suggested that timing restrictions are the fundamental part of the specification of a time-critical system (limiting the possible design solution space), because most of the timing restrictions have been objectively determined by the object to be controlled and thus cannot be changed arbitrarily. Timing correctness in real-time systems means that process activations, data production and consumption take place in time). So as to guarantee this, methods are needed to formally specify various timing properties and prove correctness of the specification. Equally important, however, are methods and tools for informal study of timing properties. Special emphasis is placed on the possibilities provided by the ANIMATOR., which is one of the two main tools in the CONRAD software engineering environment.<<ETX>>","PeriodicalId":322579,"journal":{"name":"Proceedings Sixth Euromicro Workshop on Real-Time Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124513574","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":"Guaranteed deadlines with dynamic recovery blocks in distributed systems","authors":"H. Chetto","doi":"10.1109/EMWRTS.1994.336842","DOIUrl":"https://doi.org/10.1109/EMWRTS.1994.336842","url":null,"abstract":"In a hard real-time system, a timing fault is said to occur when a real time task delivers its results too late. An deadline mechanism has been proposed to avoid timing faults in uniprocessor machines. Under this approach, every task is implemented with two algorithms: on one hand, a primary program produces a good quality service but in an unknown and possibly infinite length of time due to software errors; and on the other hand, a back-up alternate program produces an acceptable result in a known and fixed length of time. We propose an extension of this approach to distributed systems. We present a task allocation strategy to cope both with processor failures and timing faults.<<ETX>>","PeriodicalId":322579,"journal":{"name":"Proceedings Sixth Euromicro Workshop on Real-Time Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115646513","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":"Relating specified time tolerances to implementation performances","authors":"L. Mezzalira, A. Morzenti","doi":"10.1109/EMWRTS.1994.336838","DOIUrl":"https://doi.org/10.1109/EMWRTS.1994.336838","url":null,"abstract":"Real-time systems require that the high-level control constructs used by the designer have a rigorously defined semantics specifying their actual temporal behavior, which unfortunately depends on implementation details that the high-level view tends to hide from the user. Moreover the real implementations only approximate the typical ideal properties; in some systems these approximations cannot be ignored. A description is given in TRIO formal language of some time-related constructs. Then on the basis of a timing implementation model a behavioral characterization is presented. Finally quantitative relations are derived between execution timing components and the formally defined timing parameters.<<ETX>>","PeriodicalId":322579,"journal":{"name":"Proceedings Sixth Euromicro Workshop on Real-Time Systems","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123971980","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 dynamic scheduling algorithm for semi-hard real-time environments","authors":"M. Chetto","doi":"10.1109/EMWRTS.1994.336853","DOIUrl":"https://doi.org/10.1109/EMWRTS.1994.336853","url":null,"abstract":"In many real-time systems, it is crucial for the application tasks to meet their specified deadlines, otherwise the tasks cause catastrophic results. Every task is generally periodic, and the value of its period depends on the dynamics of the process it controls. In addition, some additional time-critical tasks said to be sporadic can occur and require to be processed at unpredictable times. The paper examines the fundamental problem of scheduling a given set of periodic tasks, together with sporadic tasks on a uniprocessor machine. More precisely, we are concerned with the dynamic problem arising when a sporadic task occurs, which starts to execute it as soon as possible while adhering to timing constraints of periodic tasks. First, we report on theoretical properties of the preemptive Earliest Deadline algorithm and describe an online scheduling strategy which is both optimal and easy to implement. Then, we show how this strategy could be integrated in a distributed scheduler: when a sporadic task arrives on a node, either this task is executed locally or migrates to another node which provides it with the best response time.<<ETX>>","PeriodicalId":322579,"journal":{"name":"Proceedings Sixth Euromicro Workshop on Real-Time Systems","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122718175","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":"Timing analysis and conditional scheduling in a real-time system design environment","authors":"Zebo Peng, Anders Törne","doi":"10.1109/EMWRTS.1994.336840","DOIUrl":"https://doi.org/10.1109/EMWRTS.1994.336840","url":null,"abstract":"This paper presents an approach to carry out timing analysis and scheduling in a real-time system design environment for flexible manufacturing systems. It is built based on a formal model for specifying real-time systems using extended timed Petri nets. The designer uses the model to specify a design at a given level. The functional characteristics as well as timing properties of the design can then be analyzed with design evaluation procedures. To facilitate timing analysis, a conditional scheduling strategy has been developed to provide a pre-run-time schedule. The strategy is based on a list scheduling method with several priority schemes. This paper describes the design environment, the timing analysis procedure, and the basic strategy for scheduling.<<ETX>>","PeriodicalId":322579,"journal":{"name":"Proceedings Sixth Euromicro Workshop on Real-Time Systems","volume":"167 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126649037","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":"Integration of RTL and precedence graphs with a static scheduler as verifier","authors":"G. Fohler, Christian Huber","doi":"10.1109/EMWRTS.1994.336870","DOIUrl":"https://doi.org/10.1109/EMWRTS.1994.336870","url":null,"abstract":"We present an approach to specification and verification of distributed hard real-time systems. By integrating RTL and precedence constraints, we combine the comprehensiveness of precedence graphs with the expressive power and proofability of RTL. Thus, our approach allows easy comprehension by the human designer and formal correctness. We propose to use a static scheduling algorithm based on heuristic search to carry out a constructive proof of the set of formulas resulting form a design combining both methods. As the precedence structure is kept, the number of formulae checked at each search point is drastically reduced. Furthermore, we extend RTL to be applicable to distributed systems with preemptable tasks.<<ETX>>","PeriodicalId":322579,"journal":{"name":"Proceedings Sixth Euromicro Workshop on Real-Time Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123746998","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":"Fixed priority scheduling with deadlines prior to completion","authors":"A. Burns, K. Tindell, A. Wellings","doi":"10.1109/EMWRTS.1994.336852","DOIUrl":"https://doi.org/10.1109/EMWRTS.1994.336852","url":null,"abstract":"Standard analysis for fixed priority scheduling assumes that all the computations for each task must be completed by the task's deadline. In practice this is rarely the case. The deadline is more correctly associated with the last observable event of the task, interval events and kernel overheads (such as the context switch away from the task) can occur after the deadline. New analysis is presented that caters for this situation. The result is enhanced schedulability without modification to the preemptive behaviour of the run-time system.<<ETX>>","PeriodicalId":322579,"journal":{"name":"Proceedings Sixth Euromicro Workshop on Real-Time Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128627364","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":"Realtime-learning on an autonomous mobile robot with neural networks","authors":"U. Zimmer, E. Puttkamer","doi":"10.1109/EMWRTS.1994.336867","DOIUrl":"https://doi.org/10.1109/EMWRTS.1994.336867","url":null,"abstract":"We discuss the usage of neural network clustering techniques on a mobile robot, in order to build qualitative topologic environment maps. This has to be done in realtime, i.e. the internal world-model has to be adapted by the flow of sensor-samples without the possibility to stop this data flow. Our experiments are done in a simulation environment as well as on a robot, called ALICE.<<ETX>>","PeriodicalId":322579,"journal":{"name":"Proceedings Sixth Euromicro Workshop on Real-Time Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121593885","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":"The sequencing of data flow tasks in SIGNAL: application to active vision in robotics","authors":"É. Rutten, É. Marchand, F. Chaumette","doi":"10.1109/EMWRTS.1994.336861","DOIUrl":"https://doi.org/10.1109/EMWRTS.1994.336861","url":null,"abstract":"Many applications of real-time systems feature a combination of \"continuous\" (possibly sampled) and discrete (sequencing and task control) behaviors, both reactive to the evolutions of the execution environment. In particular, robotics applications involve the programming of the control functions for each task, and the sequencing of such tasks at a higher level. In the framework of the real-time synchronized data-flow language SIGNAL, we propose extensions based on time intervals, enabling the specification of tasks, and of their suspension or abortion for their sequencing in reaction to discrete events. This paper illustrates the application of these constructs to active vision in robotics, where successive phases have to be sequenced, each associated with a particular control law, in order to recognise a complex environment.<<ETX>>","PeriodicalId":322579,"journal":{"name":"Proceedings Sixth Euromicro Workshop on Real-Time Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121776761","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":"Dynamic scheduling for mobile robots","authors":"T. Balch, H. Forbes, K. Schwan","doi":"10.1109/EMWRTS.1994.336869","DOIUrl":"https://doi.org/10.1109/EMWRTS.1994.336869","url":null,"abstract":"This research concerns efficient multiprocessor threads-based implementation of reactive navigation for mobile robots. We present two important results: 1) Performance is improved significantly when CPU time allocated to individual navigational threads is adjusted dynamically according to a heuristic measure of their importance. 2) To implement this strategy, we present a multiprocessor scheduler design which can dynamically schedule navigational threads. The experiments were conducted in simulation on a BBN Butterfly and a KSR1 (shared memory multiprocessors). Speedups found for this example should extend to more complex navigational strategies as long as a heuristic measure of thread importance is available.<<ETX>>","PeriodicalId":322579,"journal":{"name":"Proceedings Sixth Euromicro Workshop on Real-Time Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114551640","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}