2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)最新文献_第7页

Quantitative Automata under Probabilistic Semantics 概率语义下的定量自动机

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-04-22 DOI: 10.1145/2933575.2933588

K. Chatterjee, T. Henzinger, J. Otop

引用次数: 12

Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives* 具有广义平均收益目标的完全信息随机对策*

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-04-21 DOI: 10.1145/2933575.2934513

K. Chatterjee, L. Doyen

{"title":"Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives*","authors":"K. Chatterjee, L. Doyen","doi":"10.1145/2933575.2934513","DOIUrl":"https://doi.org/10.1145/2933575.2934513","url":null,"abstract":"Graph games provide the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic reactive processes, the traditional model is perfect-information stochastic games, where some transitions of the game graph are controlled by two adversarial players, and the other transitions are executed probabilistically. We consider such games where the objective is the conjunction of several quantitative objectives (specified as mean-payoff conditions), which we refer to as generalized mean-payoff objectives. The basic decision problem asks for the existence of a finite-memory strategy for a player that ensures the generalized mean-payoff objective be satisfied with a desired probability against all strategies of the opponent. A special case of the decision problem is the almost-sure problem where the desired probability is 1. Previous results presented a semi-decision procedure for ε-approximations of the almost-sure problem. In this work, we show that both the almost-sure problem as well as the general basic decision problem are coNP-complete, significantly improving the previous results. Moreover, we show that in the case of 1-player stochastic games, randomized memoryless strategies are sufficient and the problem can be solved in polynomial time. In contrast, in two-player stochastic games, we show that even with randomized strategies exponential memory is required in general, and present a matching exponential upper bound. We also study the basic decision problem with infinite-memory strategies and present computational complexity results for the problem. Our results are relevant in the synthesis of stochastic reactive systems with multiple quantitative requirements.Categories and Subject Descriptors F.2.2 [Computations on Discrete Structures]","PeriodicalId":206395,"journal":{"name":"2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131178804","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 18

Order-Invariance of Two-Variable Logic is Decidable 二变量逻辑的序不变性是可判定的

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-04-20 DOI: 10.1145/2933575.2933594

T. Zeume, Frederik Harwath

引用次数: 19

Reasoning about Recursive Probabilistic Programs* 递归概率程序的推理*

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-03-09 DOI: 10.1145/2933575.2935317

Federico Olmedo, Benjamin Lucien Kaminski, J. Katoen, C. Matheja

引用次数: 84

Trace semantics for polymorphic references* 多态引用的跟踪语义*

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-02-26 DOI: 10.1145/2933575.2934509

Guilhem Jaber, N. Tzevelekos

引用次数: 10

Rewriting modulo symmetric monoidal structure 改写模对称单轴结构

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-02-22 DOI: 10.1145/2933575.2935316

F. Bonchi, F. Gadducci, A. Kissinger, P. Sobocinski, F. Zanasi

引用次数: 51

The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems 无穷域约束满足问题的代数二分猜想

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-02-13 DOI: 10.1145/2933575.2934544

L. Barto, M. Pinsker

引用次数: 76

The complexity of regular abstractions of one-counter languages 单计数器语言的规则抽象的复杂性

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-02-10 DOI: 10.1145/2933575.2934561

M. Atig, D. Chistikov, Piotr Hofman, K. Kumar, Prakash Saivasan, Georg Zetzsche

引用次数: 9

Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction * 有条件下界的模型与目标分离:析取比合取更难*

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-02-08 DOI: 10.1145/2933575.2935304

K. Chatterjee, W. Dvořák, M. Henzinger, Veronika Loitzenbauer

{"title":"Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction *","authors":"K. Chatterjee, W. Dvořák, M. Henzinger, Veronika Loitzenbauer","doi":"10.1145/2933575.2935304","DOIUrl":"https://doi.org/10.1145/2933575.2935304","url":null,"abstract":"Given a model of a system and an objective, the model-checking question asks whether the model satisfies the objective. We study polynomial-time problems in two classical models, graphs and Markov Decision Processes (MDPs), with respect to several fundamental ω-regular objectives, e.g., Rabin and Streett objectives. For many of these problems the best-known upper bounds are quadratic or cubic, yet no super-linear lower bounds are known. In this work our contributions are two-fold: First, we present several improved algorithms, and second, we present the first conditional super-linear lower bounds based on widely believed assumptions about the complexity of CNF-SAT and combinatorial Boolean matrix multiplication. A separation result for two models with respect to an objective means a conditional lower bound for one model that is strictly higher than the existing upper bound for the other model, and similarly for two objectives with respect to a model. Our results establish the following separation results: (1) A separation of models (graphs and MDPs) for disjunctive queries of reachability and Büchi objectives. (2) Two kinds of separations of objectives, both for graphs and MDPs, namely, (2a) the separation of dual objectives such as Streett/Rabin objectives, and (2b) the separation of conjunction and disjunction of multiple objectives of the same type such as safety, Büchi, and coBüchi. In summary, our results establish the first model and objective separation results for graphs and MDPs for various classical ω-regular objectives. Quite strikingly, we establish conditional lower bounds for the disjunction of objectives that are strictly higher than the existing upper bounds for the conjunction of the same objectives.","PeriodicalId":206395,"journal":{"name":"2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"7 Suppl 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126330546","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 15

Winning Cores in Parity Games 在Parity游戏中赢得核心

2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Pub Date : 2016-02-05 DOI: 10.1145/2933575.2933589

Steen Vester

引用次数: 3