Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations
IEEE Transactions on Software Engineering
Some properties of timed nets under the earliest firing rule
Advances in Petri nets 1989
Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Stack-based scheduling for realtime processes
Real-Time Systems
IEEE Transactions on Software Engineering
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
A Genetic Algorithm for Scheduling Tasks in a Real-Time Distributed System
EUROMICRO '98 Proceedings of the 24th Conference on EUROMICRO - Volume 2
Minimal schedulability interval for real-time systems of periodic tasks with offsets
Theoretical Computer Science
WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model
Theoretical Computer Science
A Framework for Distributing Real-Time Functions
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Tree scheduling versus sequential scheduling
Proceedings of the 1st Workshop on Critical Automotive applications: Robustness & Safety
Linear transformation of conditional real-time tasks
Proceedings of the 20th International Conference on Real-Time and Network Systems
Hi-index | 0.00 |
We present a methodology of off-line analysis of real-time systems, composed of periodic, synchronous or asynchronous precedence and resource constrained real-time tasks. As there is no polynomial optimal scheduling technique for such tasks sets, we present an enumerative method based on the construction of the state graph of a Petri net. The time is modeled by the Petri net through the earliest firing rule.