Bisimilarity of processes with finite-state systems

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

Petr Jancar, Antonín Kucera

引用次数: 0

Abstract

We describe a general method for deciding bisimilarity for pairs of processes where one process has finitely many states. We apply this method to pushdown processes and to PA processes. We also demonstrate that the mentioned problem is undecidable for ‘state-extended' PA processes.

查看原文

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

本刊更多论文

有限状态系统过程的双相似性

本文描述了一种确定过程对双相似度的一般方法，其中一个过程有有限多个状态。我们将这种方法应用于下推过程和PA过程。我们还证明了上述问题对于“状态扩展”PA过程是不可确定的。

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

求助全文

约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