Practical Controller Synthesis for MTL$0,∞$ - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Practical Controller Synthesis for MTL$0,∞$

Résumé

Metric Temporal Logic MTL$0,∞$ is a timed extension of linear temporal logic, LTL, with time intervals whose left endpoints are zero or whose right endpoints are infinity. Whereas the satisfiability and model-checking problems for MTL$0,∞$ are both decidable, we note that the controller synthesis problem for MTL$0,∞$ is unfortunately undecidable. As a remedy of this we propose an approximate method to the synthesis problem, which we demonstrate to be adequate and scalable to practical examples. We define a method for converting MTL$0,∞$ formulas into (nondeterministic) Timed Game Büchi Automata and furthermore show how to construct determinized over-and underapproximation of a such. For the proposed method, we present a toolchain seamlessly integrating the needed components for practical MTL$0,∞$ synthesis. Lastly we demonstrate on a number of case-studies the applicability and scalability of the proposed method.
Fichier principal
Vignette du fichier
spin.pdf (507.29 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01642162 , version 1 (21-11-2017)

Identifiants

  • HAL Id : hal-01642162 , version 1

Citer

Guangyuan Li, Peter Meulengracht Jensen, Kim G. Larsen, Axel Legay, Danny Bøgsted Poulsen. Practical Controller Synthesis for MTL$0,∞$. International SPIN Symposium on Model Checking of Software, Jul 2017, Santa barbara United States. ⟨hal-01642162⟩
545 Consultations
262 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More