Skip to main content
Conference ProceedingsOPEN ACCESS

Silence is golden: Branching bisimilarity is decidable for context-free processes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1992) 575 LNCS 2-12
DOI: 10.1007/3-540-55179-4_2
11Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

Cite

CITATION STYLE

APA

Hüttel, H. (1992). Silence is golden: Branching bisimilarity is decidable for context-free processes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 575 LNCS, pp. 2–12). Springer Verlag. https://doi.org/10.1007/3-540-55179-4_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free