Scheduling hard sporadic tasks with regular languages and generating functions.

DOI10.1016/J.TCS.2003.10.009zbMath1059.68060OpenAlexW2031722600MaRDI QIDQ1426168

Jean-Philippe Dubernard, Dominique Geniet

Publication date: 14 March 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.10.009

zbMATH Keywords

Generating functionsFinite automataHard real-time systemsOperational validation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on preemptive scheduling of periodic, real-time tasks
• A theory of timed automata
• Sur divers produits de séries formelles
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Direct and dual laws for automata with multiplicities

This page was built for publication: Scheduling hard sporadic tasks with regular languages and generating functions.