Branching bisimulation for context-free processes

Abstract : The branching bisimulation defined by Van Glabbeek and Weijland takes care of preserving the branching structure of processes even though silent actions are taken. Branching bisimulation is obviously decidable for finite state processes. A proof that it is also decidable for reduced and proper context-free processes has been given by Huttel. Going further along these lines, we prove that the class of reduced and proper context-free processes is closed under quotient by their greates branching bisimulation. moreover, the construction of the factor graph is in PSPACE.
Type de document :
Rapport
[Research Report] RR-1789, INRIA. 1992
Liste complète des métadonnées

https://hal.inria.fr/inria-00077029
Contributeur : Rapport de Recherche Inria <>
Soumis le : lundi 29 mai 2006 - 11:55:47
Dernière modification le : mardi 24 avril 2018 - 13:37:19
Document(s) archivé(s) le : vendredi 13 mai 2011 - 20:57:52

Fichiers

Identifiants

  • HAL Id : inria-00077029, version 1

Citation

Didier Caucal, Dung Huynh, Lu Tian. Branching bisimulation for context-free processes. [Research Report] RR-1789, INRIA. 1992. 〈inria-00077029〉

Partager

Métriques

Consultations de la notice

294

Téléchargements de fichiers

69