English
Related papers

Related papers: Experimental Aspects of Synthesis

200 papers

Temporal synthesis is the automated design of a system that interacts with an environment, using the declarative specification of the system's behavior. A popular language for providing such a specification is Linear Temporal Logic, or LTL.…

Logic in Computer Science · Computer Science 2020-08-18 Shufang Zhu , Lucas M. Tabajara , Jianwen Li , Geguang Pu , Moshe Y. Vardi

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

Automatic synthesis from linear temporal logic (LTL) specifications is widely used in robotic motion planning, control of autonomous systems, and load distribution in power networks. A common specification pattern in such applications…

Logic in Computer Science · Computer Science 2018-04-03 Rayna Dimitrova , Mahsa Ghasemi , Ufuk Topcu

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

Given a Linear Temporal Logic (LTL) formula over input and output variables, reactive synthesis requires us to design a deterministic Mealy machine that gives the values of outputs at every time step for every sequence of inputs, such that…

Logic in Computer Science · Computer Science 2024-01-23 S. Akshay , Eliyahu Basa , Supratik Chakraborty , Dror Fried

We consider the synthesis of distributed implementations for specifications in Prompt Linear Temporal Logic (PROMPT-LTL), which extends LTL by temporal operators equipped with parameters that bound their scope. For single process synthesis…

Logic in Computer Science · Computer Science 2016-09-15 Swen Jacobs , Leander Tentrup , Martin Zimmermann

We reduce synthesis for CTL* properties to synthesis for LTL. In the context of model checking this is impossible - CTL* is more expressive than LTL. Yet, in synthesis we have knowledge of the system structure and we can add new outputs.…

Formal Languages and Automata Theory · Computer Science 2017-11-30 Roderick Bloem , Sven Schewe , Ayrat Khalimov

Synthesizing a program that realizes a logical specification is a classical problem in computer science. We examine a particular type of program synthesis, where the objective is to synthesize a strategy that reacts to a potentially…

Artificial Intelligence · Computer Science 2020-01-01 Alberto Camacho , Sheila A. McIlraith

This paper studies the online control synthesis problem for uncertain discrete-time systems subject to signal temporal logic (STL) specifications. Different from existing techniques, this work proposes an approach based on STL, reachability…

Systems and Control · Electrical Eng. & Systems 2023-03-21 Pian Yu , Yulong Gao , Frank J. Jiang , Karl H. Johansson , Dimos V. Dimarogonas

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

The problem of LTLf reactive synthesis is to build a transducer, whose output is based on a history of inputs, such that, for every infinite sequence of inputs, the conjoint evolution of the inputs and outputs has a prefix that satisfies a…

Formal Languages and Automata Theory · Computer Science 2025-07-04 Alexandre Duret-Lutz , Shufang Zhu , Nir Piterman , Giuseppe de Giacomo , Moshe Y Vardi

We present the Temporal Logic Synthesis Format (TLSF), a high-level format to describe synthesis problems via Linear Temporal Logic (LTL). The format builds upon standard LTL, but additionally allows to use high-level constructs, such as…

Logic in Computer Science · Computer Science 2016-11-24 Swen Jacobs , Felix Klein , Sebastian Schirmer

Reactive synthesis is an automated procedure to obtain a correct-by-construction reactive system from a given specification. GR(1) is a well-known fragment of linear temporal logic (LTL) where synthesis is possible using a polynomial…

Software Engineering · Computer Science 2016-02-04 Shahar Maoz , Jan Oliver Ringert

How do LLMs compare with symbolic tools on program synthesis tasks? We investigate this question on several synthesis domains: LTL reactive synthesis, syntax-guided synthesis, distributed protocol synthesis, and recursive function…

Programming Languages · Computer Science 2026-03-24 Derek Egolf , Yuhao Zhou , Stavros Tripakis

Reactive synthesis addresses the problem of generating a controller for a temporal specification in an adversarial environment; it was typically studied for LTL. Driven by applications ranging from AI to business process management, LTL…

Logic in Computer Science · Computer Science 2025-08-26 Sarah Winkler

We develop team semantics for Linear Temporal Logic (LTL) to express hyperproperties, which have recently been identified as a key concept in the verification of information flow properties. Conceptually, we consider an asynchronous and a…

Logic in Computer Science · Computer Science 2018-06-26 Andreas Krebs , Arne Meier , Jonni Virtema , Martin Zimmermann

The idea of automatic synthesis of reactive programs starting from temporal logic (LTL) specifications is quite old, but was commonly thought to be infeasible due to the known double exponential complexity of the problem. However, new ideas…

Logic in Computer Science · Computer Science 2011-02-22 Andreas Morgenstern , Klaus Schneider

We present an analysis technique for temporal specifications of reactive systems that identifies, on the level of individual system outputs over time, which parts of the implementation are determined by the specification, and which parts…

Formal Languages and Automata Theory · Computer Science 2018-03-28 Bernd Finkbeiner , Hazem Torfah

We present the Temporal Logic Synthesis Format (TLSF), a high-level format to describe synthesis problems via Linear Temporal Logic (LTL). The format builds upon standard LTL, but additionally allows to use high level constructs, such as…

Logic in Computer Science · Computer Science 2016-01-21 Swen Jacobs , Felix Klein

Given a specification of linear-time temporal logic interpreted over finite traces (LTLf), the reactive synthesis problem asks to find a finitely-representable, terminating controller that reacts to the uncontrollable actions of an…

Formal Languages and Automata Theory · Computer Science 2022-12-22 Luca Geatti , Marco Montali , Andrey Rivkin