Skip to Main content Skip to Navigation
Conference papers

Practical Controller Synthesis for MTL$0,∞$

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download
Contributor : Nisrine JAFRI Connect in order to contact the contributor
Submitted on : Tuesday, November 21, 2017 - 12:54:33 AM
Last modification on : Saturday, August 6, 2022 - 3:32:54 AM


Files produced by the author(s)



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. ⟨10.1145/nnnnnnn.nnnnnnn⟩. ⟨hal-01642162⟩



Record views


Files downloads