Name
Abstract | ||
|---|---|---|
We study the problem of control synthesis for a timed plant and an external timed specification, modelled as timed automata. Our main result is that the problem is decidable when we are given a priori the resources for the controller (the number of clocks, observational power of clocks, etc.) and when the specification is an 驴-regular timed language describing undesired behaviours. We also show that for deterministic specifications, if there is a controller at all, then there is one which uses the combined resources of the plant and specification. The decidability of other related problems is also investigated. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1007/3-540-45841-7_47 | STACS |
Keywords | Field | DocType |
main result,undesired behaviour,external specifications,deterministic specification,observational power,combined resource,timed control synthesis,related problem,control synthesis | Discrete mathematics,Control theory,Programming language,Deterministic automaton,Computer science,Automaton,A priori and a posteriori,Algorithm,Real-time operating system,Decidability,Timed automaton,Regular language | Conference |
ISBN | Citations | PageRank |
3-540-43283-3 | 38 | 1.73 |
References | Authors | |
9 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Deepak D'souza | 1 | 239 | 17.90 |
| P. Madhusudan | 2 | 4498 | 188.75 |