Model checking rationally restricted right closures of recognizable graphs

Q3 Computer Science Electronic Notes in Theoretical Computer Science Pub Date : 1997-01-01 Epub Date: 2005-05-17 DOI:10.1016/S1571-0661(05)80424-4

Olaf Burkart

引用次数: 0

Abstract

In this paper we present an elementary model-checking algorithm for the class of infinite transition graphs defined by rationally restricted right closures of recognizable graphs that decides the full modal mu calculus.

查看原文

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

本刊更多论文

模型检验合理地限制了可识别图的右闭包

本文给出了一类由可识别图的合理限制右闭包定义的无限转移图的初等模型检验算法，该类图决定了全模态mu演算。

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

求助全文

约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