学习带有寄存器的 EFSM 模型

arXiv - CS - Formal Languages and Automata Theory Pub Date : 2024-06-11 DOI:arxiv-2406.07040

Germán Vega, Roland Groz, Catherine Oriat, Michael Foster, Neil Walkinshaw, Adenilso Simão

{"title":"学习带有寄存器的 EFSM 模型","authors":"Germán Vega, Roland Groz, Catherine Oriat, Michael Foster, Neil Walkinshaw, Adenilso Simão","doi":"arxiv-2406.07040","DOIUrl":null,"url":null,"abstract":"This paper presents an active inference method for Extended Finite State\nMachines, where inputs and outputs are parametrized, and transitions can be\nconditioned by guards involving input parameters and internal variables called\nregisters. The method applies to (software) systems that cannot be reset, so it\nlearns an EFSM model of the system on a single trace.","PeriodicalId":501124,"journal":{"name":"arXiv - CS - Formal Languages and Automata Theory","volume":"35 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Learning EFSM Models with Registers in Guards\",\"authors\":\"Germán Vega, Roland Groz, Catherine Oriat, Michael Foster, Neil Walkinshaw, Adenilso Simão\",\"doi\":\"arxiv-2406.07040\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents an active inference method for Extended Finite State\\nMachines, where inputs and outputs are parametrized, and transitions can be\\nconditioned by guards involving input parameters and internal variables called\\nregisters. The method applies to (software) systems that cannot be reset, so it\\nlearns an EFSM model of the system on a single trace.\",\"PeriodicalId\":501124,\"journal\":{\"name\":\"arXiv - CS - Formal Languages and Automata Theory\",\"volume\":\"35 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Formal Languages and Automata Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2406.07040\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Formal Languages and Automata Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2406.07040","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文提出了一种用于扩展有限状态机的主动推理方法，在这种推理方法中，输入和输出都是参数化的，转换可以通过涉及输入参数和称为寄存器的内部变量的守护来进行。该方法适用于无法重置的（软件）系统，因此它能在单条轨迹上识别系统的扩展有限状态机模型。

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

查看原文本刊更多论文

Learning EFSM Models with Registers in Guards

This paper presents an active inference method for Extended Finite State Machines, where inputs and outputs are parametrized, and transitions can be conditioned by guards involving input parameters and internal variables called registers. The method applies to (software) systems that cannot be reset, so it learns an EFSM model of the system on a single trace.

求助全文

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

来源期刊

arXiv - CS - Formal Languages and Automata Theory

自引率

0.00%

发文量