Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations
IEEE Transactions on Software Engineering
A Unified High-Level Petri Net Formalism for Time-Critical Systems
IEEE Transactions on Software Engineering
A Pre-Run-Time Scheduling Algorithm for Hard Real-Time Systems
IEEE Transactions on Software Engineering
HRT-HOOD: a structured design method for hard real-time systems
Real-Time Systems
Comment on "A Pre-Run-Time Scheduling Algorithm for Hard Real-Time Systems"
IEEE Transactions on Software Engineering
Combined Task and Message Scheduling in Distributed Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
On Satisfying Timing Constraints in Hard-Real-Time Systems
IEEE Transactions on Software Engineering
Petri Nets in Performance Analysis: An Introduction
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
A Framework for Scheduler Synthesis
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Modeling and analysis of scheduling for distributed real-time embedded systems
International Journal of Automation and Computing
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
There are two general approaches for scheduling tasksin real-time systems: runtime and pre-runtime scheduling.However, there are several situations where the runtime approachdoes not find a feasible schedule even when such aschedule exists. However, finding a feasible schedule is nottrivial, because this problem is NP-Hard in its general form.The proposed method finds a pre-runtime scheduling, whenone exists, using state space exploration starting from a systemformal model. Despite this technique being not new, atthe best of our present knowledge, no one tried to use it forfinding pre-runtime scheduling. The main problem with thisapproach is the space size, which can grow exponentially.This paper shows how to minimize this problem. Additionally,the proposed algorithm is a depth-first search methodon a labeled transition system derived from a time Petri netmodel. It is verified through real-world experimental resultsthat the schedule is found examining a reduced number ofstates.