Sciweavers

166 search results - page 24 / 34
» Symbolic Schedulability Analysis of Real-Time Systems
Sort
View
ADAEUROPE
2007
Springer
15 years 11 months ago
Towards User-Level Extensibility of an Ada Library: An Experiment with Cheddar
In this article, we experiment a way to extend an Ada library called Cheddar. Cheddar provides a domain specific language. Programs written with this domain specific language can...
Frank Singhoff, Alain Plantec
165
Voted
IANDC
2007
107views more  IANDC 2007»
15 years 5 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...
RTAS
2011
IEEE
14 years 9 months ago
End-to-End Delay Analysis for Fixed Priority Scheduling in WirelessHART Networks
—The WirelessHART standard has been specifically designed for real-time communication between sensor and actuator devices for industrial process monitoring and control. End-toen...
Abusayeed Saifullah, You Xu, Chenyang Lu, Yixin Ch...
165
Voted
COMCOM
2004
114views more  COMCOM 2004»
15 years 5 months ago
WFI optimized PWGPS for wireless IP networks
The worst-case fairness index (WFI) has proved to be an important metric in the provision of fairness and bounded delay in both wired and wireless networks. A feature of wireless l...
Fei Xiang, Alan Marshall, Junzhou Luo
TACAS
2004
Springer
107views Algorithms» more  TACAS 2004»
15 years 11 months ago
Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata
Abstract. We study schedulability problems of timed systems with nonuniformly recurring computation tasks. Assume a set of real time tasks whose best and worst execution times, and...
Pavel Krcál, Wang Yi