Semantic Reachability

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

Richard Mayr , E. N. T. C. S.

引用次数: 0

Abstract

This paper is an approach to combine the reachability problem with semantic notions like bisimulation equivalence. It deals with questions of the following form: Is there a reachable state that is bisimulation equivalent to a given state ? Here we show some decidability results for process algebras and Petri nets.

查看原文

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

本刊更多论文

语义可达性

本文是一种将可达性问题与双模拟等价等语义概念相结合的方法。它处理以下形式的问题：是否存在与给定状态等价的双模拟可达状态？本文给出了过程代数和Petri网的一些可判决性结果。

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

求助全文

约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