Paper Info
Title
From the Specification to the Scheduling of Time-Dependent Systems
Abstract
This paper introduces and formalizes a new variant of Timed Automata, called Time Labeled Scheduling Automata. A Time Labeled Scheduling Automaton is a single clock implementation model expressing globally the time constraints that a system has to meet. An algorithm is presented to show how a Time Labeled Scheduling Automaton can be synthesized from a minimal reachability graph derived from a high-level specification expressing the composition of different time constraints. It is shown how the reachability graph may be corrected before synthesizing the Time Labeled Scheduling Automaton to remove all its potentially inconsistent behaviors. Current applications of the model are the scheduling of interactive multimedia documents and a simple illustration is given in this area.
Year
DOI
Venue
2002
10.1007/3-540-45739-9_10
FTRTFT
Keywords
Field
DocType
time labeled scheduling automata,current application,time-dependent systems,minimal reachability graph,high-level specification,reachability graph,time constraint,different time constraint,timed automata,time labeled scheduling automaton,single clock implementation model,interactive multimedia,process algebra
Deterministic automaton,Scheduling (computing),Computer science,Automaton,Algorithm,Two-level scheduling,Reachability,Timed automaton,Dynamic priority scheduling,Round-robin scheduling,Distributed computing
Conference
ISBN
Citations 
PageRank 
3-540-44165-4
5
0.62
References 
Authors
19
2
Name
Order
Citations
PageRank
Christophe Lohr1357.00
Jean-Pierre Courtiat221632.68