CoRR最新文献_第6页

Parameterized Games and Parameterized Automata 参数化博弈和参数化自动机

CoRR Pub Date : 2018-09-07 DOI: 10.4204/EPTCS.277.3

A. Pauly

{"title":"Parameterized Games and Parameterized Automata","authors":"A. Pauly","doi":"10.4204/EPTCS.277.3","DOIUrl":"https://doi.org/10.4204/EPTCS.277.3","url":null,"abstract":"We introduce a way to parameterize automata and games on finite graphs with natural numbers. The parameters are accessed essentially by allowing counting down from the parameter value to 0 and branching depending on whether 0 has been reached. The main technical result is that in games, a player can win for some values of the parameters at all, if she can win for some values below an exponential bound. For many winning conditions, this implies decidability of any statements about a player being able to win with arbitrary quantification over the parameter values. \u0000While the result seems broadly applicable, a specific motivation comes from the study of chains of strategies in games. Chains of games were recently suggested as a means to define a rationality notion based on dominance that works well with quantitative games by Bassett, Jecker, P., Raskin and Van den Boogard. From the main result of this paper, we obtain generalizations of their decidability results with much simpler proofs. \u0000As both a core technical notion in the proof of the main result, and as a notion of potential independent interest, we look at boolean functions defined via graph game forms. Graph game forms have properties akin to monotone circuits, albeit are more concise. We raise some open questions regarding how concise they are exactly, which have a flavour similar to circuit complexity. Answers to these questions could improve the bounds in the main theorem.","PeriodicalId":10720,"journal":{"name":"CoRR","volume":"63 1","pages":"30-42"},"PeriodicalIF":0.0,"publicationDate":"2018-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73335205","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}

引用次数: 0

Complexity of Timeline-Based Planning over Dense Temporal Domains: Exploring the Middle Ground 密集时间域上基于时间线的规划的复杂性:探索中间地带

CoRR Pub Date : 2018-09-07 DOI: 10.4204/EPTCS.277.14

L. Bozzelli, A. Molinari, A. Montanari, A. Peron

{"title":"Complexity of Timeline-Based Planning over Dense Temporal Domains: Exploring the Middle Ground","authors":"L. Bozzelli, A. Molinari, A. Montanari, A. Peron","doi":"10.4204/EPTCS.277.14","DOIUrl":"https://doi.org/10.4204/EPTCS.277.14","url":null,"abstract":"In this paper, we address complexity issues for timeline-based planning over dense temporal domains. The planning problem is modeled by means of a set of independent, but interacting, components, each one represented by a number of state variables, whose behavior over time (timelines) is governed by a set of temporal constraints (synchronization rules). While the temporal domain is usually assumed to be discrete, here we consider the dense case. Dense timeline-based planning has been recently shown to be undecidable in the general case; decidability (NP-completeness) can be recovered by restricting to purely existential synchronization rules (trigger-less rules). In this paper, we investigate the unexplored area of intermediate cases in between these two extremes. We first show that decidability and non-primitive recursive-hardness can be proved by admitting synchronization rules with a trigger, but forcing them to suitably check constraints only in the future with respect to the trigger (future simple rules). More \"tractable\" results can be obtained by additionally constraining the form of intervals in future simple rules: EXPSPACE-completeness is guaranteed by avoiding singular intervals, PSPACE-completeness by admitting only intervals of the forms [0,a] and [b,$infty$[.","PeriodicalId":10720,"journal":{"name":"CoRR","volume":"9 1","pages":"191-205"},"PeriodicalIF":0.0,"publicationDate":"2018-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88361152","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}

引用次数: 5

Effortless Fault Localisation: Conformance Testing of Real-Time Systems in Ecdar 轻松的故障定位:Ecdar实时系统的一致性测试

CoRR Pub Date : 2018-09-07 DOI: 10.4204/EPTCS.277.11

Tobias R. Gundersen, Florian Lorber, Ulrik Nyman, Christian Ovesen

引用次数: 3

On Computing the Measures of First-Order Definable Sets of Trees 关于一阶树可定义集测度的计算

CoRR Pub Date : 2018-09-07 DOI: 10.4204/EPTCS.277.15

Marcin Przybylko

引用次数: 2

Multi-weighted Markov Decision Processes with Reachability Objectives 具有可达性目标的多加权马尔可夫决策过程

CoRR Pub Date : 2018-09-07 DOI: 10.4204/EPTCS.277.18

P. Bouyer, Mauricio González, N. Markey, Mickael Randour