English
Related papers

Related papers: Safraless Synthesis for Epistemic Temporal Specifi…

200 papers

In this paper, we study the composition of services so as to obtain runs satisfying a task specification in Linear Temporal Logic on finite traces (LTLf). We study the problem in the case services are nondeterministic and the LTLf…

Logic in Computer Science · Computer Science 2023-12-01 Giuseppe De Giacomo , Marco Favorito , Luciana Silo

This paper addresses the synthesis of reactive systems that enforce hard constraints while optimizing for quality-based soft constraints. We build on recent advancements in combining reactive synthesis with example-based guidance to handle…

Formal Languages and Automata Theory · Computer Science 2024-10-14 Jean-François Raskin , Yun Chen Tsai

Although it is widely accepted that every system should be robust, in the sense that "small" violations of environment assumptions should lead to "small" violations of system guarantees, it is less clear how to make this intuitive notion of…

Logic in Computer Science · Computer Science 2015-11-02 Paulo Tabuada , Daniel Neider

The synthesis problem asks for the automatic construction of a system from its specification. In the traditional setting, the system is "constructed from scratch" rather than composed from reusable components. However, this is rare in…

Logic in Computer Science · Computer Science 2015-02-18 Krishnendu Chatterjee , Laurent Doyen , Moshe Y. Vardi

This paper presents a framework for automatic synthesis of a control sequence for multi-agent systems governed by continuous linear dynamics under timed constraints. First, the motion of the agents in the workspace is abstracted into…

Systems and Control · Computer Science 2017-03-09 Sofie Andersson , Alexandros Nikou , Dimos V. Dimarogonas

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

Parametric timed automata extend timed automata (Alur and Dill, 1991) in that they allow the specification of parametric bounds on the clock values. Since their introduction in 1993 by Alur, Henzinger, and Vardi, it is known that the…

Logic in Computer Science · Computer Science 2014-04-02 Karin Quaas

This paper presents a novel method of synthesizing a fragment of a timed discrete event system(TDES),introducing a novel linear temporal logic(LTL), called ticked LTL$_f$. The ticked LTL$_f$ is given as an extension to LTL$_f$, where the…

Systems and Control · Electrical Eng. & Systems 2019-12-06 Takuma Kinugawa , Kazumune Hashimoto , Toshimitsu Ushio

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

This paper presents a fully automated procedure for controller synthesis for multi-agent systems under coupling constraints. Each agent is modeled with dynamics consisting of two terms: the first one models the coupling constraints and the…

Systems and Control · Computer Science 2017-10-17 Alexandros Nikou , Dimitris Boskos , Jana Tumova , Dimos V. Dimarogonas

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

Designing tests to evaluate if a given autonomous system satisfies complex specifications is challenging due to the complexity of these systems. This work proposes a flow-based approach for reactive test synthesis from temporal logic…

Formal Languages and Automata Theory · Computer Science 2024-04-16 Josefine B. Graebener , Apurva S. Badithela , Denizalp Goktas , Wyatt Ubellacker , Eric V. Mazumdar , Aaron D. Ames , Richard M. Murray

Synthesis of correct by design systems from specification has recently attracted much attention. The theoretical results imply that this problem is highly intractable, e.g., synthesizing a system is 2EXPTIME-complete for an LTL…

Formal Languages and Automata Theory · Computer Science 2012-05-07 John Fearnley , Doron Peled , Sven Schewe

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

This paper presents a fully automated procedure for controller synthesis for multi-agent systems under coupled constraints. Each agent has dynamics consisting of two terms: the first one models the coupled constraints and the other one is…

Systems and Control · Computer Science 2016-09-20 Alexandros Nikou , Dimitris Boskos , Jana Tumova , Dimos V. Dimarogonas

In recent years, Signal Temporal Logic (STL) has gained traction as a practical and expressive means of encoding control objectives for robotic and cyber-physical systems. The state-of-the-art in STL trajectory synthesis is to formulate the…

Robotics · Computer Science 2019-05-09 Vince Kurtz , Hai Lin

Controller synthesis for hybrid systems that satisfy temporal specifications expressing various system properties is a challenging problem that has drawn the attention of many researchers. However, making the assumption that such temporal…

Systems and Control · Computer Science 2015-10-27 Dorsa Sadigh , Ashish Kapoor

Synthesis techniques take realizable Linear Temporal Logic specifications and produce correct cir- cuits that implement the specifications. The generated circuits can be used directly, or as miters that check the correctness of a logic…

Formal Languages and Automata Theory · Computer Science 2014-01-16 Mohamad Noureddine , Fadi A. Zaraket , Ali S. Elzein

Separation Logic (SL) with inductive definitions is a natural formalism for specifying complex recursive data structures, used in compositional verification of programs manipulating such structures. The key ingredient of any automated…

Logic in Computer Science · Computer Science 2014-02-12 Radu Iosif , Adam Rogalewicz , Tomas Vojnar

I consider the following generic scenario: an abstract model M of some 'real' system is only partially presented, or partially known to us, and we have to ensure that the actual system satisfies a given specification, formalised in some…

Logic in Computer Science · Computer Science 2020-12-24 Valentin Goranko