English
Related papers

Related papers: A LTL Fragment for GR(1)-Synthesis

200 papers

Reactive synthesis is the process of generating correct controllers from temporal logic specifications. Classical LTL reactive synthesis handles (propositional) LTL as a specification language. Boolean abstractions allow reducing LTLt…

Logic in Computer Science · Computer Science 2024-07-15 Andoni Rodríguez , Felipe Gorostiaga , César Sánchez

Virtually all verification and synthesis techniques assume that the formal specifications are readily available, functionally correct, and fully match the engineer's understanding of the given system. However, this assumption is often…

Formal Languages and Automata Theory · Computer Science 2022-06-15 Simon Lutz , Daniel Neider , Rajarshi Roy

Reactive synthesis is a technology for the automatic construction of reactive systems from logical specifications. In these lecture notes, we study different algorithms for the reactive synthesis problem of linear-time temporal logic (LTL).…

Logic in Computer Science · Computer Science 2018-03-28 Bernd Finkbeiner , Felix Klein

Temporal logic based synthesis approaches are often used to find trajectories that are correct-by-construction for tasks in systems with complex behavior. Some examples of such tasks include synchronization for multi-agent hybrid systems,…

Logic in Computer Science · Computer Science 2017-09-22 Sumanth Dathathri , Richard M. Murray

We address the problem of diagnosing and repairing specifications for hybrid systems formalized in signal temporal logic (STL). Our focus is on the setting of automatic synthesis of controllers in a model predictive control (MPC) framework.…

We train hierarchical Transformers on the task of synthesizing hardware circuits directly out of high-level logical specifications in linear-time temporal logic (LTL). The LTL synthesis problem is a well-known algorithmic challenge with a…

Machine Learning · Computer Science 2021-07-27 Frederik Schmitt , Christopher Hahn , Markus N. Rabe , Bernd Finkbeiner

This paper presents an algorithmic framework for control synthesis of continuous dynamical systems subject to signal temporal logic (STL) specifications. We propose a novel algorithm to obtain a time-partitioned finite automaton from an STL…

Systems and Control · Electrical Eng. & Systems 2022-10-05 Qi Heng Ho , Roland B. Ilyes , Zachary N. Sunberg , Morteza Lahijanian

Synthesis automatically constructs an implementation that satisfies a given logical specification. In this paper, we study the live synthesis problem, where the synthesized implementation replaces an already running system. In addition to…

Logic in Computer Science · Computer Science 2021-07-05 Bernd Finkbeiner , Felix Klein , Niklas Metzger

In this paper, we investigate the problem of synthesizing strategies for linear temporal logic (LTL) specifications that are interpreted over finite traces -- a problem that is central to the automated construction of controllers, robot…

Logic in Computer Science · Computer Science 2018-09-03 Alberto Camacho , Meghyn Bienvenu , Sheila A. McIlraith

The parameter synthesis problem for parametric timed automata is undecidable in general even for very simple reachability properties. In this paper we introduce restrictions on parameter valuations under which the parameter synthesis…

Formal Languages and Automata Theory · Computer Science 2016-03-07 Peter Bezděk , Nikola Beneš , Jiří Barnat , Ivana Černá

We introduce Parametric Linear Dynamic Logic (PLDL), which extends Linear Dynamic Logic (LDL) by temporal operators equipped with parameters that bound their scope. LDL itself was proposed as an extension of Linear Temporal Logic (LTL) that…

Logic in Computer Science · Computer Science 2015-12-08 Peter Faymonville , Martin Zimmermann

Learning to control an unknown dynamical system with respect to high-level temporal specifications is an important problem in control theory. We present the first regret-free online algorithm for learning a controller for linear temporal…

Artificial Intelligence · Computer Science 2025-06-09 Rupak Majumdar , Mahmoud Salamati , Sadegh Soudjani

We discuss the problem of experimentally evaluating linear-time temporal logic (LTL) synthesis tools for reactive systems. We first survey previous such work for the currently publicly available synthesis tools, and then draw conclusions by…

Logic in Computer Science · Computer Science 2011-02-22 Rüdiger Ehlers

Some applications of linear temporal logic (LTL) require to translate formulae of the logic to deterministic omega-automata. There are currently two translators producing deterministic automata: ltl2dstar working for the whole LTL and…

Formal Languages and Automata Theory · Computer Science 2013-11-07 Tomáš Babiak , František Blahoudek , Mojmír Křetínský , Jan Strejček

Executing a Golog program on an actual robot typically requires additional steps to account for hardware or software details of the robot platform, which can be formulated as constraints on the program. Such constraints are often temporal,…

Artificial Intelligence · Computer Science 2021-02-23 Till Hofmann , Gerhard Lakemeyer

Temporal logics are powerful tools that are widely used for the synthesis and verification of reactive systems. The recent progress on Large Language Models (LLMs) has the potential to make the process of writing such specifications more…

Machine Learning · Computer Science 2024-06-12 William Murphy , Nikolaus Holzer , Nathan Koenig , Leyi Cui , Raven Rothkopf , Feitong Qiao , Mark Santolucito

Quantitative extensions of temporal logics have recently attracted significant attention. In this work, we study frequency LTL (fLTL), an extension of LTL which allows to speak about frequencies of events along an execution. Such an…

Logic in Computer Science · Computer Science 2015-09-15 Vojtěch Forejt , Jan Krčál , Jan Křetínský

Linear Temporal Logic (LTL) is a widely used task specification language for autonomous systems. To mitigate the significant manual effort and expertise required to define LTL-encoded tasks, several methods have been proposed for…

Computation and Language · Computer Science 2026-02-23 David Smith Sundarsingh , Jun Wang , Jyotirmoy V. Deshmukh , Yiannis Kantaros

Linear Temporal Logic (LTL) is a widely used specification framework for linear time properties of systems. The standard approach for verifying such properties is by transforming LTL formulae to suitable $\omega$-automata and then applying…

Formal Languages and Automata Theory · Computer Science 2017-10-19 Martin Sulzmann , Peter Thiemann

We consider the synthesis of distributed implementations for specifications in parameterized temporal logics such as PROMPT-LTL, which extends LTL by temporal operators equipped with parameters that bound their scope. For single process…

Logic in Computer Science · Computer Science 2018-02-28 Swen Jacobs , Leander Tentrup , Martin Zimmermann