English
Related papers

Related papers: Expectations or Guarantees? I Want It All! A cross…

200 papers

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

The beyond worst-case synthesis problem was introduced recently by Bruy\`ere et al. [BFRR14]: it aims at building system controllers that provide strict worst-case performance guarantees against an antagonistic environment while ensuring…

Logic in Computer Science · Computer Science 2017-04-28 Raphaël Berthon , Mickael Randour , Jean-François Raskin

We consider controller synthesis for stochastic and partially unknown environments in which safety is essential. Specifically, we abstract the problem as a Markov decision process in which the expected performance is measured using a cost…

Software Engineering · Computer Science 2015-10-21 Sebastian Junges , Nils Jansen , Christian Dehnert , Ufuk Topcu , Joost-Pieter Katoen

A central task in control theory, artificial intelligence, and formal methods is to synthesize reward-maximizing strategies for agents that operate in partially unknown environments. In environments modeled by gray-box Markov decision…

Machine Learning · Computer Science 2023-04-25 Christel Baier , Clemens Dubslaff , Patrick Wienhöft , Stefan J. Kiebel

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

Most specification languages express only qualitative constraints. However, among two implementations that satisfy a given specification, one may be preferred to another. For example, if a specification asks that every request is followed…

Logic in Computer Science · Computer Science 2013-05-29 Roderick Bloem , Krishnendu Chatterjee , Thomas A. Henzinger , Barbara Jobstmann

We consider qualitative strategy synthesis for the formalism called consumption Markov decision processes. This formalism can model dynamics of an agents that operates under resource constraints in a stochastic environment. The presented…

Artificial Intelligence · Computer Science 2021-05-06 František Blahoudek , Petr Novotný , Melkior Ornik , Pranay Thangeda , Ufuk Topcu

We study synthesis problems with constraints in partially observable Markov decision processes (POMDPs), where the objective is to compute a strategy for an agent that is guaranteed to satisfy certain safety and performance specifications.…

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

Multi-dimensional mean-payoff and energy games provide the mathematical foundation for the quantitative study of reactive systems, and play a central role in the emerging quantitative theory of verification and synthesis. In this work, we…

Computer Science and Game Theory · Computer Science 2014-11-04 Krishnendu Chatterjee , Mickael Randour , Jean-François Raskin

In typical reinforcement learning (RL), the environment is assumed given and the goal of the learning is to identify an optimal policy for the agent taking actions through its interactions with the environment. In this paper, we extend this…

Artificial Intelligence · Computer Science 2019-10-25 Haifeng Zhang , Jun Wang , Zhiming Zhou , Weinan Zhang , Ying Wen , Yong Yu , Wenxin Li

Markov decision processes (MDPs) are a popular model for performance analysis and optimization of stochastic systems. The parameters of stochastic behavior of MDPs are estimates from empirical observations of a system; their values are not…

Artificial Intelligence · Computer Science 2017-10-26 Dimitri Scheftelowitsch , Peter Buchholz , Vahid Hashemi , Holger Hermanns

The planning domain has experienced increased interest in the formal synthesis of decision-making policies. This formal synthesis typically entails finding a policy which satisfies formal specifications in the form of some well-defined…

Artificial Intelligence · Computer Science 2021-11-30 George K. Atia , Andre Beckus , Ismail Alkhouri , Alvaro Velasquez

Consumption Markov Decision Processes (CMDPs) are probabilistic decision-making models of resource-constrained systems. In a CMDP, the controller possesses a certain amount of a critical resource, such as electric power. Each action of the…

Formal Languages and Automata Theory · Computer Science 2020-05-18 František Blahoudek , Tomáš Brázdil , Petr Novotný , Melkior Ornik , Pranay Thangeda , Ufuk Topcu

The long-run average payoff per transition (mean payoff) is the main tool for specifying the performance and dependability properties of discrete systems. The problem of constructing a controller (strategy) simultaneously optimizing several…

Artificial Intelligence · Computer Science 2024-12-19 David Klaška , Antonín Kučera , Vojtěch Kůr , Vít Musil , Vojtěch Řehák

We present an approach for systematically anticipating the actions and policies employed by \emph{oblivious} environments in concurrent stochastic games, while maximizing a reward function. Our main contribution lies in the synthesis of a…

Artificial Intelligence · Computer Science 2024-09-19 Shadi Tasdighi Kalat , Sriram Sankaranarayanan , Ashutosh Trivedi

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

Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which…

Logic in Computer Science · Computer Science 2011-04-15 Krishnendu Chatterjee , Thomas A. Henzinger , Barbara Jobstmann , Rohit Singh

Complex real-world applications of cyber-physical systems give rise to the need for multi-objective controller synthesis, which concerns the problem of computing an optimal controller subject to multiple (possibly conflicting) criteria. The…

Artificial Intelligence · Computer Science 2022-03-04 Shenghui Chen , Kayla Boggess , David Parker , Lu Feng
‹ Prev 1 2 3 10 Next ›