Measuring and Synthesizing Systems in Probabilistic Environments

Author:

Chatterjee Krishnendu1,Henzinger Thomas A.1,Jobstmann Barbara2,Singh Rohit3

Affiliation:

1. Institute of Science and Technology Austria (IST Austria), Klosterneuburg, Austria

2. École Polytechnique Fédéral de Lausanne (EPFL), Gieres, France

3. Massachusetts Institute of Technology (MIT), Cambridge, MA

Abstract

The traditional synthesis question given a specification asks for the automatic construction of a system that satisfies the specification, whereas often there exists a preference order among the different systems that satisfy the given specification. Under a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which assigns to each word a value, such that a system is preferred if it generates a higher expected value. We solve the following optimal synthesis problem: given an omega-regular specification, a Markov chain that describes the distribution of inputs, and a weighted automaton that measures how well a system satisfies the given specification under the input assumption, synthesize a system that optimizes the measured value. For safety specifications and quantitative measures that are defined by mean-payoff automata, the optimal synthesis problem reduces to finding a strategy in a Markov decision process (MDP) that is optimal for a long-run average reward objective, which can be achieved in polynomial time. For general omega-regular specifications along with mean-payoff automata, the solution rests on a new, polynomial-time algorithm for computing optimal strategies in MDPs with mean-payoff parity objectives. Our algorithm constructs optimal strategies that consist of two memoryless strategies and a counter. The counter is in general not bounded. To obtain a finite-state system, we show how to construct an ϵ-optimal strategy with a bounded counter, for all ϵ > 0. Furthermore, we show how to decide in polynomial time if it is possible to construct an optimal finite-state system (i.e., a system without a counter) for a given specification. We have implemented our approach and the underlying algorithms in a tool that takes qualitative and quantitative specifications and automatically constructs a system that satisfies the qualitative specification and optimizes the quantitative specification, if such a system exists. We present some experimental results showing optimal systems that were automatically generated in this way.

Funder

ERC Start

Austrian Science Fund (FWF) project S11402-N23 (RiSE), FWF

FWF NFN

European Research Council (ERC)

Microsoft faculty fellows award

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference58 articles.

1. On Omega-Languages Defined by Mean-Payoff Conditions

2. Lecture Notes in Computer Science;Bianco A.

Cited by 12 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Symbolic Time and Space Tradeoffs for Probabilistic Verification;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29

2. QUANTITATIVE AUTOMATA UNDER PROBABILISTIC SEMANTICS;LOG METH COMPUT SCI;2019

3. Strategy Representation by Decision Trees with Linear Classifiers;Quantitative Evaluation of Systems;2019

4. From verification to synthesis under cost-utility constraints;ACM SIGLOG News;2018-11-12

5. The Complexity of Mean-Payoff Pushdown Games;Journal of the ACM;2017-10-15

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3