English
Related papers

Related papers: Synthesizing Dominant Strategies for Liveness (Ful…

200 papers

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

We compare games under delayed control and delay games, two types of infinite games modelling asynchronicity in reactive synthesis. In games under delayed control both players suffer from partial informedness due to symmetrically delayed…

Computer Science and Game Theory · Computer Science 2025-03-19 Martin Fränzle , Paul Kröger , Sarah Winter , Martin Zimmermann

A fundamental question in system design is to decide how much of the design of one component must be known in order to successfully design another component of the system. We study this question in the setting of reactive synthesis, where…

Logic in Computer Science · Computer Science 2016-11-24 Werner Damm , Bernd Finkbeiner , Astrid Rakow

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

Reactive synthesis is a framework for modeling and automatically synthesizing strategies in robotics, typically through computing a \emph{winning} strategy in a 2-player game between the robot and the environment. Winning strategies,…

Robotics · Computer Science 2024-10-14 Karan Muvvala , Morteza Lahijanian

We compare games under delayed control and delay games, two types of infinite games modelling asynchronicity in reactive synthesis. Our main result, the interreducibility of the existence of sure winning strategies for the protagonist,…

Computer Science and Game Theory · Computer Science 2023-10-03 Martin Fränzle , Sarah Winter , Martin Zimmermann

Reactive synthesis transforms a specification of a reactive system, given in a temporal logic, into an implementation. The main advantage of synthesis is that it is automatic. The main disadvantage is that the implementation is usually very…

Logic in Computer Science · Computer Science 2021-01-01 Tom Baumeister , Bernd Finkbeiner , Hazem Torfah

Reactive synthesis is a paradigm for automatically building correct-by-construction systems that interact with an unknown or adversarial environment. We study how to do reactive synthesis when part of the specification of the system is that…

Logic in Computer Science · Computer Science 2018-04-23 Daniel J. Fremont , Sanjit A. Seshia

Reactive synthesis is the task of automatically deriving a correct implementation from a specification. It is a promising technique for the development of verified programs and hardware. Despite recent advances in terms of algorithms and…

Logic in Computer Science · Computer Science 2021-12-17 Bernd Finkbeiner , Gideon Geier , Noemi Passing

The aim of this work is to address issues where formal specifications cannot be realized on a given dynamical system subjected to a changing environment. Such failures occur whenever the dynamics of the system restrict the robot in such a…

Controller synthesis is the process of constructing a correct system automatically from its specification. This often requires assumptions about the behaviour of the environment. It is difficult for the designer to identify the assumptions…

Logic in Computer Science · Computer Science 2016-04-13 Romain Brenguier

In formal synthesis of reactive systems an implementation of a system is automatically constructed from its formal specification. The great advantage of synthesis is that the resulting implementation is correct by construction; therefore…

Logic in Computer Science · Computer Science 2019-01-04 Hadas Kress-Gazit , Hazem Torfah

This paper introduces a sampling-based strategy synthesis algorithm for nondeterministic hybrid systems with complex continuous dynamics under temporal and reachability constraints. We model the evolution of the hybrid system as a…

Systems and Control · Electrical Eng. & Systems 2023-12-27 Qi Heng Ho , Zachary N. Sunberg , Morteza Lahijanian

Reactive synthesis is a class of methods to construct a provably-correct control system, referred to as a robot, with respect to a temporal logic specification in the presence of a dynamic and uncontrollable environment. This is achieved by…

Formal Languages and Automata Theory · Computer Science 2020-04-24 Abhishek N. Kulkarni , Jie Fu

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

Classical reactive synthesis approaches aim to synthesize a reactive system that always satisfies a given specifications. These approaches often reduce to playing a two-player zero-sum game where the goal is to synthesize a winning…

Computer Science and Game Theory · Computer Science 2025-06-09 Karan Muvvala , Qi Heng Ho , Morteza Lahijanian

Reactive computer systems bear inherent complexity due to continuous interactions with their environment. While this environment often proves to be uncontrollable, we still want to ensure that critical computer systems will not fail, no…

Computer Science and Game Theory · Computer Science 2012-10-19 Mickael Randour

Specifications for reactive systems often consist of environment assumptions and system guarantees. An implementation should not only be correct, but also robust in the sense that it behaves reasonably even when the assumptions are…

Logic in Computer Science · Computer Science 2012-07-06 Roderick Bloem , Hans-Jürgen Gamauf , Georg Hofferek , Bettina Könighofer , Robert Könighofer

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

In reactive synthesis, the goal is to automatically generate an implementation from a specification of the reactive and non-terminating input/output behaviours of a system. Specifications are usually modelled as logical formulae or automata…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Léo Exibard , Emmanuel Filiot , Pierre-Alain Reynier
‹ Prev 1 2 3 10 Next ›