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 条

[31] Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars
Drewes, Frank
Engelfriett, Joost
ACTA CYBERNETICA, 2015, 22 (02): : 373 - 392
[32] INDUCTIVE INFERENCE OF CONTEXT-FREE LANGUAGES BASED ON CONTEXT-FREE EXPRESSIONS
YOKOMORI, T
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1988, 24 (02) : 115 - 140
[33] Context-free pairs of groups I: Context-free pairs and graphs
Ceccherini-Silberstein, Tullio
Woess, Wolfgang
EUROPEAN JOURNAL OF COMBINATORICS, 2012, 33 (07) : 1449 - 1466
[34] Proofs of proximity for context-free languages and read-once branching programs
Goldreich, Oded
Gur, Tom
Rothblum, Ron D.
INFORMATION AND COMPUTATION, 2018, 261 : 175 - 201
[35] Local model checking for parallel compositions of context-free processes
Hungar, H
CONCUR '94: CONCURRENCY THEORY, 1994, 836 : 114 - 128
[36] Partially-commutative context-free processes: Expressibility and tractability
Czerwinski, Wojciech
Froeschle, Sibylle
Lasota, Slawomir
INFORMATION AND COMPUTATION, 2011, 209 (05) : 782 - 798
[37] Fast equivalence-checking for normed context-free processes
Czerwinski, Wojciech
Lasota, Slawomir
IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2010), 2010, 8 : 260 - 271
[38] Faster algorithm for bisimulation equivalence of normed context-free processes
Lasota, Slawomir
Rytter, Wojciech
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2006, PROCEEDINGS, 2006, 4162 : 646 - 657
[39] DECIDABILITY OF BISIMULATION EQUIVALENCE FOR PROCESSES GENERATING CONTEXT-FREE LANGUAGES
BAETEN, JCM
BERGSTRA, JA
KLOP, JW
JOURNAL OF THE ACM, 1993, 40 (03) : 653 - 682
[40] Dedicability of bisimulation equivalence for processes generating context-free languages
Baeten, J.M.C.
Bergstra, J.A.
Klop, J.W.
1600, (40):

← 1 2 3 4 5 →