Edinburgh EH9 3JZ SCOTLAND
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. 1
Citations
| 2762 | Communication and Concurrency – Milner - 1989 |
| 203 | Branching time and abstraction in bisimulation semantics – Glabbeek, Weijland - 1996 |
| 98 | Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages – Baeten, Bergstra, et al. - 1993 |
| 55 | Comparative Concurrency Semantics and Refinement of Actions – Glabbeek - 1990 |
| 42 | Actions speak louder than words: Proving bisimilarity for context-free processes – Huttel, Stirling - 1991 |
| 30 | Process Theory based on Bisimulation Semantics – Bergstra, Klop - 1988 |
| 26 | Simple deterministic languages – Korenjak, Hopcroft - 1966 |
| 11 | Characterizing kripke structures in temporal logic – Brown, Clarke, et al. - 1987 |
| 11 | Graphes canoniques de graphes algebriques. Rapport de Recherche 872 – Caucal - 1988 |
