TACoS: A Tool for MTL Controller Synthesis

Hofmann, Till; Schupp, Stefan

doi:10.1007/978-3-030-92124-8_21

Cited by 5 publications

(16 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In our second set of experiments, we took MTL synthesis problems from [13] and adapted them to SafeLTL B formulas. The benchmarks include a conveyor belt (conv-belt), a robot camera (robo-cam), and several parametrized instances of a multiple railroad-crossings controller (rail).…”

Section: Adaption Of Real-time Benchmarksmentioning

confidence: 99%

“…These experiments show that SafeLTL B can express interesting requirements from the real-time domain by appropriate discretization. We did not compare directly to the tool in [13], as the underlying modeling formalism is different, and hence we adapted the benchmarks. However, a superficial comparison of our results to those in [13] shows that our tool compares well (and is in some cases better).…”

Section: Adaption Of Real-time Benchmarksmentioning

confidence: 99%

“…We did not compare directly to the tool in [13], as the underlying modeling formalism is different, and hence we adapted the benchmarks. However, a superficial comparison of our results to those in [13] shows that our tool compares well (and is in some cases better). Furthermore, on these benchmarks our tool clearly outperforms strix.…”

Section: Adaption Of Real-time Benchmarksmentioning

confidence: 99%

“…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]. In the case when the real-time synthesis problem is given as a timed game and the specification is a state-based winning condition, the problem of computing a control strategy is decidable [21].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

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

Heim¹,

Dimitrova²

2023

Preprint

View full text Add to dashboard Cite

Automatic synthesis from temporal logic specifications is an attractive alternative to manual system design, due to its ability to generate correct-by-construction implementations from high-level specifications. Due to the high complexity of the synthesis problem, significant research efforts have been directed at developing practically efficient approaches for restricted specification language fragments. In this paper we focus on the Safety LTL fragment of Linear Temporal Logic (LTL) syntactically extended with bounded temporal operators. We propose a new synthesis approach with the primary motivation to solve efficiently the synthesis problem for specifications with bounded temporal operators, in particular those with large bounds. The experimental evaluation of our method shows that for this type of specifications it outperforms state-ofart synthesis tools, demonstrating that it is a promising approach to efficiently treating quantitative timing constraints in safety specifications.

show abstract

Section: Adaption Of Real-time Benchmarksmentioning

confidence: 99%

Section: Adaption Of Real-time Benchmarksmentioning

confidence: 99%

Section: Adaption Of Real-time Benchmarksmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

Heim¹,

Dimitrova²

2023

Preprint

View full text Add to dashboard Cite

show abstract

“…For future work, we plan to extend our MTL synthesis tool TACOS (Hofmann and Schupp 2021) to GOLOG programs. Additionally, while MTL over infinite words is generally undecidable, it may be interesting to restrict the specification to Safety MTL, which is decidable on infinite words and thus may allow controller synthesis for non-terminating GOLOG programs.…”

Section: Decidabilitymentioning

confidence: 99%

Controlling Golog Programs against MTL Constraints

Hofmann¹,

Schupp²

2022

Preprint

Self Cite

View full text Add to dashboard Cite

While Golog is an expressive programming language to control the high-level behavior of a robot, it is often tedious to use on a real robotic system. On an actual robot, the user needs to consider low-level details, such as enabling and disabling hardware components, e.g., a camera to detect objects for grasping. In other words, high-level actions usually pose implicit temporal constraints on the low-level platform, which are typically independent of the concrete program to be executed. In this paper, we propose to make these constraints explicit by modeling them as MTL formulas, which enforce the execution of certain low-level platform operations in addition to the main program. Based on results from timed automata controller synthesis, we describe a method to synthesize a controller that executes both the high-level program and the low-level platform operations concurrently in order to satisfy the MTL specification. This allows the user to focus on the high-level behavior without the need to consider lowlevel operations. We present an extension to Golog by clocks together with the required theoretical foundations as well as decidability results.1 With a finite set of rational constants used for comparison in constraints, these can be scaled to integer values.The set of final configurations F w is the smallest set such thatIntuitively, the program may take a single transition step (Definition 8.1) if the action is possible to execute and if there is some time increment such that all clock constraints are satisfied. In the resulting configuration, the program trace is appended with the new action a and the incremented time t, all clock values are either incremented by the time increment, or reset if a resets the clock. Also, a program is final if there is no remaining action and if any test α? is successful.By following the transitions, we obtain program traces:Definition 9 (Program Traces). Given a world w, a finite trace z, and a clock valuation ν, the program traces of a program expression δ are defined as follows:Succ w (z, ν, δ) = {(z ′ , ν ′ , δ ′ ) | z, ν, δ w

show abstract

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

Hublet

Basin

Krstić

2022

Computer Security – ESORICS 2022

View full text Add to dashboard Cite

Correctness and regulatory compliance of today's software systems are crucial for our safety and security. This can be achieved with policy enforcement: the process of monitoring and possibly modifying system behavior to satisfy a given policy. The enforcer's capabilities determine which policies are enforceable. We study the enforceability of policies specified in metric first-order temporal logic (MFOTL) with enforcers that can cause and suppress different system actions in real time. We consider an expressive safety fragment of MFOTL and show that a policy from that fragment is enforceable if and only if it is equivalent to a policy in a simpler, syntactically defined MFOTL fragment. We then propose an enforcement algorithm for all monitorable policies from the latter fragment, and show that our EnfPoly enforcer outperforms state-of-the-art tools.

show abstract

TACoS: A Tool for MTL Controller Synthesis

Cited by 5 publications

References 19 publications

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

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

Controlling Golog Programs against MTL Constraints

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

Contact Info

Product

Resources

About