Guessing winning policies in LTL synthesis by semantic learning
We provide a learning-based technique for guessing a winning strategy in a parity game
originating from an LTL synthesis problem. A cheaply obtained guess can be useful in …
originating from an LTL synthesis problem. A cheaply obtained guess can be useful in …
Synthesizing permissive winning strategy templates for parity games
We present a novel method to compute permissive winning strategies in two-player games
over finite graphs with ω-regular winning conditions. Given a game graph G and a parity …
over finite graphs with ω-regular winning conditions. Given a game graph G and a parity …
Checking and sketching causes on temporal sequences
Temporal causality describes what concrete input behavior is responsible for some
observed output behavior on a trace of a reactive system, and can be used to, eg, generate …
observed output behavior on a trace of a reactive system, and can be used to, eg, generate …
Acacia-bonsai: a modern implementation of downset-based LTL realizability
We describe our implementation of downset-manipulating algorithms used to solve the
realizability problem for linear temporal logic (LTL). These algorithms were introduced by …
realizability problem for linear temporal logic (LTL). These algorithms were introduced by …
SemML: Enhancing Automata-Theoretic LTL Synthesis with Machine Learning
Synthesizing a reactive system from specifications given in linear temporal logic (LTL) is a
classical problem, finding its applications in safety-critical systems design. We present our …
classical problem, finding its applications in safety-critical systems design. We present our …
Synthesis of Universal Safety Controllers
The goal of logical controller synthesis is to automatically compute a control strategy that
regulates the discrete, event-driven behavior of a given plant st a temporal logic …
regulates the discrete, event-driven behavior of a given plant st a temporal logic …