SILENCE IS GOLDEN - BRANCHING BISIMILARITY IS DECIDABLE FOR CONTEXT-FREE PROCESSES

被引：0

作者：

HUTTEL, H ^{[1
]}

机构：

[1] UNIV EDINBURGH, JCMB, FDN COMP SCI, EDINBURGH EH9 3JZ, MIDLOTHIAN, SCOTLAND

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1992年 / 575卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We show that the branching bisimulation equivalence introduced by Rob van Glabbeek is decidable for the class of normed, recursively defined BPA processes with silent actions, thus generalizing the decidability result for strong bisimilarity by Baeten, Bergstra, and Klop.

引用

页码：2 / 12

页数：11

共 50 条

[1] DECIDING BRANCHING BISIMILARITY OF NORMED CONTEXT-FREE PROCESSES IS IN SIGMA(P)(2)
CAUCAL, D
HUYNH, DT
TIAN, L
INFORMATION AND COMPUTATION, 1995, 118 (02) : 306 - 315
[2] BRANCHING BISIMULATION FOR CONTEXT-FREE PROCESSES
CAUCAL, D
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 652 : 316 - 327
[3] BISIMULATION EQUIVALENCE IS DECIDABLE FOR ALL CONTEXT-FREE PROCESSES
CHRISTENSEN, S
HUTTEL, H
STIRLING, C
INFORMATION AND COMPUTATION, 1995, 121 (02) : 143 - 148
[4] BISIMULATION EQUIVALENCE IS DECIDABLE FOR ALL CONTEXT-FREE PROCESSES
CHRISTENSEN, S
HUTTEL, H
STIRLING, C
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 630 : 138 - 147
[5] Fast algorithm for deciding bisimilarity of normed context-free processes
Hirshfeld, Y
Moller, F
CONCUR '94: CONCURRENCY THEORY, 1994, 836 : 48 - 63
[6] A polynomial algorithm for deciding bisimilarity of normed context-free processes
Hirshfeld, Y
Jerrum, M
Moller, F
THEORETICAL COMPUTER SCIENCE, 1996, 158 (1-2) : 143 - 159
[7] Weak bisimilarity and regularity of context-free processes is EXPITIME-hard
Mayr, R
THEORETICAL COMPUTER SCIENCE, 2005, 330 (03) : 553 - 575
[8] Deciding weak bisimilarity of normed context-free processes using tableau
Liu, Xinxin
Chen, Haiyan
THEORETICAL ASPECTS OF COMPUTING - ICTAC 2007, PROCEEDINGS, 2007, 4711 : 337 - +
[9] DECIDING BISIMILARITY OF NORMED CONTEXT-FREE PROCESSES IS IN SIGMA(2)P
HUYNH, DT
TIAN, L
THEORETICAL COMPUTER SCIENCE, 1994, 123 (02) : 183 - 197
[10] DECIDABLE SENTENCES FOR CONTEXT-FREE GROUPS
MADLENER, K
OTTO, F
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 480 : 160 - 171

← 1 2 3 4 5 →