WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model
From MaRDI portal
Publication:2464934
DOI10.1016/j.tcs.2007.03.054zbMath1143.68034OpenAlexW1971395575MaRDI QIDQ2464934
Gaëlle Largeteau, Dominique Geniet
Publication date: 18 December 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.03.054
Related Items (5)
Geometrical regular languages and linear Diophantine equations: the strongly connected case ⋮ Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) ⋮ Geometrical Regular Languages and Linear Diophantine Equations ⋮ Regular Geometrical Languages and Tiling the Plane ⋮ AN EFFICIENT ALGORITHM TO TEST WHETHER A BINARY AND PROLONGEABLE REGULAR LANGUAGE IS GEOMETRICAL
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on preemptive scheduling of periodic, real-time tasks
- Periodic oscillations of coefficients of power series that satisfy functional equations
- A theory of timed automata
- A complete axiomatization of finite-state ACSR processes
- Scheduling hard sporadic tasks with regular languages and generating functions.
- Scheduling periodic tasks on uniform multiprocessors
- Off-line computation of real-time schedules using Petri nets
- Minimal schedulability interval for real-time systems of periodic tasks with offsets
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- New upper bounds for generalized intersection searching problems
- Tools and Algorithms for the Construction and Analysis of Systems
- Discrete Geometry for Computer Imagery
- Priority inheritance protocols: an approach to real-time synchronization
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
This page was built for publication: WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model