Practical Controller Synthesis for MTL$0,∞$
(2017) International SPIN Symposium on Model Checking of Software (13.July.2017)
Files
No attached file found for this publication.
Details
- Authors
- 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.
- Affiliations
Citations
Li, G., Jensen, P., Larsen, K., Legay, A., & Poulsen, D. (2017). Practical Controller Synthesis for MTL$0,∞$. International SPIN Symposium on Model Checking of Software. https://hdl.handle.net/2078.5/227495