International Symposium on Games, Automata, Logics and Formal Verification最新文献_第3页

Bounded Game-Theoretic Semantics for Modal Mu-Calculus and Some Variants 模态mu -微积分的有界博弈论语义及其变体

International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2020-09-20 DOI: 10.4204/EPTCS.326.6

L. Hella, Antti Kuusisto, Raine Rönnholm

引用次数: 9

The Quotient in Preorder Theories 预购理论中的商

International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2020-09-20 DOI: 10.4204/EPTCS.326.14

Í. Í. Romeo, L. Mangeruca, T. Villa, A. Sangiovanni-Vincentelli

引用次数: 4

Symbolic Execution + Model Counting + Entropy Maximization = Automatic Search Synthesis 符号执行+模型计数+熵最大化=自动搜索合成

International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2020-09-20 DOI: 10.4204/EPTCS.326.4

M. Downing, A. Molavi, Lucas Bang

引用次数: 0

A Game Theoretical Semantics for Logics of Nonsense 无意义逻辑的博弈语义

International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2020-09-20 DOI: 10.4204/EPTCS.326.5

Can Başkent

引用次数: 1

LTLf Synthesis on Probabilistic Systems 概率系统的LTLf综合

International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2020-09-20 DOI: 10.4204/EPTCS.326.11

Andrew M. Wells, Morteza Lahijanian, L. Kavraki, Moshe Y. Vardi

引用次数: 21

LTLf Synthesis under Partial Observability: From Theory to Practice 部分可观测条件下LTLf综合:从理论到实践

International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2020-09-20 DOI: 10.4204/EPTCS.326.1

L. M. Tabajara, Moshe Y. Vardi

