scholarly journals Proceedings of the Real-Time Systems Engineering Workshop

2001 ◽  
Author(s):  
B. C. Meyers ◽  
Peter H. Feiler ◽  
Ted Marz
Keyword(s):  
Real Time ◽  
Systems Engineering ◽  
Real Time Systems ◽  
The Real ◽  
Time Systems

The Real-Time Systems Compiler: migrating event-triggered systems to time-triggered systems

2011 ◽  
Vol 41 (12) ◽  
pp. 1491-1515 ◽  
Author(s):  
Fabian Scheler ◽  
Wolfgang Schröder-Preikschat
Keyword(s):  
Real Time ◽  
Real Time Systems ◽  
The Real ◽  
Time Systems ◽  
Event Triggered

scholarly journals A comprehensive survey of industry practice in real-time systems

2021 ◽  
Author(s):  
Benny Akesson ◽  
Mitra Nasri ◽  
Geoffrey Nelissen ◽  
Sebastian Altmeyer ◽  
Robert I. Davis
Keyword(s):  
Embedded Systems ◽  
Real Time ◽  
Survey Data ◽  
Common Knowledge ◽  
Academic Research ◽  
Real Time Systems ◽  
The Real ◽  
Industry Practice ◽  
Comprehensive Survey ◽  
Time Systems

AbstractThis paper presents results and observations from a survey of 120 industry practitioners in the field of real-time embedded systems. The survey provides insights into the characteristics of the systems being developed today and identifies important trends for the future. It extends the results from the survey data to the broader population that it is representative of, and discusses significant differences between application domains. The survey aims to inform both academics and practitioners, helping to avoid divergence between industry practice and academic research. The value of this research is highlighted by a study showing that the aggregate findings of the survey are not common knowledge in the real-time systems community.

Reconfiguration of Synchronous Real-Time Operating System

2013 ◽  
Vol 2 (1) ◽  
pp. 114-132 ◽  
Author(s):  
Hamza Gharsellaoui ◽  
Mohamed Khalgui ◽  
Samir Ben Ahmed
Keyword(s):  
Real Time ◽  
Systems Engineering ◽  
Scheduling Algorithm ◽  
User Requirements ◽  
Real Time Systems ◽  
Real Time Scheduling ◽  
Temporal Properties ◽  
Time Scheduling ◽  
Run Time ◽  
Time Systems

Real-time scheduling is the theoretical basis of real-time systems engineering. Earliest Deadline first (EDF) is an optimal scheduling algorithm for uniprocessor real-time systems. The paper deals with Reconfigurable Uniprocessor embedded Real-Time Systems classically implemented by different OS tasks that the authors suppose independent, synchronous and periodic to meet functional and temporal properties described in user requirements. They define two forms of automatic reconfigurations which are applied at run-time: Addition-Remove of tasks or just modifications of their temporal parameters: WCET and/or Periods. The authors define a new semantic of the reconfiguration where a crucial criterion to consider is the automatic improvement of the system’s feasibility at run-time by using an Intelligent Agent that automatically checks the system’s feasibility after any reconfiguration scenario to verify if all tasks meet the required deadlines. To handle all possible reconfiguration solutions, the authors propose an agent-based architecture that applies automatic reconfigurations to re-obtain the system’s feasibility and satisfy user requirements. Therefore, they developed the tool RT-Reconfiguration to support these contributions that they apply on the running example system and the authors apply the Real-Time Simulator, Cheddar to check the whole system behavior and evaluate the performance of the algorithm. They present simulations of this architecture where the agent that implemented is evaluated.

scholarly journals Real-time Issues in the Ada Parallel Model with OpenMP

2021 ◽  
Vol 40 (2) ◽  
pp. 96-102
Author(s):  
Luis Miguel Pinho ◽  
Sara Royuela ◽  
Eduardo Quiñones
Keyword(s):  
Real Time ◽  
General Model ◽  
Parallel Model ◽  
Real Time Systems ◽  
The Real ◽  
Fine Grain ◽  
Parallel Features ◽  
Time Systems ◽  
Current Proposal ◽  
Open Issues

The current proposal for the next revision of the Ada language considers the possibility to map the language parallel features to an underlying OpenMP runtime. As previously presented, and discussed in previous workshops, the works on fine-grain parallelism in Ada map well to the OpenMP tasking model for parallelism. Nevertheless, and although the general model of integration, and the semantic constructs are already reflected in the proposed revision of the standard, the integration of these new features with the Real-Time Systems Annex of Ada is still not complete. This paper presents an overview of what is supported and the still open issues.

AN INCREMENTAL VERIFICATION ALGORITHM FOR REAL-TIME SYSTEMS

1999 ◽  
Vol 09 (02) ◽  
pp. 203-216 ◽  
Author(s):  
AVINAS SAHAY ◽  
JEFFREY J. P. TSAI ◽  
A. PRASAD SISTLA
Keyword(s):  
State Space ◽  
Real Time ◽  
Minimum Cost ◽  
Incremental Algorithm ◽  
Real Time Systems ◽  
The Real ◽  
Verification Algorithm ◽  
Time Extension ◽  
Time Systems ◽  
Infinite State

We present an incremental algorithm for model checking the real-time systems against the requirements specified in the real-time extension of modal mu-calculus. Using this algorithm, we avoid the repeated construction and analysis of the whole state-space during the course of evolution of the system from time to time. We use a finite representation of the system, like most other algorithms on real-time systems. We construct and update a graph (called TSG) that is derived from the region graph and the formula. This allows us to halt the construction of this graph when enough nodes have been explored to determine the truth of the formula. TSG is minimal in the sense of partitioning the infinite state space into regions and it expresses a relation on the set of regions of the partition. We use the structure of the formula to derive this partition. When a change is applied to the timed automaton of the system, we find a new partition from the current partition and the TSG with minimum cost.

Sign in / Sign up

Export Citation Format

Share Document