Reachability sets of parameterized rings as regular languages

Q3 Computer Science Electronic Notes in Theoretical Computer Science Pub Date : 1997-01-01 DOI:10.1016/S1571-0661(05)80427-X

Laurent Fribourg, Hans Olsén

引用次数: 0

Abstract

We present here a method for deriving a regular language that characterizes the set of reachable states of a given parameterized ring (made of N identical components). The method basically proceeds in two steps: first one generates a regular language L by inductive inference from a finite sample of reachable states; second one formally checks that L characterizes the whole set of reachable states.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

作为规则语言的参数化环的可达性集

本文提出了一种推导正则语言的方法，该语言描述了给定参数化环（由N个相同的组件组成）的可达状态集。该方法基本上分两步进行：第一步通过归纳推理从可达状态的有限样本生成正则语言L；第二种形式检查L是否表征了可达状态的全部集合。

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

求助全文

约1分钟内获得全文去求助

来源期刊

Electronic Notes in Theoretical Computer Science Computer Science-Computer Science (all)

自引率

0.00%

发文量

期刊介绍： ENTCS is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication and the availability on the electronic media is appropriate. Organizers of conferences whose proceedings appear in ENTCS, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.

期刊最新文献

Preface Murphree's Numerical Term Logic Tableaux A Note on Constructive Interpolation for the Multi-Modal Logic Km Paracomplete Logics Dual to the Genuine Paraconsistent Logics: The Three-valued Case Building a Maximal Independent Set for the Vertex-coloring Problem on Planar Graphs