English
Related papers

Related papers: Incremental LTLf 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

The success of Large Language Models (LLMs) is inherently linked to the availability of vast, diverse, and high-quality data for training and evaluation. However, the growth rate of high-quality data is significantly outpaced by the…

Computation and Language · Computer Science 2024-10-18 Ke Wang , Jiahui Zhu , Minjie Ren , Zeming Liu , Shiwei Li , Zongye Zhang , Chenkai Zhang , Xiaoyu Wu , Qiqi Zhan , Qingjie Liu , Yunhong Wang

Reactive synthesis from high-level specifications that combine hard constraints expressed in Linear Temporal Logic LTL with soft constraints expressed by discounted-sum (DS) rewards has applications in planning and reinforcement learning.…

Artificial Intelligence · Computer Science 2022-05-24 Suguman Bansal , Lydia Kavraki , Moshe Y. Vardi , Andrew Wells

Developing critical components, such as mission controllers or embedded systems, is a challenging task. Reactive synthesis is a technique to automatically produce correct controllers. Given a high-level specification written in LTL,…

Logic in Computer Science · Computer Science 2023-12-15 Matías Brizzio , César Sánchez

We introduce LTLf+ and PPLTL+, two logics to express properties of infinite traces, that are based on the linear-time temporal logics LTLf and PPLTL on finite traces. LTLf+/PPLTL+ use levels of Manna and Pnueli's LTL safety-progress…

Logic in Computer Science · Computer Science 2024-11-15 Benjamin Aminof , Giuseppe De Giacomo , Sasha Rubin , Moshe Y. Vardi

In Reasoning about Action and Planning, one synthesizes the agent plan by taking advantage of the assumption on how the environment works (that is, one exploits the environment's effects, its fairness, its trajectory constraints). In this…

Logic in Computer Science · Computer Science 2019-05-23 Benjamin Aminof , Giuseppe De Giacomo , Aniello Murano , Sasha Rubin

This letter presents an incremental text-to-speech (TTS) method that performs synthesis in small linguistic units while maintaining the naturalness of output speech. Incremental TTS is generally subject to a trade-off between latency and…

Sound · Computer Science 2021-05-26 Takaaki Saeki , Shinnosuke Takamichi , Hiroshi Saruwatari

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

This paper presents an incremental replanning algorithm, dubbed LTL-D*, for temporal-logic-based task planning in a dynamically changing environment. Unexpected changes in the environment may lead to failures in satisfying a task…

Robotics · Computer Science 2024-04-02 Jiming Ren , Haris Miller , Karen M. Feigh , Samuel Coogan , Ye Zhao

A modern approach to engineering correct-by-construction systems is to synthesize them automatically from formal specifications. Oftentimes, a system can only satisfy its guarantees if certain environment assumptions hold, which motivates…

Logic in Computer Science · Computer Science 2015-07-10 Roderick Bloem , Ruediger Ehlers , Robert Koenighofer

Synthesis is the automatic construction of a system from its specification. In classical synthesis algorithms it is always assumed that the system is "constructed from scratch" rather than composed from reusable components. This, of course,…

Logic in Computer Science · Computer Science 2011-11-10 Yoad Lustig , Moshe Vardi

Most algorithms for the synthesis of reactive systems focus on the construction of finite-state machines rather than actual programs. This often leads to badly structured, unreadable code. In this paper, we present a bounded synthesis…

Formal Languages and Automata Theory · Computer Science 2018-07-25 Carsten Gerstacker , Felix Klein , Bernd Finkbeiner

Reactive synthesis is an automatic way to translate a human intention expressed in some logic into a system of some kind. This thesis has two parts, devoted to logic and to systems. In Part I, we develop two new approaches to CTL*…

Logic in Computer Science · Computer Science 2018-08-29 Ayrat Khalimov

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á

Synthesis is the automated construction of a system from its specification. The system has to satisfy its specification in all possible environments. Modern systems often interact with other systems, or agents. Many times these agents have…

Logic in Computer Science · Computer Science 2009-07-20 Dana Fisman , Orna Kupferman , Yoad Lustig

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…

Logic in Computer Science · Computer Science 2026-04-15 Swen Jacobs , Guillermo A. Perez , Philipp Schlehuber-Caissier

We propose the problem of multi-agent path planning for a generalization of the classic Cops and Robbers game via reactive synthesis. Specifically, through the application of LTLt and Coordination Synthesis, we aim to check whether various…

Logic in Computer Science · Computer Science 2025-03-17 William Fishell , Andoni Rodriguez , Mark Santolucito

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

In this paper, we study LTLf synthesis under environment specifications for arbitrary reachability and safety properties. We consider both kinds of properties for both agent tasks and environment specifications, providing a complete…

Logic in Computer Science · Computer Science 2023-08-30 Benjamin Aminof , Giuseppe De Giacomo , Antonio Di Stasio , Hugo Francon , Sasha Rubin , Shufang Zhu

We introduce a technique for synthesis of control and communication strategies for a team of agents from a global task specification given as a Linear Temporal Logic (LTL) formula over a set of properties that can be satisfied by the…

Robotics · Computer Science 2011-11-10 Yushan Chen , Xu Chu Ding , Calin Belta