Practical controller synthesis for MTL _0,∞

Abstract

Metric Temporal Logic MTL0,∞ 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 MTL0,∞ are both decidable, we note that the controller synthesis problem for MTL0,∞ 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 MTL0,∞ 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 MTL0,∞ synthesis. Lastly we demonstrate on a number of case-studies the applicability and scalability of the proposed method.

Real-Time Policy Enforcement with Metric First-Order Temporal Logic

“…Existing security policy enforcers typically focus on propositional policies expressed as variants of (security, edit, or timed) automata [27]. In contrast, controller synthesis tools [6] also enforce specifications expressed in LTL [16] or in (fragments of) metric temporal logics [17,19,32,40]. However, automata and propositional temporal logic are limited in their expressiveness: they regard system actions as atomic and thus cannot formulate dependencies between the data values coming from an infinite domain that the actions may carry as parameters.…”

Monitoring Timed Properties (Revisited)

“…While our work was designed to facilitate implementation, this has not yet been completed. Our planned implementation will be distributed in the form of a C++ library with facilities to read TBAs in the UPPAAL XML format [23] that is output by tools like Casaal [24] and MightyL [9]. We also plan to integrate the tool into UPPAAL SMC [14] to replace the current rewrite-based Weighted MTL implementation [11].…”

“…Some earlier work implemented algorithms to translate subsets of MITL to TBAs as well. Li et al proposed and implemented Casaal, a tool to construct deterministic approximations of TBAs from MTL 0,∞ formulas [24,10]. Geilen and Dams implemented an algorithm to produce a deterministic Timed Automaton (TA) for dense-time MITL ≤ (a subset of MTL 0,∞ ) using an on-the-fly tableau construction that discretizes the time domain and only supports an upper bound [17].…”

Taming Large Bounds in Synthesis from Bounded-Liveness Specifications (Full Version)

“…Under this assumption, [20] proposes a synthesis algorithm for bounded response properties, and a translation from MTL to deterministic timed automata is presented in [23]. With respect to tool support, sound but incomplete synthesis methods for fragments of MTL have been proposed in [6] and [18], and implemented in toolchains that employ Uppaal-Tiga [3] for timed games solving. A tool for MTL controller synthesis via translation to alternating timed automata was presented in [13].…”