时间自动机的成员关系测试

IF 0.4 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

Acta Informatica Pub Date : 2023-07-17 DOI:10.1007/s00236-023-00442-8

Richard Lassaigne, Michel de Rougemont

{"title":"时间自动机的成员关系测试","authors":"Richard Lassaigne, Michel de Rougemont","doi":"10.1007/s00236-023-00442-8","DOIUrl":null,"url":null,"abstract":"<div>Given a timed automaton which admits thick components and a timed word w, we present a tester which decides if w is in the language of the automaton or if w is \\(\\epsilon \\)-far from the language, using finitely many samples taken from the weighted time distribution \\(\\mu \\) associated with the input w. We introduce a distance between timed words, the timed edit distance, which generalizes the classical edit distance. A timed word w is \\(\\epsilon \\)-far from a timed language if its relative distance to the language is greater than \\(\\epsilon \\).</div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2023-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Testing membership for timed automata\",\"authors\":\"Richard Lassaigne, Michel de Rougemont\",\"doi\":\"10.1007/s00236-023-00442-8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>Given a timed automaton which admits thick components and a timed word w, we present a tester which decides if w is in the language of the automaton or if w is \\\\(\\\\epsilon \\\\)-far from the language, using finitely many samples taken from the weighted time distribution \\\\(\\\\mu \\\\) associated with the input w. We introduce a distance between timed words, the timed edit distance, which generalizes the classical edit distance. A timed word w is \\\\(\\\\epsilon \\\\)-far from a timed language if its relative distance to the language is greater than \\\\(\\\\epsilon \\\\).</div>\",\"PeriodicalId\":7189,\"journal\":{\"name\":\"Acta Informatica\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2023-07-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Acta Informatica\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00236-023-00442-8\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Informatica","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s00236-023-00442-8","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

给定一个允许厚分量和定时词w的定时自动机，我们提出了一个测试仪，该测试仪使用从与输入w相关的加权时间分布\（\mu\）中提取的有限多个样本来判断w是否在自动机的语言中，或者w是否远离该语言，从而推广了经典的编辑距离。定时词w是\（\epsilon\）-如果它与定时语言的相对距离大于\（\eptilon\），则与定时语言相距甚远。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

Testing membership for timed automata

查看原文本刊更多论文

Testing membership for timed automata

Given a timed automaton which admits thick components and a timed word w, we present a tester which decides if w is in the language of the automaton or if w is \(\epsilon \)-far from the language, using finitely many samples taken from the weighted time distribution \(\mu \) associated with the input w. We introduce a distance between timed words, the timed edit distance, which generalizes the classical edit distance. A timed word w is \(\epsilon \)-far from a timed language if its relative distance to the language is greater than \(\epsilon \).

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Acta Informatica 工程技术-计算机：信息系统

CiteScore

2.40

自引率

16.70%

发文量

审稿时长

>12 weeks

期刊介绍： Acta Informatica provides international dissemination of articles on formal methods for the design and analysis of programs, computing systems and information structures, as well as related fields of Theoretical Computer Science such as Automata Theory, Logic in Computer Science, and Algorithmics. Topics of interest include: • semantics of programming languages • models and modeling languages for concurrent, distributed, reactive and mobile systems • models and modeling languages for timed, hybrid and probabilistic systems • specification, program analysis and verification • model checking and theorem proving • modal, temporal, first- and higher-order logics, and their variants • constraint logic, SAT/SMT-solving techniques • theoretical aspects of databases, semi-structured data and finite model theory • theoretical aspects of artificial intelligence, knowledge representation, description logic • automata theory, formal languages, term and graph rewriting • game-based models, synthesis • type theory, typed calculi • algebraic, coalgebraic and categorical methods • formal aspects of performance, dependability and reliability analysis • foundations of information and network security • parallel, distributed and randomized algorithms • design and analysis of algorithms • foundations of network and communication protocols.