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 that are computation tasks generated (or triggered) by timed events. Compared with classical task models for real time syst...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Information and computation Ročník 205; číslo 8; s. 1149 - 1172
Hlavní autori:	Fersman, Elena, Krcal, Pavel, Pettersson, Paul, Yi, Wang
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	San Diego, CA Elsevier Inc 2007 Elsevier
Predmet:	Algebraic topology Applied sciences Computer science Computer science; control theory; systems Computer systems performance. Reliability Datavetenskap Exact sciences and technology Information technology Informationsteknik Language theory and syntactical analysis Mathematics Miscellaneous Modeling and verification Real time systems Schedulability analysis Sciences and techniques of general use Software TECHNOLOGY TEKNIKVETENSKAP Theoretical computing Timed automata Topology. Manifolds and cell complexes. Global analysis and analysis on manifolds Real time systems Schedulability analysis Modeling and verification Timed automata Asynchronous Bounded automaton Decidability Computer theory Asynchronous automaton Constraint Check Scheduling Real time Real time system Completion Subtraction Influence Strategy Time interval Timing Execution time
ISSN:	0890-5401, 1090-2651, 1090-2651
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!