时间自动机的Kleene定理

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science Pub Date : 1997-06-29 DOI:10.1109/LICS.1997.614944

E. Asarin, P. Caspi, O. Maler

{"title":"时间自动机的Kleene定理","authors":"E. Asarin, P. Caspi, O. Maler","doi":"10.1109/LICS.1997.614944","DOIUrl":null,"url":null,"abstract":"In this paper we define timed regular expressions, and extension of regular expressions for specifying sets of dense-time discrete-valued signals. We show that this formalism is equivalent in expressive power to the timed automata of Alur and Dill by providing a translation procedure from expressions to automata and vice versa. the result is extended to /spl omega/-regular expressions (Buchi's theorem).","PeriodicalId":272903,"journal":{"name":"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"122","resultStr":"{\"title\":\"A Kleene theorem for timed automata\",\"authors\":\"E. Asarin, P. Caspi, O. Maler\",\"doi\":\"10.1109/LICS.1997.614944\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we define timed regular expressions, and extension of regular expressions for specifying sets of dense-time discrete-valued signals. We show that this formalism is equivalent in expressive power to the timed automata of Alur and Dill by providing a translation procedure from expressions to automata and vice versa. the result is extended to /spl omega/-regular expressions (Buchi's theorem).\",\"PeriodicalId\":272903,\"journal\":{\"name\":\"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-06-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"122\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LICS.1997.614944\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LICS.1997.614944","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 122

摘要

本文定义了时间正则表达式，并对正则表达式进行了扩展，用于确定密集时间离散值信号集。通过提供从表达式到自动机的转换过程，我们证明了这种形式主义在表达能力上等同于Alur和Dill的时间自动机。将结果推广到/spl ω /-正则表达式(Buchi定理)。

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

查看原文本刊更多论文

A Kleene theorem for timed automata

In this paper we define timed regular expressions, and extension of regular expressions for specifying sets of dense-time discrete-valued signals. We show that this formalism is equivalent in expressive power to the timed automata of Alur and Dill by providing a translation procedure from expressions to automata and vice versa. the result is extended to /spl omega/-regular expressions (Buchi's theorem).

求助全文

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

来源期刊

Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science

自引率

0.00%

发文量