English
Related papers

Related papers: Rational Synthesis

200 papers

We introduce the problem of temporal coverability for realizability and synthesis. Namely, given a language of words that must be covered by a produced system, how to automatically produce such a system. We consider the case of coverability…

Logic in Computer Science · Computer Science 2018-04-11 Krishnendu Chatterjee , Nir Piterman

Intelligent physical systems as embodied cognitive systems must perform high-level reasoning while concurrently managing an underlying control architecture. The link between cognition and control must manage the problem of converting…

This paper is an original attempt to understand the foundations of economic reasoning. It endeavors to rigorously define the relationship between subjective interpretations and objective valuations of such interpretations in the context of…

Logic in Computer Science · Computer Science 2024-05-20 Daniel Lu

In multiagent systems autonomous agents interact with each other to achieve individual and collective goals. Typical interactions concern negotiation and agreement on resource exchanges. Modeling and formalizing these agreements pose…

Logic in Computer Science · Computer Science 2024-08-20 Lorenzo Ceragioli , Pierpaolo Degano , Letterio Galletta , Luca Viganò

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

The focus of this paper is to propose a driver model that incorporates human reasoning levels as actions during interactions with other drivers. Different from earlier work using game theoretical human reasoning levels, we propose a dynamic…

Multiagent Systems · Computer Science 2021-01-19 Cevahir Köprülü , Yıldıray Yıldız

We extend the quantitative synthesis framework by going beyond the worst-case. On the one hand, classical analysis of two-player games involves an adversary (modeling the environment of the system) which is purely antagonistic and asks for…

Computer Science and Game Theory · Computer Science 2015-11-02 Véronique Bruyère , Emmanuel Filiot , Mickael Randour , Jean-François Raskin

Two-player games are a fruitful way to represent and reason about several important synthesis tasks. These tasks include controller synthesis (where one asks for a controller for a given plant such that the controlled plant satisfies a…

Logic in Computer Science · Computer Science 2023-08-22 Stanly Samuel , Deepak D'Souza , Raghavan Komondoor

In the formal approach to reactive controller synthesis, a symbolic controller for a possibly hybrid system is obtained by algorithmically computing a winning strategy in a two-player game. Such game-solving algorithms scale poorly as the…

Systems and Control · Computer Science 2016-02-16 Anne-Kathrin Schmuck , Rupak Majumdar

Many learning algorithms are known to converge to an equilibrium for specific classes of games if the same learning algorithm is adopted by all agents. However, when the agents are self-interested, a natural question is whether agents have…

Computer Science and Game Theory · Computer Science 2024-02-15 Shivam Bajaj , Pranoy Das , Yevgeniy Vorobeychik , Vijay Gupta

Contract automata allow to formally define the behaviour of service contracts in terms of service offers and requests, some of which are moreover optional and some of which are necessary. A composition of contracts is said to be in…

Formal Languages and Automata Theory · Computer Science 2023-08-24 Davide Basile , Maurice H. ter Beek

In the classical synthesis problem, we are given an LTL formula psi over sets of input and output signals, and we synthesize a transducer that realizes psi. One weakness of automated synthesis in practice is that it pays no attention to the…

Logic in Computer Science · Computer Science 2016-08-24 Shaull Almagor , Orna Kupferman

A reinforcement learning algorithm accomplishes the task of synthesizing a set-theoretical formula that evaluates to given truth values for given assignments.

Artificial Intelligence · Computer Science 2019-12-04 Chad E. Brown , Thibault Gauthier

Many safety-critical systems must achieve high-level task specifications with guaranteed safety and correctness. Much recent progress towards this goal has been made through controller synthesis from temporal logic specifications. Existing…

Systems and Control · Electrical Eng. & Systems 2020-09-15 Rafael Rodrigues da Silva , Vince Kurtz , Hai Lin

We address the problem of synthesizing reactive controllers for cyber-physical systems subject to Signal Temporal Logic (STL) specifications in the presence of adversarial inputs. Given a finite horizon, we define a reactive hierarchy of…

Synthesis of bulletproof strategies in imperfect information scenarios is a notoriously hard problem. In this paper, we suggest that it is sometimes a viable alternative to aim at "reasonably good" strategies instead. This makes sense not…

Multiagent Systems · Computer Science 2023-10-26 Wojciech Jamroga , Damian Kurpiewski

A question we can ask of multi-agent systems is whether the agents' collective interaction satisfies particular goals or specifications, which can be either individual or collective. When a collaborative goal is not reached, or a…

Logic in Computer Science · Computer Science 2023-09-27 Karam Kharraz , Shaun Azzopardi , Gerardo Schneider , Martin Leucker

In the study of reactive systems, qualitative properties are usually easier to model and analyze than quantitative properties. This is especially true in systems where mutually beneficial cooperation between agents is possible, such as…

Computer Science and Game Theory · Computer Science 2023-05-18 Senthil Rajasekaran , Suguman Bansal , Moshe Y. Vardi

In game theory, mechanism design is concerned with the design of incentives so that a desired outcome of the game can be achieved. In this paper, we study the design of incentives so that a desirable equilibrium is obtained, for instance,…

Computer Science and Game Theory · Computer Science 2021-06-21 Julian Gutierrez , Muhammad Najib , Giuseppe Perelli , Michael Wooldridge

We consider turn-based game arenas for which we investigate uniformity properties of strategies. These properties involve bundles of plays, that arise from some semantical motive. Typically, we can represent constraints on allowed…

Computer Science and Game Theory · Computer Science 2012-12-04 Bastien Maubert , Sophie Pinchinat