Controller Synthesis for MTL Specifications
We consider the control problem for timed automata against specifications given as MTL formulas. The logic MTL is a linear-time timed temporal logic which extends LTL with timing constraints on modalities, and recently, its model-checking has been proved decidable in several cases. We investigate these decidable fragments of MTL (full MTL when interpreted over finite timed words, and Safety-MTL when interpreted over infinite timed words), and prove two kinds of results. (1) We first prove that, contrary to model-checking, the control problem is undecidable. Roughly, the computation of a lossy channel system could be encoded as a model-checking problem, and we prove here that a perfect channel system can be encoded as a control problem. (2) We then prove that if we fix the resources of the controller (by resources we mean clocks and constants that the controller can use), the control problem becomes decidable. This decidability result relies on properties of well (and better) quasi-orderings.
KeywordsControl Problem Temporal Logic Winning Strategy Undesired Behaviour Controller Synthesis
Unable to display preview. Download preview PDF.
- 2.Abdulla, P.A., Nylén, A.: Better is better than well: On efficient verification of infinite-state systems. In: Proc. 15th Ann. Symp. Logic in Computer Science (LICS 2000), pp. 132–140. IEEE Comp. Soc. Press, Los Alamitos (2000)Google Scholar
- 8.Asarin, E., Maler, O., Pnueli, A., Sifakis, J.: Controller synthesis for timed automata. In: Proc. IFAC Symp. System Structure and Control, pp. 469–474. Elsevier Science, Amsterdam (1998)Google Scholar
- 9.Bouyer, P., Bozzelli, L., Chevalier, F.: Controller synthesis for MTL specifications. Research report, Laboratoire Spécification & Vérification, ENS de Cachan, France (2006)Google Scholar
- 14.D’Souza, D., Prabhakar, P.: On the expressiveness of MTL in the pointwise and continuous semantics. Formal Methods Letters (to appear, 2006)Google Scholar
- 19.Laroussinie, F., Larsen, K.G., Weise, C.: From timed automata to logic – and back. In: Hájek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol. 969, pp. 529–539. Springer, Heidelberg (1995)Google Scholar