5 search results - page 1 / 1 » Task automata: Schedulability, decidability and undecidabili... |
IANDC
2007
13 years 4 months ago
2007
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...
TACAS
2004
Springer
13 years 9 months ago
2004
Springer
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...
TCS
2002
13 years 3 months ago
2002
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
IFM
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
POPL
2009
ACM
14 years 4 months ago
2009
ACM
Asynchronous or "event-driven" programming is a popular technique to efficiently and flexibly manage concurrent interactions. In these programs, the programmer can post ...