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. © Springer-Verlag Berlin Heidelberg 2002.
CITATION STYLE
D’Souza, D., & Madhusudan, P. (2002). Timed control synthesis for external specifications. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2285, 571–582. https://doi.org/10.1007/3-540-45841-7_47
Mendeley helps you to discover research relevant for your work.