2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science最新文献_第6页

Trading Performance for Stability in Markov Decision Processes 马尔可夫决策过程稳定性的交易绩效

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-04-23 DOI: 10.1109/LICS.2013.39

T. Brázdil, K. Chatterjee, Vojtěch Forejt, A. Kucera

{"title":"Trading Performance for Stability in Markov Decision Processes","authors":"T. Brázdil, K. Chatterjee, Vojtěch Forejt, A. Kucera","doi":"10.1109/LICS.2013.39","DOIUrl":"https://doi.org/10.1109/LICS.2013.39","url":null,"abstract":"We study the complexity of central controller synthesis problems for finite-state Markov decision processes, where the objective is to optimize both the expected mean-payoff performance of the system and its stability. We argue that the basic theoretical notion of expressing the stability in terms of the variance of the mean-payoff (called global variance in our paper) is not always sumcient, since it ignores possible instabilities on respective runs. For this reason we propose alernative definitions of stability, which we call local and hybrid variance, and which express how rewards on each run deviate from the run's own mean-payoff and from the expected mean-payoff, respectively. We show that a strategy ensuring both the expected mean-payoff and the variance below given bounds requires randomization and memory, under all the above semantics of variance. We then look at the problem of determining whether there is a such a strategy. For the global variance, we show that the problem is in PSPACE, and that the answer can be approximated in pseudo-polynomial time. For the hybrid variance, the analogous decision problem is in NP, and a polynomial-time approximating algorithm also exists. For local variance, we show that the decision problem is in NP. Since the overall performance can be traded for stability (and vice versa), we also present algorithms for approximating the associated Pareto curve in all the three cases. Finally, we study a special case of the decision problems, where we require a given expected mean-payoff together with zero variance. Here we show that the problems can be all solved in polynomial time.","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116155355","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}

引用次数: 39

Decidability of Weak Simulation on One-Counter Nets 单计数器网弱模拟的可判定性

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-04-15 DOI: 10.1109/LICS.2013.26

Piotr Hofman, Richard Mayr, Patrick Totzke

引用次数: 18

Abstract Machines for Game Semantics, Revisited 游戏语义的抽象机器，重访

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-04-15 DOI: 10.1109/LICS.2013.63

Olle Fredriksson, D. Ghica

{"title":"Abstract Machines for Game Semantics, Revisited","authors":"Olle Fredriksson, D. Ghica","doi":"10.1109/LICS.2013.63","DOIUrl":"https://doi.org/10.1109/LICS.2013.63","url":null,"abstract":"We define new abstract machines for game semantics which correspond to networks of conventional computers, and can be used as an intermediate representation for compilation targeting distributed systems. This is achieved in two steps. First we introduce the HRAM, a Heap and Register Abstract Machine, an abstraction of a conventional computer, which can be structured into HRAM nets, an abstract point-to-point network model. HRAMs are multi-threaded and subsume communication by tokens (cf. IAM) or jumps. Game Abstract Machines (GAM), are HRAMs with additional structure at the interface level, but no special operational capabilities. We show that GAMs cannot be naively composed, but composition must be mediated using appropriate HRAM combinators. HRAMs are flexible enough to allow the representation of game models for languages with state (non-innocent games) or concurrency (non-alternating games). We illustrate the potential of this technique by implementing a toy distributed compiler for ICA, a higher-order programming language with shared state concurrency, thus significantly extending our previous distributed PCF compiler. We show that compilation is sound and memory-safe, i.e. no (distributed or local) garbage collection is necessary.","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130080067","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

From Two-Way to One-Way Finite State Transducers 从双向到单向有限状态传感器

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-01-22 DOI: 10.1109/LICS.2013.53

E. Filiot, Olivier Gauwin, P. Reynier, Frédéric Servais

引用次数: 33

Calculating the Fundamental Group of the Circle in Homotopy Type Theory 同伦型理论中圆的基本群的计算

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2013-01-15 DOI: 10.1109/LICS.2013.28

Daniel R. Licata, Michael Shulman

引用次数: 75

A Categorical Treatment of Ornaments 饰品的分类处理

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2012-12-16 DOI: 10.1109/LICS.2013.60

Pierre-Évariste Dagand, Conor McBride

{"title":"A Categorical Treatment of Ornaments","authors":"Pierre-Évariste Dagand, Conor McBride","doi":"10.1109/LICS.2013.60","DOIUrl":"https://doi.org/10.1109/LICS.2013.60","url":null,"abstract":"Ornaments aim at taming the multiplication of special-purpose datatypes in dependently typed programming languages. In type theory, purpose is logic. By presenting datatypes as the combination of a structure and a logic, ornaments relate these special-purpose datatypes through their common structure. In the original presentation, the concept of ornament was introduced concretely for an example universe of inductive families in type theory, but it was clear that the notion was more general. This paper digs out the abstract notion of ornaments in the form of a categorical model. As a necessary first step, we abstract the universe of datatypes using the theory of polynomial functors. We are then able to characterise ornaments as cartesian morphisms between polynomial functors. We thus gain access to powerful mathematical tools that shall help us understand and develop ornaments. We shall also illustrate the adequacy of our model. Firstly, we rephrase the standard ornamental constructions into our framework. Thanks to its conciseness, we gain a deeper understanding of the structures at play. Secondly, we develop new ornamental constructions, by translating categorical structures into type theoretic artefacts.","PeriodicalId":425745,"journal":{"name":"2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114440915","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}

引用次数: 23

Model-Checking Parse Trees 模型检查解析树

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2012-11-22 DOI: 10.1109/LICS.2013.21

Anudhyan Boral, S. Schmitz

引用次数: 6

Expressive Completeness for Metric Temporal Logic 度量时间逻辑的表达完备性

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2012-08-24 DOI: 10.1109/LICS.2013.41

P. Hunter, J. Ouaknine, J. Worrell

引用次数: 37

Converging to the Chase -- A Tool for Finite Controllability 收敛于追逐——一个有限可控性的工具

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2012-04-16 DOI: 10.1109/LICS.2013.61

Tomasz Gogacz, J. Marcinkowski

引用次数: 22

From Qualitative to Quantitative Proofs of Security Properties Using First-Order Conditional Logic 用一阶条件逻辑从定性到定量证明安全性质

2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science Pub Date : 2008-04-14 DOI: 10.1109/LICS.2013.66

Joseph Y. Halpern

引用次数: 2