{"title":"LTLf Synthesis under Partial Observability: From Theory to Practice","authors":"L. M. Tabajara, Moshe Y. Vardi","doi":"10.4204/EPTCS.326.1","DOIUrl":"https://doi.org/10.4204/EPTCS.326.1","url":null,"abstract":"LTL synthesis is the problem of synthesizing a reactive system from a formal specification in Linear Temporal Logic. The extension of allowing for partial observability, where the system does not have direct access to all relevant information about the environment, allows generalizing this problem to a wider set of real-world applications, but the difficulty of implementing such an extension in practice means that it has remained in the realm of theory. Recently, it has been demonstrated that restricting LTL synthesis to systems with finite executions by using LTL with finite-horizon semantics (LTLf) allows for significantly simpler implementations in practice. With the conceptual simplicity of LTLf, it becomes possible to explore extensions such as partial observability in practice for the first time. Previous work has analyzed the problem of LTLf synthesis under partial observability theoretically and suggested two possible algorithms, one with 3EXPTIME and another with 2EXPTIME complexity. In this work, we first prove a complexity lower bound conjectured in earlier work. Then, we complement the theoretical analysis by showing how the two algorithms can be integrated in practice into an established framework for LTLf synthesis. We furthermore identify a third, MSO-based, approach enabled by this framework. Our experimental evaluation reveals very different results from what the theory seems to suggest, with the 3EXPTIME algorithm often outperforming the 2EXPTIME approach. Furthermore, as long as it is able to overcome an initial memory bottleneck, the MSO-based approach can often outperforms the others.","PeriodicalId":104855,"journal":{"name":"International Symposium on Games, Automata, Logics and Formal Verification","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124863007","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}

引用次数: 7

Canonicity in GFG and Transition-Based Automata GFG和基于转换的自动机的规定性

International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2020-09-20 DOI: 10.4204/EPTCS.326.13

Bader Abu Radi, O. Kupferman

{"title":"Canonicity in GFG and Transition-Based Automata","authors":"Bader Abu Radi, O. Kupferman","doi":"10.4204/EPTCS.326.13","DOIUrl":"https://doi.org/10.4204/EPTCS.326.13","url":null,"abstract":"Minimization of deterministic automata on finite words results in a {em canonical/} automaton. For deterministic automata on infinite words, no canonical minimal automaton exists, and a language may have different minimal deterministic Buchi (DBW) or co-Buchi (DCW) automata. In recent years, researchers have studied {em good-for-games/} (GFG) automata -- nondeterministic automata that can resolve their nondeterministic choices in a way that only depends on the past. Several applications of automata in formal methods, most notably synthesis, that are traditionally based on deterministic automata, can instead be based on GFG automata. The {em minimization/} problem for DBW and DCW is NP-complete, and it stays NP-complete for GFG Buchi and co-Buchi automata. On the other hand, minimization of GFG co-Buchi automata with {em transition-based/} acceptance (GFG-tNCWs) can be solved in polynomial time. In these automata, acceptance is defined by a set $alpha$ of transitions, and a run is accepting if it traverses transitions in $alpha$ only finitely often. This raises the question of canonicity of minimal deterministic and GFG automata with transition-based acceptance. In this paper we study this problem. We start with GFG-tNCWs and show that the safe components (that is, these obtained by restricting the transitions to these not in $alpha$) of all minimal GFG-tNCWs are isomorphic, and that by saturating the automaton with transitions in $alpha$ we get isomorphism among all minimal GFG-tNCWs. Thus, a canonical form for minimal GFG-tNCWs can be obtained in polynomial time. We continue to DCWs with transition-based acceptance (tDCWs), and their dual tDBWs. We show that here, while no canonical form for minimal automata exists, restricting attention to the safe components is useful, and implies that the only minimal tDCWs that have no canonical form are these for which the transition to the GFG model results in strictly smaller automaton, which do have a canonical minimal form.","PeriodicalId":104855,"journal":{"name":"International Symposium on Games, Automata, Logics and Formal Verification","volume":"55 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128359016","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}

引用次数: 4

Comparison of Algorithms for Simple Stochastic Games (Full Version) 简单随机对策的算法比较(完整版)

International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2020-08-21 DOI: 10.4204/EPTCS.326.9

Jan Křetínský, Emanuel Ramneantu, Alexander Slivinskiy, Maximilian Weininger

引用次数: 11

On the Power of Unambiguity in Büchi Complementation 论<s:1>气补语中歧义的力量

International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2020-05-18 DOI: 10.4204/EPTCS.326.12

Yong Li, Moshe Y. Vardi, Lijun Zhang

引用次数: 6

Synthesis in Presence of Dynamic Links 存在动态链接的合成

International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2020-02-18 DOI: 10.4204/EPTCS.326.3

B. Bérard, B. Bollig, P. Bouyer, Matthias Függer, N. Sznajder

{"title":"Synthesis in Presence of Dynamic Links","authors":"B. Bérard, B. Bollig, P. Bouyer, Matthias Függer, N. Sznajder","doi":"10.4204/EPTCS.326.3","DOIUrl":"https://doi.org/10.4204/EPTCS.326.3","url":null,"abstract":"The problem of distributed synthesis is to automatically generate a distributed algorithm, given a target communication network and a specification of the algorithm's correct behavior. Previous work has focused on static networks with an apriori fixed message size. This approach has two shortcomings: Recent work in distributed computing is shifting towards dynamically changing communication networks rather than static ones, and an important class of distributed algorithms are so-called full-information protocols, where nodes piggy-pack previously received messages onto current messages. In this work we consider the synthesis problem for a system of two nodes communicating in rounds over a dynamic link whose message size is not bounded. Given a network model, i.e., a set of link directions, in each round of the execution, the adversary choses a link from the network model, restricted only by the specification, and delivers messages according to the current link's directions. Motivated by communication buses with direct acknowledge mechanisms we further assume that nodes are aware of which messages have been delivered. We show that the synthesis problem is decidable for a network model if and only if it does not contain the empty link that dismisses both nodes' messages.","PeriodicalId":104855,"journal":{"name":"International Symposium on Games, Automata, Logics and Formal Verification","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115098382","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}

引用次数: 3