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 条

[41] DECIDABILITY OF BISIMULATION EQUIVALENCE FOR PROCESSES GENERATING CONTEXT-FREE LANGUAGES
BAETEN, JCM
BERGSTRA, JA
KLOP, JW
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 259 : 94 - 111
[42] FOOTLOOSE AND CONTEXT-FREE
PULLUM, GK
NATURAL LANGUAGE & LINGUISTIC THEORY, 1986, 4 (03) : 409 - 414
[43] Context-free sequences
1600, Springer Verlag (8687):
[44] Context-Free Sequences
Caucal, Didier
Le Gonidec, Marion
THEORETICAL ASPECTS OF COMPUTING - ICTAC 2014, 2014, 8687 : 259 - 276
[45] ON CONTEXT-FREE TREES
CAZANESCU, VE
THEORETICAL COMPUTER SCIENCE, 1985, 41 (01) : 33 - 50
[46] ON CONTEXT-FREE LANGUAGES
PARIKH, RJ
JOURNAL OF THE ACM, 1966, 13 (04) : 570 - +
[47] Context-free coalgebras
Winter, Joost
Bonsangue, Marcello M.
Rutten, Jan J. M. M.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2015, 81 (05) : 911 - 939
[48] Fractal Automata: Recursion in Context-Free and in Deterministic and Linear Context-Free Languages
Nagy, Benedek
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2025,
[49] Fuzzy context-free languages - Part 1: Generalized fuzzy context-free grammars
Asveld, PRJ
THEORETICAL COMPUTER SCIENCE, 2005, 347 (1-2) : 167 - 190
[50] Symbolic reachability analysis of higher-order context-free processes
Bouajjani, A
Meyer, A
FSTTCS 2004: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 2004, 3328 : 135 - 147

← 1 2 3 4 5 →