English
Related papers

Related papers: Assume-Admissible Synthesis

200 papers

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

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 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

In this paper, we study the notion of admissibility for randomised strategies in concurrent games. Intuitively, an admissible strategy is one where the player plays `as well as possible', because there is no other strategy that dominates…

Computer Science and Game Theory · Computer Science 2017-02-22 Nicolas Basset , Gilles Geeraerts , Jean-François Raskin , Ocan Sankur

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

Reactive synthesis is a technology for the automatic construction of reactive systems from logical specifications. In these lecture notes, we study different algorithms for the reactive synthesis problem of linear-time temporal logic (LTL).…

Logic in Computer Science · Computer Science 2018-03-28 Bernd Finkbeiner , Felix Klein

Many problems in reactive synthesis are stated using two formulas ---an environment assumption and a system guarantee--- and ask for an implementation that satisfies the guarantee in environments that satisfy their assumption. Reactive…

Logic in Computer Science · Computer Science 2019-02-18 Rupak Majumdar , Nir Piterman , Anne-Kathrin Schmuck

In this paper, a new non-search based synthesis algorithm for reversible circuits is proposed. Compared with the widely used search-based methods, our algorithm is guarantied to produce a result and can lead to a solution with much fewer…

Quantum Physics · Physics 2010-04-12 Mehdi Saeedi , Mehdi Sedighi , Morteza Saheb Zamani

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

We propose novel controller synthesis techniques for probabilistic systems modelled using stochastic two-player games: one player acts as a controller, the second represents its environment, and probability is used to capture uncertainty…

Logic in Computer Science · Computer Science 2017-01-11 Klaus Drager , Vojtech Forejt , Marta Kwiatkowska , David Parker , Mateusz Ujma

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

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

Shield synthesis is an approach to enforce a set of safety-critical properties of a reactive system at runtime. A shield monitors the system and corrects any erroneous output values instantaneously. The shield deviates from the given…

Logic in Computer Science · Computer Science 2019-04-16 Laura Humphrey , Bettina Könighofer , Robert Könighofer , Ufuk Topcu

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

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

The increased interest in reactive synthesis over the last decade has led to many improved solutions but also to many new questions. In this paper, we discuss the question of how to deal with assumptions on environment behavior. We present…

Logic in Computer Science · Computer Science 2014-07-22 Roderick Bloem , Rüdiger Ehlers , Swen Jacobs , Robert Könighofer

Agents care not only about the outcomes of collective decisions but also about how decisions are made. In many cases, both the outcome and the procedure affect whether agents see a decision as legitimate, justifiable, or acceptable. We…

Computer Science and Game Theory · Computer Science 2023-10-12 Ben Abramowitz , Nicholas Mattei

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…

Logic in Computer Science · Computer Science 2015-07-01 Sumit Nain , Yoad Lustig , Moshe Y Vardi

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

While deep learning approaches to information extraction have had many successes, they can be difficult to augment or maintain as needs shift. Rule-based methods, on the other hand, can be more easily modified. However, crafting rules…

Computation and Language · Computer Science 2022-02-02 Robert Vacareanu , Marco A. Valenzuela-Escarcega , George C. G. Barbosa , Rebecca Sharp , Mihai Surdeanu
‹ Prev 1 2 3 10 Next ›