English
Related papers

Related papers: A Compositional Framework for On-the-Fly LTLf Synt…

200 papers

In this paper we introduce a class of Linear Temporal Logic (LTL) specifications for which the problem of synthesizing controllers can be solved in polynomial time. The new class of specifications is an LTL fragment that we term Mode-Target…

Optimization and Control · Mathematics 2016-12-20 Ayca Balkan , Moshe Vardi , Paulo Tabuada

Synthesising autonomous agents that can navigate uncertain environments while adhering to complex temporal constraints remains a fundamental challenge. While Linear Temporal Logic (LTL) provides a rigorous language for specifying such…

Logic in Computer Science · Computer Science 2026-05-18 Can Zhou , Yulong Gao , Pian Yu

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

Program synthesis from input-output examples, also called programming by example (PBE), has had tremendous impact on automating end-user tasks. Large language models (LLMs) have the ability to solve PBE tasks by generating code in different…

Programming Languages · Computer Science 2025-03-21 Ruhma Khan , Sumit Gulwani , Vu Le , Arjun Radhakrishna , Ashish Tiwari , Gust Verbruggen

The target duration of a synthesized human motion is a critical attribute that requires modeling control over the motion dynamics and style. Speeding up an action performance is not merely fast-forwarding it. However, state-of-the-art…

Computer Vision and Pattern Recognition · Computer Science 2024-07-17 Alessio Sampieri , Alessio Palma , Indro Spinelli , Fabio Galasso

How to usefully encode compositional task structure has long been a core challenge in AI. Recent work in chain of thought prompting has shown that for very large neural language models (LMs), explicitly demonstrating the inferential steps…

Computation and Language · Computer Science 2022-10-25 Victor S. Bursztyn , David Demeter , Doug Downey , Larry Birnbaum

Despite many recent advances, reactive synthesis is still not really a practical technique. The grand challenge is to scale from small transition systems, where synthesis performs well, to complex multi-component designs. Compositional…

Logic in Computer Science · Computer Science 2020-10-09 Bernd Finkbeiner , Noemi Passing

Syntactic obligations are a fragment of LTL formulas that translate to deterministic weak $\omega$-automata (DWA). We show that syntactic obligations can be very efficiently converted to minimal DWA represented using multi-terminal binary…

Formal Languages and Automata Theory · Computer Science 2026-05-13 Alexandre Duret-Lutz , Giuseppe De Giacomo , Marcin Jurdzinski , Nir Piterman , Moshe Y. Vardi , Shufang Zhu

Reactive synthesis builds a system from a specification given as a temporal logic formula. Traditionally, reactive synthesis is defined for systems with Boolean input and output variables. Recently, new theories and techniques have been…

Logic in Computer Science · Computer Science 2021-08-03 Benedikt Maderbacher , Roderick Bloem

Automatic melody-to-lyric (M2L) generation aims to create lyrics that align with a given melody. While most previous approaches generate lyrics from scratch, revision, editing plain text draft to fit it into the melody, offers a much more…

Computation and Language · Computer Science 2025-05-05 Songyan Zhao , Bingxuan Li , Yufei Tian , Nanyun Peng

We study the problem of control synthesis for multi-agent systems, to achieve complex, high-level, long-term goals that are assigned to each agent individually. As the agents might not be capable of satisfying their respective goals by…

Robotics · Computer Science 2014-03-18 Jana Tumova , Dimos V. Dimarogonas

We present a novel and efficient method for synthesis of parameterized distributed protocols by sketching. Our method is both syntax-guided and counterexample-guided, and utilizes a fast equivalence reduction technique that enables…

Logic in Computer Science · Computer Science 2024-05-14 Derek Egolf , William Schultz , Stavros Tripakis

Finite turn-based safety games have been used for very different problems such as the synthesis of linear temporal logic (LTL), the synthesis of schedulers for computer systems running on multiprocessor platforms, and also for the…

Logic in Computer Science · Computer Science 2014-05-08 Gilles Geeraerts , Joël Goossens , Amélie Stainer

Recently, several algorithms have been proposed for decomposing reactive synthesis specifications into independent and simpler sub-specifications. Being inspired by one of the approaches, developed by Antonio Iannopollo (2018), who designed…

Logic in Computer Science · Computer Science 2023-09-01 Josu Oca , Montserrat Hermo , Alexander Bolotov

This paper studies the controller synthesis problem for Linear Temporal Logic (LTL) specifications using (constrained) zonotope techniques. First, we implement (constrained) zonotope techniques to partition the state space and further to…

Systems and Control · Electrical Eng. & Systems 2021-11-16 Wei Ren , Julien Calbert , Raphael Jungers

Synthesizing a reactive system from specifications given in linear temporal logic (LTL) is a classical problem, finding its applications in safety-critical systems design. These systems are typically represented using either Mealy machines…

Artificial Intelligence · Computer Science 2026-04-28 Jan Křetínský , Tobias Meggendorfer , Maximilian Prokop

In this report, we will define a new approach to the problem of non deterministic planning for extended temporal goals. In particular, we will give a solution to this problem reducing it to a fully observable non deterministic (FOND)…

Artificial Intelligence · Computer Science 2020-04-16 Francesco Fuggitti

We introduce a tableau decision method for deciding realizability of specifications expressed in a safety fragment of LTL that includes bounded future temporal operators. Tableau decision procedures for temporal and modal logics have been…

Logic in Computer Science · Computer Science 2022-06-06 Montserrat Hermo , Paqui Lucio , César Sánchez

Context: Linear temporal logic (LTL) model checking faces a significant challenge known as the state-explosion problem. The on-the-fly method is a solution that constructs and checks the state space simultaneously, avoiding generating all…

Logic in Computer Science · Computer Science 2024-06-13 Shuo Li , Liao Zheng , Ru Yang , Zhijun Ding

We present an approach to automatically synthesize synchronized models from lightweight formal specifications. Our approach takes as input a specification of a distributed system along with a global linear time constraint, which must be…

Software Engineering · Computer Science 2025-02-20 Pablo F. Castro , Luciano Putruele , Renzo Degiovanni , Nazareno Aguirre