286 search results - page 14 / 58 » Schedulability Analysis of MSC-based System Models |
153
click to vote
EMSOFT
2005
Springer
15 years 9 months ago
2005
Springer
We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an inter...
109
click to vote
ECRTS
2007
IEEE
15 years 10 months ago
2007
IEEE
Feasibility analysis determines (prior to system execution-time) whether a specified collection of hard-realtime jobs executed on a processing platform can meet all deadlines. In...
139
click to vote
FSEN
2009
Springer
15 years 7 months ago
2009
Springer
This note aims at providing a concise and precise Travellers Guide, Phrase Book or Reference Manual to the timed automata modeling formalism introduced by Alur and Dill [7, 8]. The...
127
click to vote
TPDS
2002
15 years 3 months ago
2002
The problem of question/answering (Q/A) is to find answers to open-domain questions by searching large collections of documents. Unlike information retrieval systems, very common ...
129
click to vote
RTCSA
2000
IEEE
15 years 8 months ago
2000
IEEE
This paper introduces an exact schedulability analysis for the optional computation model urider a specified failure hypothesis. From this analysis, we propose a solutionfor deter...