发布求助
文献互助 智能选刊 最新文献

International Symposium on Games, Automata, Logics and Formal Verification最新文献

筛选
英文 中文
Generating Tokenizers with Flat Automata 用平面自动机生成标记器
International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2022-09-20 DOI: 10.4204/EPTCS.370.5
H. D. Nivelle, Dina Muktubayeva
{"title":"Generating Tokenizers with Flat Automata","authors":"H. D. Nivelle, Dina Muktubayeva","doi":"10.4204/EPTCS.370.5","DOIUrl":"https://doi.org/10.4204/EPTCS.370.5","url":null,"abstract":"We introduce flat automata for automatic generation of tokenizers. Flat automata are a simple representation of standard finite automata. Using the flat representation, automata can be easily constructed, combined and printed. Due to the use of border functions, flat automata are more compact than standard automata in the case where intervals of characters are attached to transitions, and the standard algorithms on automata are simpler. We give the standard algorithms for tokenizer construction with automata, namely construction using regular operations, determinization, and minimization. We prove their correctness. The algorithms work with intervals of characters, but are not more complicated than their counterparts on single characters. It is easy to generate C++ code from the final deterministic automaton. All procedures have been implemented in C++ and are publicly available. The implementation has been used in applications and in teaching.","PeriodicalId":104855,"journal":{"name":"International Symposium on Games, Automata, Logics and Formal Verification","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124218603","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
Controller Synthesis for Timeline-based Games 基于时间轴的游戏的控制器合成
International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2022-09-20 DOI: 10.4204/EPTCS.370.9
Renato Acampora, Luca Geatti, N. Gigante, A. Montanari, Valentino Picotti
{"title":"Controller Synthesis for Timeline-based Games","authors":"Renato Acampora, Luca Geatti, N. Gigante, A. Montanari, Valentino Picotti","doi":"10.4204/EPTCS.370.9","DOIUrl":"https://doi.org/10.4204/EPTCS.370.9","url":null,"abstract":"In the timeline-based approach to planning, originally born in the space sector, the evolution over time of a set of state variables (the timelines) is governed by a set of temporal constraints. Traditional timeline-based planning systems excel at the integration of planning with execution by handling temporal uncertainty. In order to handle general nondeterminism as well, the concept of timeline-based games has been recently introduced. It has been proved that finding whether a winning strategy exists for such games is 2EXPTIME-complete. However, a concrete approach to synthesize controllers implementing such strategies is missing. This paper fills this gap, outlining an approach to controller synthesis for timeline-based games.","PeriodicalId":104855,"journal":{"name":"International Symposium on Games, Automata, Logics and Formal Verification","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123955521","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
On the Existential Fragments of Local First-Order Logics with Data 带数据的局部一阶逻辑的存在片段
International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2022-09-20 DOI: 10.4204/EPTCS.370.1
B. Bollig, Arnaud Sangnier, Olivier Stietel
{"title":"On the Existential Fragments of Local First-Order Logics with Data","authors":"B. Bollig, Arnaud Sangnier, Olivier Stietel","doi":"10.4204/EPTCS.370.1","DOIUrl":"https://doi.org/10.4204/EPTCS.370.1","url":null,"abstract":"We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain which can be compared wrt. equality. As the satisfiability problem for this logic is undecidable in general, in a previous work, we have introduced a family of local fragments that restrict quantification to neighbourhoods of a given reference point. We provide here the precise complexity characterisation of the satisfiability problem for the existential fragments of this local logic depending on the number of data values carried by each element and the radius of the considered neighbourhoods.","PeriodicalId":104855,"journal":{"name":"International Symposium on Games, Automata, Logics and Formal Verification","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123233347","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}
引用次数: 1
Characterizing the Decidability of Finite State Automata Team Games with Communication 具有通信的有限状态自动机团队游戏的可决性特征
International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2022-09-20 DOI: 10.4204/EPTCS.370.14
Michael J. Coulombe, J. Lynch
{"title":"Characterizing the Decidability of Finite State Automata Team Games with Communication","authors":"Michael J. Coulombe, J. Lynch","doi":"10.4204/EPTCS.370.14","DOIUrl":"https://doi.org/10.4204/EPTCS.370.14","url":null,"abstract":"In this paper we define a new model of limited communication for multiplayer team games of imperfect information. We prove that the Team DFA Game and Team Formula Game, which have bounded state, remain undecidable when players have a rate of communication which is less than the rate at which they make moves in the game. We also show that meeting this communication threshold causes these games to be decidable.","PeriodicalId":104855,"journal":{"name":"International Symposium on Games, Automata, Logics and Formal Verification","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116621362","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
Schema-Based Automata Determinization 基于模式的自动机确定
International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2022-09-20 DOI: 10.4204/EPTCS.370.4
Joachim Niehren, Momar Sakho, Antonio Al Serhali
{"title":"Schema-Based Automata Determinization","authors":"Joachim Niehren, Momar Sakho, Antonio Al Serhali","doi":"10.4204/EPTCS.370.4","DOIUrl":"https://doi.org/10.4204/EPTCS.370.4","url":null,"abstract":"We propose an algorithm for schema-based determinization of finite automata on words and of step-wise hedge automata on nested words. The idea is to integrate schema-based cleaning directly into automata determinization. We prove the correctness of our new algorithm and show that it is alway smore efficient than standard determinization followed by schema-based cleaning. Our implementation permits to obtain a small deterministic automaton for an example of an XPath query, where standard determinization yields a huge stepwise hedge automaton for which schema-based cleaning runs out of memory.","PeriodicalId":104855,"journal":{"name":"International Symposium on Games, Automata, Logics and Formal Verification","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115882123","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}
引用次数: 1
Complexity through Translations for Modal Logic with Recursion 递归模态逻辑转换的复杂性
International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2022-09-20 DOI: 10.4204/EPTCS.370.3
L. Aceto, A. Achilleos, Elli Anastasiadi, Adrian Francalanza, A. Ingólfsdóttir
{"title":"Complexity through Translations for Modal Logic with Recursion","authors":"L. Aceto, A. Achilleos, Elli Anastasiadi, Adrian Francalanza, A. Ingólfsdóttir","doi":"10.4204/EPTCS.370.3","DOIUrl":"https://doi.org/10.4204/EPTCS.370.3","url":null,"abstract":"This paper studies the complexity of classical modal logics and of their extension with fixed-point operators, using translations to transfer results across logics. In particular, we show several complexity results for multi-agent logics via translations to and from the mu-calculus and modal logic, which allow us to transfer known upper and lower bounds. We also use these translations to introduce a terminating tableau system for the logics we study, based on Kozen's tableau for the mu-calculus, and the one of Fitting and Massacci for modal logic.","PeriodicalId":104855,"journal":{"name":"International Symposium on Games, Automata, Logics and Formal Verification","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114741479","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}
引用次数: 1
Avoid One's Doom: Finding Cliff-Edge Configurations in Petri Nets 避免厄运:在Petri网中寻找悬崖边缘配置
International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2022-09-20 DOI: 10.4204/EPTCS.370.12
G. K. Aguirre-Samboní, S. Haar, Loïc Paulevé, Stefan Schwoon, Nick Würdemann
{"title":"Avoid One's Doom: Finding Cliff-Edge Configurations in Petri Nets","authors":"G. K. Aguirre-Samboní, S. Haar, Loïc Paulevé, Stefan Schwoon, Nick Würdemann","doi":"10.4204/EPTCS.370.12","DOIUrl":"https://doi.org/10.4204/EPTCS.370.12","url":null,"abstract":"A crucial question in analyzing a concurrent system is to determine its long-run behaviour, and in particular, whether there are irreversible choices in its evolution, leading into parts of the reachability space from which there is no return to other parts. Casting this problem in the unifying framework of safe Petri nets, our previous work has provided techniques for identifying attractors, i.e. terminal strongly connected components of the reachability space, whose attraction basins we wish to determine. Here, we provide a solution for the case of safe Petri nets. Our algorithm uses net unfoldings and provides a map of all of the system's configurations (concurrent executions) that act as cliff-edges, i.e. any maximal extension for those configurations lies in some basin that is considered fatal. The computation turns out to require only a relatively small prefix of the unfolding, just twice the depth of Esparza's complete prefix.","PeriodicalId":104855,"journal":{"name":"International Symposium on Games, Automata, Logics and Formal Verification","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116751097","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
Parametric Interval Temporal Logic over Infinite Words 无限字上的参数间隔时间逻辑
International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2022-09-20 DOI: 10.4204/EPTCS.370.7
L. Bozzelli, A. Peron
{"title":"Parametric Interval Temporal Logic over Infinite Words","authors":"L. Bozzelli, A. Peron","doi":"10.4204/EPTCS.370.7","DOIUrl":"https://doi.org/10.4204/EPTCS.370.7","url":null,"abstract":"Model checking for Halpern and Shoham's interval temporal logic HS has been recently investigated in a systematic way, and it is known to be decidable under three distinct semantics. Here, we focus on the trace-based semantics, where the infinite execution paths (traces) of the given (finite) Kripke structure are the main semantic entities. In this setting, each finite infix of a trace is interpreted as an interval, and a proposition holds over an interval if and only if it holds over each component state (homogeneity assumption). In this paper, we introduce a quantitative extension of HS over traces, called parametric HS (PHS). The novel logic allows to express parametric timing constraints on the duration (length) of the intervals. We show that checking the existence of a parameter valuation for which a Kripke structure satisfies a PHS formula (model checking), or a PHS formula admits a trace as a model under the homogeneity assumption (satisfiability) is decidable. Moreover, we identify a fragment of PHS which subsumes parametric LTL and for which model checking and satisfiability are shown to be EXPSPACE-complete.","PeriodicalId":104855,"journal":{"name":"International Symposium on Games, Automata, Logics and Formal Verification","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116426656","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
Capturing Bisimulation-Invariant Exponential-Time Complexity Classes 捕获双模拟不变指数时间复杂度类
International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2022-09-20 DOI: 10.4204/EPTCS.370.2
Florian Bruse, D. Kronenberger, M. Lange
{"title":"Capturing Bisimulation-Invariant Exponential-Time Complexity Classes","authors":"Florian Bruse, D. Kronenberger, M. Lange","doi":"10.4204/EPTCS.370.2","DOIUrl":"https://doi.org/10.4204/EPTCS.370.2","url":null,"abstract":"Otto's Theorem characterises the bisimulation-invariant PTIME queries over graphs as exactly those that can be formulated in the polyadic mu-calculus, hinging on the Immerman-Vardi Theorem which characterises PTIME (over ordered structures) by First-Order Logic with least fixpoints. This connection has been extended to characterise bisimulation-invariant EXPTIME by an extension of the polyadic mu-calculus with functions on predicates, making use of Immerman's characterisation of EXPTIME by Second-Order Logic with least fixpoints. In this paper we show that the bisimulation-invariant versions of all classes in the exponential time hierarchy have logical counterparts which arise as extensions of the polyadic mu-calculus by higher-order functions. This makes use of the characterisation of k-EXPTIME by Higher-Order Logic (of order k+1) with least fixpoints, due to Freire and Martins.","PeriodicalId":104855,"journal":{"name":"International Symposium on Games, Automata, Logics and Formal Verification","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114877162","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
Realizable and Context-Free Hyperlanguages 可实现的和上下文无关的超语言
International Symposium on Games, Automata, Logics and Formal Verification Pub Date : 2022-09-20 DOI: 10.4204/EPTCS.370.8
Hadar Frenkel, Sarai Sheinvald
{"title":"Realizable and Context-Free Hyperlanguages","authors":"Hadar Frenkel, Sarai Sheinvald","doi":"10.4204/EPTCS.370.8","DOIUrl":"https://doi.org/10.4204/EPTCS.370.8","url":null,"abstract":"Hyperproperties lift conventional trace-based languages from a set of execution traces to a set of sets of executions. From a formal-language perspective, these are sets of sets of words, namely hyperlanguages. Hyperautomata are based on classical automata models that are lifted to handle hyperlanguages. Finite hyperautomata (NFH) have been suggested to express regular hyperproperties. We study the realizability problem for regular hyperlanguages: given a set of languages, can it be precisely described by an NFH? We show that the problem is complex already for singleton hyperlanguages. We then go beyond regular hyperlanguages, and study context-free hyperlanguages. We show that the natural extension to context-free hypergrammars is highly undecidable. We then suggest a refined model, namely synchronous hypergrammars, which enables describing interesting non-regular hyperproperties, while retaining many decidable properties of context-free grammars.","PeriodicalId":104855,"journal":{"name":"International Symposium on Games, Automata, Logics and Formal Verification","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126410743","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}
引用次数: 1
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信