Swen Jacobs, Guillermo A. Perez, Philipp Schlehuber-Caissier
We present an extension of the Temporal Logic Synthesis Format (TLSF). TLSF builds on standard LTL, but additionally supports high-level constructs, such as sets and functions, as well as parameters that allow a specification to define a whole a family of problems. Our extension introduces operators and a new semantics option for LTLf, i.e., LTL on finite executions.
Dylan Bellier, Gregory Faraut, Yan Monier et al.
In recent years the theory of Higher Dimensional Automata (HDA) has seen significant advances from a theoretical point of view, reflecting standard automata theory. There have also been first attempts to use the mathematical framework provided by HDAs to known problems, in particular Petri Net analysis. However real-world applications are still lacking and issues from real-world system, as concurrency, is still opened in the context of controller generation. In this work we show how the framework of HDAs can be adapted to help transforming controllers given as interpreted Petri nets (IPN) into an actual closed loop controller and how the HDA helps in identifying ambiguous or even contradictory specifications that remain hidden in the IPN. We demonstrate the feasibility by connecting the obtain controller to a virtual environment for closed loop control, exemplified by an industrial example.
Emily Clement, Nicolas Perrin-Gilbert, Philipp Schlehuber-Caissier
In this paper we present a layered approach for multi-agent control problem, decomposed into three stages, each building upon the results of the previous one. First, a high-level plan for a coarse abstraction of the system is computed, relying on parametric timed automata augmented with stopwatches as they allow to efficiently model simplified dynamics of such systems. In the second stage, the high-level plan, based on SMT-formulation, mainly handles the combinatorial aspects of the problem, provides a more dynamically accurate solution. These stages are collectively referred to as the SWA-SMT solver. They are correct by construction but lack a crucial feature: they cannot be executed in real time. To overcome this, we use SWA-SMT solutions as the initial training dataset for our last stage, which aims at obtaining a neural network control policy. We use reinforcement learning to train the policy, and show that the initial dataset is crucial for the overall success of the method.