Theoretical Computer Science
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Verification, refinement and scheduling of real-time programs
Theoretical Computer Science - Special issue on real-time systems and concurrent and distributed software
Real-Time Systems
Real-Time Systems
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Scheduler Modeling Based on the Controller Synthesis Paradigm
Real-Time Systems
Preemptive Job-Shop Scheduling Using Stopwatch Automata
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
TIMES - A Tool for Modelling and Implementation of Embedded Systems
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Timed Automata with Asynchronous Processes: Schedulability and Decidability
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Model-Checking for Hybrid Systems by Quotienting and Constraints Solving
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Suspension Automata: A Decidable Class of Hybrid Automata
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Guided synthesis of control programs using UPPAAL
Nordic Journal of Computing
Code synthesis for timed automata
Nordic Journal of Computing
RTAS '02 Proceedings of the Eighth IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'02)
Scheduling a Steel Plant with Timed Automata
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Schedulability Analysis for Tasks with Static and Dynamic Offsets
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
A Framework for Scheduler Synthesis
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
A generic approach to schedulability analysis of real-time tasks
Nordic Journal of Computing
Task automata: Schedulability, decidability and undecidability
Information and Computation
On Scheduling Policies for Streams of Structured Jobs
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Model-based schedulability analysis of safety critical hard real-time Java programs
JTRES '08 Proceedings of the 6th international workshop on Java technologies for real-time and embedded systems
Formal verification of real-time systems with preemptive scheduling
Real-Time Systems
Testing real-time task networks with functional extensions using model-checking
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
SEUS'07 Proceedings of the 5th IFIP WG 10.2 international conference on Software technologies for embedded and ubiquitous systems
Multi-processor schedulability analysis of preemptive real-time tasks with variable execution times
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Schedulability analysis for Java finalizers
Proceedings of the 8th International Workshop on Java Technologies for Real-Time and Embedded Systems
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
Quantitative analysis of real-time systems using priced timed automata
Communications of the ACM
Safety-critical Java with cyclic executives on chip-multiprocessors
Concurrency and Computation: Practice & Experience
Adaptive task automata: a framework for verifying adaptive embedded systems
FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
Hi-index | 0.02 |
In classic scheduling theory, real-time tasks are usually assumed to be periodic, i.e. tasks are released and computed with fixed rates periodically. To relax the stringent constraints on task arrival times, we propose to use timed automata to describe task arrival patterns. In a previous work, it is shown that the general schedulability checking problem for such models is a reachability problem for a decidable class of timed automata extended with subtraction. Unfortunately, the number of clocks needed in the analysis is proportional to the maximal number of schedulable task instances associated with a model, which is in many cases huge. In this paper, we show that for fixed-priority scheduling strategy, the schedulability checking problem can be solved using standard timed automata with two extra clocks in addition to the clocks used in the original model to describe task arrival times. The analysis can be done in a similar manner to response time analysis in classic Rate-Monotonic Analysis (RMA). The result is further extended to systems with data-dependent control, in which the release time of a task may depend on the time-point at which other tasks finish their execution. For the case when the execution times of tasks are constants, we show that the schedulability problem can be solved using n + 1 extra clocks, where n is the number of tasks. The presented analysis techniques have been implemented in the Times tool. For systems with only periodic tasks, the performance of the tool is comparable with tools implementing the classic RMA technique based on equation-solving, without suffering from the exponential explosion in the number of tasks.