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 条

[11] Deciding the bisimilarity of context-free session types
Almeida, Bernardo
Mordido, Andreia
Vasconcelos, Vasco T.
TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PT II, TACAS 2020, 2020, 12079 : 39 - 56
[12] Actions speak louder than words: Proving bisimilarity for context-free processes
Huttel, H
Stirling, C
JOURNAL OF LOGIC AND COMPUTATION, 1998, 8 (04) : 485 - 509
[13] Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes
Czerwiniski, Wojciech
Hofman, Piotr
Lasota, Slawomir
CONCUR 2011: CONCURRENCY THEORY, 2011, 6901 : 528 - 542
[14] Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes
Czerwinski, Wojciech
Hofman, Piotr
Lasota, Sawomir
THEORY OF COMPUTING SYSTEMS, 2014, 55 (01) : 136 - 169
[15] BRANCHING PROCESSES WITH TERMINAL TYPES - APPLICATION TO CONTEXT-FREE GRAMMARS
SANKOFF, D
JOURNAL OF APPLIED PROBABILITY, 1971, 8 (02) : 233 - &
[16] Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes
Wojciech Czerwiński
Piotr Hofman
Sławomir Lasota
Theory of Computing Systems, 2014, 55 : 136 - 169
[17] IT IS DECIDABLE WHETHER A REGULAR LANGUAGE IS PURE CONTEXT-FREE
BUCHER, W
HAGAUER, J
THEORETICAL COMPUTER SCIENCE, 1983, 26 (1-2) : 233 - 241
[18] ENTROPIES AND COMBINATORICS OF RANDOM BRANCHING-PROCESSES AND CONTEXT-FREE LANGUAGES
MILLER, MI
OSULLIVAN, JA
IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (04) : 1292 - 1310
[19] A SUBCLASS OF DETERMINISTIC CONTEXT-FREE LANGUAGES WITH A DECIDABLE INCLUSION PROBLEM
GORSHKOV, PV
STAVROVSKII, AB
CYBERNETICS, 1990, 26 (02): : 156 - 162
[20] A strongly polynomial algorithm for criticality of branching processes and consistency of stochastic context-free grammars
Esparza, Javier
Gaiser, Andreas
Kiefer, Stefan
INFORMATION PROCESSING LETTERS, 2013, 113 (10-11) : 381 - 385

← 1 2 3 4 5 →