arXiv - CS - Formal Languages and Automata Theory最新文献_第4页

Parameterized Verification of Systems with Precise (0,1)-Counter Abstraction 使用精确（0,1）计数器抽象对系统进行参数化验证

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-08-12 DOI: arxiv-2408.05954

Paul Eichler, Swen Jacobs, Chana Weil-Kennedy

引用次数: 0

High-order observers and high-order state-estimation-based properties of discrete-event systems 离散事件系统的高阶观测器和基于高阶状态估计的特性

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-08-12 DOI: arxiv-2408.06141

Kuize Zhang, Xiaoguang Han, Alessandro Giua, Carla Seatzu

{"title":"High-order observers and high-order state-estimation-based properties of discrete-event systems","authors":"Kuize Zhang, Xiaoguang Han, Alessandro Giua, Carla Seatzu","doi":"arxiv-2408.06141","DOIUrl":"https://doi.org/arxiv-2408.06141","url":null,"abstract":"State-estimation-based properties are central properties in discrete-event\u0000systems modeled by labeled finite-state automata studied over the past 3\u0000decades. Most existing results are based on a single agent who knows the\u0000structure of a system and can observe a subset of events and estimate the\u0000system's state based on the system's structure and the agent's observation to\u0000the system. The main tool used to do state estimation and verify\u0000state-estimation-based properties is called emph{observer} which is the\u0000powerset construction originally proposed by Rabin and Scott in 1959, used to\u0000determinize a nondeterministic finite automaton with $varepsilon$-transitions. In this paper, we consider labeled finite-state automata, extend the\u0000state-estimation-based properties from a single agent to a finite ordered set\u0000of agents and also extend the original observer to emph{high-order observer}\u0000based on the original observer and our emph{concurrent composition}. As a\u0000result, a general framework on high-order state-estimation-based properties\u0000have been built and a basic tool has also been built to verify such properties.\u0000This general framework contains many basic properties as its members such as\u0000state-based opacity, critical observability, determinism, high-order opacity,\u0000etc. Special cases for which verification can be done more efficiently are also\u0000discussed. In our general framework, the system's structure is publicly known to all\u0000agents $A_1,dots,A_n$, each agent $A_i$ has its own observable event set\u0000$E_i$, and additionally knows all its preceding agents' observable events but\u0000can only observe its own observable events. The intuitive meaning of our\u0000high-order observer is what agent $A_n$ knows about what $A_{n-1}$ knows about\u0000dots what $A_2$ knows about $A_1$'s state estimate of the system.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"96 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142197225","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

Parameterized Verification of Timed Networks with Clock Invariants 具有时钟不变性的定时网络参数化验证

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-08-09 DOI: arxiv-2408.05190

Étienne André, Swen Jacobs, Shyam Lal Karra, Ocan Sankur

引用次数: 0

Alternating Nominal Automata with Name Allocation 名称分配交替名义自动机

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-08-07 DOI: arxiv-2408.03658

Florian Frank, Daniel Hausmann, Stefan Milius, Lutz Schröder, Henning Urbat

{"title":"Alternating Nominal Automata with Name Allocation","authors":"Florian Frank, Daniel Hausmann, Stefan Milius, Lutz Schröder, Henning Urbat","doi":"arxiv-2408.03658","DOIUrl":"https://doi.org/arxiv-2408.03658","url":null,"abstract":"Formal languages over infinite alphabets serve as abstractions of structures\u0000and processes carrying data. Automata models over infinite alphabets, such as\u0000classical register automata or, equivalently, nominal orbit-finite automata,\u0000tend to have computationally hard or even undecidable reasoning problems unless\u0000stringent restrictions are imposed on either the power of control or the number\u0000of registers. This has been shown to be ameliorated in automata models with\u0000name allocation such as regular nondeterministic nominal automata, which allow\u0000for deciding language inclusion in elementary complexity even with unboundedly\u0000many registers while retaining a reasonable level of expressiveness. In the\u0000present work, we demonstrate that elementary complexity survives under\u0000extending the power of control to alternation: We introduce regular alternating\u0000nominal automata (RANAs), and show that their non-emptiness and inclusion\u0000problems have elementary complexity even when the number of registers is\u0000unbounded. Moreover, we show that RANAs allow for nearly complete\u0000de-alternation, specifically de-alternation up to a single deadlocked universal\u0000state.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"58 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141937351","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

LLMs as Probabilistic Minimally Adequate Teachers for DFA Learning LLM 作为 DFA 学习的概率最小充分教师

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-08-06 DOI: arxiv-2408.02999

Lekai Chen, Ashutosh Trivedi, Alvaro Velasquez

{"title":"LLMs as Probabilistic Minimally Adequate Teachers for DFA Learning","authors":"Lekai Chen, Ashutosh Trivedi, Alvaro Velasquez","doi":"arxiv-2408.02999","DOIUrl":"https://doi.org/arxiv-2408.02999","url":null,"abstract":"The emergence of intelligence in large language models (LLMs) has inspired\u0000investigations into their integration into automata learning. This paper\u0000introduces the probabilistic Minimally Adequate Teacher (pMAT) formulation,\u0000which leverages a probabilistic oracle that could give persistent errors\u0000randomly during answering the membership queries for deterministic finite\u0000automata (DFA) learning. Given the tendency of LLMs to produce hallucinatory\u0000content, we have developed techniques to improve answer accuracy and ensure the\u0000correctness of the learned automata. We propose the $mathtt{Discrimination}$\u0000prompt as well as the $mathtt{Verification}$ prompt and explore their\u0000advantages over common prompts. Additionally, we compare DFA learning\u0000performance between the TTT algorithm and common active learning algorithms. To\u0000address the exponential number of persistent errors, we implement a dynamic\u0000query cache refinement algorithm that identifies and corrects conflicting\u0000queries by combining the active and passive learning algorithms. The empirical\u0000results demonstrate the robustness and efficiency of our approach, providing a\u0000theoretical foundation for automata learning with LLMs in the loop.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"62 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141937357","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

Hierarchical Clustering using Reversible Binary Cellular Automata for High-Dimensional Data 利用可逆二元蜂窝自动机对高维数据进行分层聚类

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-08-05 DOI: arxiv-2408.02250

Baby C. J., Kamalika Bhattacharjee

{"title":"Hierarchical Clustering using Reversible Binary Cellular Automata for High-Dimensional Data","authors":"Baby C. J., Kamalika Bhattacharjee","doi":"arxiv-2408.02250","DOIUrl":"https://doi.org/arxiv-2408.02250","url":null,"abstract":"This work proposes a hierarchical clustering algorithm for high-dimensional\u0000datasets using the cyclic space of reversible finite cellular automata. In\u0000cellular automaton (CA) based clustering, if two objects belong to the same\u0000cycle, they are closely related and considered as part of the same cluster.\u0000However, if a high-dimensional dataset is clustered using the cycles of one CA,\u0000closely related objects may belong to different cycles. This paper identifies\u0000the relationship between objects in two different cycles based on the median of\u0000all elements in each cycle so that they can be grouped in the next stage.\u0000Further, to minimize the number of intermediate clusters which in turn reduces\u0000the computational cost, a rule selection strategy is taken to find the best\u0000rules based on information propagation and cycle structure. After encoding the\u0000dataset using frequency-based encoding such that the consecutive data elements\u0000maintain a minimum hamming distance in encoded form, our proposed clustering\u0000algorithm iterates over three stages to finally cluster the data elements into\u0000the desired number of clusters given by user. This algorithm can be applied to\u0000various fields, including healthcare, sports, chemical research, agriculture,\u0000etc. When verified over standard benchmark datasets with various performance\u0000metrics, our algorithm is at par with the existing algorithms with quadratic\u0000time complexity.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"8 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141937353","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

A Tree Sampler for Bounded Context-Free Languages 有界无上下文语言的树状采样器

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-08-03 DOI: arxiv-2408.01849

Breandan Considine

引用次数: 0

Complex event recognition meets hierarchical conjunctive queries 复杂事件识别满足分层连接查询

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-08-03 DOI: arxiv-2408.01652

Dante Pinto, Cristian Riveros

{"title":"Complex event recognition meets hierarchical conjunctive queries","authors":"Dante Pinto, Cristian Riveros","doi":"arxiv-2408.01652","DOIUrl":"https://doi.org/arxiv-2408.01652","url":null,"abstract":"Hierarchical conjunctive queries (HCQ) are a subclass of conjunctive queries\u0000(CQ) with robust algorithmic properties. Among others, Berkholz, Keppeler, and\u0000Schweikardt have shown that HCQ is the subclass of CQ (without projection) that\u0000admits dynamic query evaluation with constant update time and constant delay\u0000enumeration. On a different but related setting stands Complex Event\u0000Recognition (CER), a prominent technology for evaluating sequence patterns over\u0000streams. Since one can interpret a data stream as an unbounded sequence of\u0000inserts in dynamic query evaluation, it is natural to ask to which extent CER\u0000can take advantage of HCQ to find a robust class of queries that can be\u0000evaluated efficiently. In this paper, we search to combine HCQ with sequence patterns to find a\u0000class of CER queries that can get the best of both worlds. To reach this goal,\u0000we propose a class of complex event automata model called Parallelized Complex\u0000Event Automata (PCEA) for evaluating CER queries with correlation (i.e., joins)\u0000over streams. This model allows us to express sequence patterns and compare\u0000values among tuples, but it also allows us to express conjunctions by\u0000incorporating a novel form of non-determinism that we call parallelization. We\u0000show that for every HCQ (under bag semantics), we can construct an equivalent\u0000PCEA. Further, we show that HCQ is the biggest class of acyclic CQ that this\u0000automata model can define. Then, PCEA stands as a sweet spot that precisely\u0000expresses HCQ (i.e., among acyclic CQ) and extends them with sequence patterns.\u0000Finally, we show that PCEA also inherits the good algorithmic properties of HCQ\u0000by presenting a streaming evaluation algorithm under sliding windows with\u0000logarithmic update time and output-linear delay for the class of PCEA with\u0000equality predicates.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"42 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141937356","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

Regular Grammars for Graph Sets of Tree-Width $leq2$ 树宽为 $leq2$ 的图集的正则语法

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-08-02 DOI: arxiv-2408.01226

Marius Bozga, Radu Iosif, Florian Zuleger

{"title":"Regular Grammars for Graph Sets of Tree-Width $leq2$","authors":"Marius Bozga, Radu Iosif, Florian Zuleger","doi":"arxiv-2408.01226","DOIUrl":"https://doi.org/arxiv-2408.01226","url":null,"abstract":"Regular and context-free languages form a central pillar of formal language\u0000theory. This is because a variety of formalisms are known that define these\u0000classes of languages. For example, we have that finite automata, monoids,\u0000algebraic recognizability, regular expressions, regular grammars,\u0000monadic-second order logic, etc., can be used to represent regular word\u0000languages. However, the situation is less clear for formal languages over\u0000graphs, and open problems persist. This is because generalizing notions from\u0000words to graphs has been more successful for some of the cited formalisms than\u0000for the other ones. Bruno Courcelle has introduced hyper-edge replacement (hr)\u0000algebras for generalizing the notion of context-free languages from words to\u0000graphs. At the same time, hr-algebras support the generalization of algebraic\u0000recognizability from words to graphs, a notion that has been proven to be\u0000equivalent to definability in (counting) monadic-second order logic (cmso)\u0000over graphs of bounded tree-width. In this paper, we deal with generalizing\u0000regular word grammars to graphs. We propose regular grammars for (unordered and\u0000unranked) trees, series-parallel graphs, and graphs of tree-width $le 2$,\u0000where the qualifier regular is justified because these grammars define exactly\u0000the recognizable resp. cmso-definable subsets of the respective graph classes.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"23 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141937355","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

RE#: High Performance Derivative-Based Regex Matching with Intersection, Complement and Lookarounds RE#：基于派生词的高性能 Regex 匹配（带交集、补全和查找功能

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-07-30 DOI: arxiv-2407.20479

Ian Erik Varatalu, Margus Veanes, Juhan-Peep Ernits

引用次数: 0