Practical Controller Synthesis for MTL$0,∞$

Guangyuan Li (1) , Peter Meulengracht Jensen (2) , Kim G. Larsen (2) , Axel Legay (3) , Danny Bøgsted Poulsen (4)

1 Institute of Computational Mathematics and Scientific/Engineering Computing
2 AAU - Aalborg University [Denmark]
3 TAMIS - Threat Analysis and Mitigation for Information Security
4 CISS - Center for Indlejrede Software Systemer

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.

Domaines: Informatique [cs]

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⟩