English
Related papers

Related papers: LTLf Synthesis Under Environment Specifications fo…

200 papers

In synthesis, assumptions are constraints on the environment that rule out certain environment behaviors. A key observation here is that even if we consider systems with LTLf goals on finite traces, environment assumptions need to be…

Artificial Intelligence · Computer Science 2019-12-18 Shufang Zhu , Giuseppe De Giacomo , Geguang Pu , Moshe Vardi

While most of the current synthesis algorithms only focus on correctness-by-construction, ensuring robustness has remained a challenge. Hence, in this paper, we address the robust-by-construction synthesis problem by considering the…

Logic in Computer Science · Computer Science 2024-01-23 Satya Prakash Nayak , Daniel Neider , Martin Zimmermann

LTL synthesis is the problem of synthesizing a reactive system from a formal specification in Linear Temporal Logic. The extension of allowing for partial observability, where the system does not have direct access to all relevant…

Logic in Computer Science · Computer Science 2020-09-24 Lucas M. Tabajara , 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

Strategy synthesis typically follows an all-or-nothing paradigm, returning unrealisable whenever a specification cannot be guaranteed in an uncertain environment. In this paper, we introduce optimal LTLf synthesis, where the goal is to…

Artificial Intelligence · Computer Science 2026-05-28 Yujian Cao , Sven Schewe , Qiyi Tang , Shufang Zhu

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

We study a variant of LTLf synthesis that synthesizes adaptive strategies for achieving a multi-tier goal, consisting of multiple increasingly challenging LTLf objectives in nondeterministic planning domains. Adaptive strategies are…

Artificial Intelligence · Computer Science 2025-04-30 Giuseppe De Giacomo , Gianmarco Parretti , Shufang Zhu

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

We study LTLf synthesis with multiple properties, where satisfying all properties may be impossible. Instead of enumerating subsets of properties, we compute in one fixed-point computation the relation between product-game states and the…

Artificial Intelligence · Computer Science 2026-01-16 Christoph Weinhuber , Yannik Schnitzer , Alessandro Abate , David Parker , Giuseppe De Giacomo , Moshe Y. Vardi

A challenging problem for autonomous systems is to synthesize a reactive controller that conforms to a set of given correctness properties. Linear temporal logic (LTL) provides a formal language to specify the desired behavioral properties…

Formal Languages and Automata Theory · Computer Science 2019-10-08 Rayna Dimitrova , Mahsa Ghasemi , Ufuk Topcu

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

The unrealizability of a specification is often due to the assumption that the behavior of the environment is unrestricted. In this paper, we present algorithms for synthesis in bounded environments, where the environment can only generate…

Logic in Computer Science · Computer Science 2021-01-01 Rayna Dimitrova , Bernd Finkbeiner , Hazem Torfah

Ensuring that agents satisfy safety specifications can be crucial in safety-critical environments. While methods exist for controller synthesis with safe temporal specifications, most existing methods restrict safe temporal specifications…

Logic in Computer Science · Computer Science 2025-11-21 Gaspard Ohlmann , Edwin Hamel-De le Court , Francesco Belardinelli

We study the problem of realizing strategies for an LTLf goal specification while ensuring that at least an LTLf backup specification is satisfied in case of unreliability of certain input variables. We formally define the problem and…

Artificial Intelligence · Computer Science 2024-12-20 Christian Hagemeier , Giuseppe de Giacomo , Moshe Y. Vardi

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 investigate the problem of controller synthesis for hyperproperties specified in the temporal logic HyperLTL. Hyperproperties are system properties that relate multiple execution traces. Hyperproperties can elegantly express…

Logic in Computer Science · Computer Science 2021-01-25 Borzoo Bonakdarpour , Bernd Finkbeiner

Automatic synthesis from temporal logic specifications is an attractive alternative to manual system design, due to its ability to generate correct-by-construction implementations from high-level specifications. Due to the high complexity…

Logic in Computer Science · Computer Science 2023-01-25 Philippe Heim , Rayna Dimitrova

In this paper, we study incremental LTLf synthesis -- a form of reactive synthesis where the goals are given incrementally while in execution. In other words, the protagonist agent is already executing a strategy for a certain goal when it…

Artificial Intelligence · Computer Science 2026-03-03 Giuseppe De Giacomo , Yves Lespérance , Gianmarco Parretti , Fabio Patrizi , Moshe Y. Vardi

The classical LTL synthesis problem is purely qualitative: the given LTL specification is realized or not by a reactive system. LTL is not expressive enough to formalize the correctness of reactive systems with respect to some quantitative…

Logic in Computer Science · Computer Science 2013-01-10 Aaron Bohy , Véronique Bruyère , Emmanuel Filiot , Jean-François Raskin
‹ Prev 1 2 3 10 Next ›