Symbolic Schedulability Analysis of Real-Time Systems
نویسندگان
چکیده
We propose a unifying method for analysis of scheduling problems in real-time systems. The method is based on ACSR-VP, a real-time process algebra with value-passing capabilities. We use ACSR-VP to describe an instance of a scheduling problem as a process that has parameters of the problem as free variables. The specification is analyzed by means of a symbolic algorithm. The outcome of the analysis is a set of equations, a solution to which yields the values of the parameters that make the system schedulable. Equations are solved using integer programming or constraint logic programming. The paper presents specifications of two scheduling problems as examples.
منابع مشابه
Schedulability of Herschel-Planck Revisited Using Statistical Model Checking
Schedulability analysis is a main concern for several embedded applications due to their safety-critical nature. The classical method of response time analysis provides an efficient technique used in industrial practice. However, the method is based on conservative assumptions related to execution and blocking times of tasks. Consequently, the method may falsely declare deadline violations that...
متن کاملTimed Automata with Asynchronous Processes: Schedulability and Decidability
In this paper, we exend timed automata with asynchronous processes i.e. tasks triggered by events as a model for real-time systems. The model is expressive enough to describe concurrency and synchronization, and real time tasks which may be periodic, sporadic, preemptive and (or) non-preemptive. We generalize the classic notion of schedulability in scheduling theory to timed automata as follows...
متن کاملSymbolic execution and timed automata model checking for timing analysis of Java real-time systems
This paper presents SYMRT, a tool based on a combination of symbolic execution and real-time model checking for timing analysis of Java systems. Symbolic execution is used for the generation of a safe and tight timing model of the analyzed system capturing the feasible execution paths. The model is combined with suitable execution environment models capturing the timing behavior of the target h...
متن کاملTIMES: A Tool for Schedulability Analysis and Code Generation of Real-Time Systems
Times is a tool suite designed mainly for symbolic schedulability analysis and synthesis of executable code with predictable behaviours for real-time systems. Given a system design model consisting of (1) a set of application tasks whose executions may be required to meet mixed timing, precedence, and resource constraints, (2) a network of timed automata describing the task arrival patterns and...
متن کاملIntegrating Schedulability Analysis with UML-RT
The use of object-oriented techniques and methodologies to design real-time control systems appears to be necessary in order to deal with the increasing complexity of such systems. Recently, many object-oriented methods have been used for the modelling and designing of real-time control systems. We believe an approach that integrates the advancements in both object modelling and design methods,...
متن کاملDemand-based schedulability analysis for real-time multi-core scheduling
In real-time systems, schedulability analysis has been widely studied to provide offline guarantees on temporal correctness, producing many analysis methods. The demand-based schedulability analysis method has a great potential for high schedulability performance and broad applicability. However, such a potential is not yet fully realized for real-time multi-core scheduling mainly due to (i) th...
متن کامل